Compound Interest

Average Error: 47.6 → 16.0

Time: 14.6s

Precision: 64

Math

\[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}\]

↓

\[\begin{array}{l} \mathbf{if}\;i \le -0.028332219067036327:\\ \;\;\;\;100 \cdot \frac{{\left({\left(1 + \frac{i}{n}\right)}^{n}\right)}^{3} - {1}^{3}}{\left(1 \cdot \left(1 + {\left(1 + \frac{i}{n}\right)}^{n}\right) + {\left(1 + \frac{i}{n}\right)}^{\left(2 \cdot n\right)}\right) \cdot \frac{i}{n}}\\ \mathbf{elif}\;i \le 4.0112595993165771 \cdot 10^{-4}:\\ \;\;\;\;\left(100 \cdot \frac{\left(1 \cdot i + \left(0.5 \cdot {i}^{2} + \log 1 \cdot n\right)\right) - 0.5 \cdot \left({i}^{2} \cdot \log 1\right)}{i}\right) \cdot n\\ \mathbf{else}:\\ \;\;\;\;\left(100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{i}\right) \cdot n\\ \end{array}\]

C

double code(double i, double n) {
	return ((double) (100.0 * ((double) (((double) (((double) pow(((double) (1.0 + ((double) (i / n)))), n)) - 1.0)) / ((double) (i / n))))));
}

↓

double code(double i, double n) {
	double VAR;
	if ((i <= -0.028332219067036327)) {
		VAR = ((double) (100.0 * ((double) (((double) (((double) pow(((double) pow(((double) (1.0 + ((double) (i / n)))), n)), 3.0)) - ((double) pow(1.0, 3.0)))) / ((double) (((double) (((double) (1.0 * ((double) (1.0 + ((double) pow(((double) (1.0 + ((double) (i / n)))), n)))))) + ((double) pow(((double) (1.0 + ((double) (i / n)))), ((double) (2.0 * n)))))) * ((double) (i / n))))))));
	} else {
		double VAR_1;
		if ((i <= 0.0004011259599316577)) {
			VAR_1 = ((double) (((double) (100.0 * ((double) (((double) (((double) (((double) (1.0 * i)) + ((double) (((double) (0.5 * ((double) pow(i, 2.0)))) + ((double) (((double) log(1.0)) * n)))))) - ((double) (0.5 * ((double) (((double) pow(i, 2.0)) * ((double) log(1.0)))))))) / i)))) * n));
		} else {
			VAR_1 = ((double) (((double) (100.0 * ((double) (((double) (((double) pow(((double) (1.0 + ((double) (i / n)))), n)) - 1.0)) / i)))) * n));
		}
		VAR = VAR_1;
	}
	return VAR;
}

Error

Bits error versus i

Bits error versus n

Target

Original	47.6
Target	47.2
Herbie	16.0

\[100 \cdot \frac{e^{n \cdot \begin{array}{l} \mathbf{if}\;1 + \frac{i}{n} = 1:\\ \;\;\;\;\frac{i}{n}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{i}{n} \cdot \log \left(1 + \frac{i}{n}\right)}{\left(\frac{i}{n} + 1\right) - 1}\\ \end{array}} - 1}{\frac{i}{n}}\]

Derivation

1. Split input into 3 regimes

2. if i < -0.028332219067036327

   1. Initial program 27.1

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}\]
   2. Using strategy rm

   3. Applied flip3-- 27.1

      \[\leadsto 100 \cdot \frac{\color{blue}{\frac{{\left({\left(1 + \frac{i}{n}\right)}^{n}\right)}^{3} - {1}^{3}}{{\left(1 + \frac{i}{n}\right)}^{n} \cdot {\left(1 + \frac{i}{n}\right)}^{n} + \left(1 \cdot 1 + {\left(1 + \frac{i}{n}\right)}^{n} \cdot 1\right)}}}{\frac{i}{n}}\]

   4. Applied associate-/l/ 27.1

      \[\leadsto 100 \cdot \color{blue}{\frac{{\left({\left(1 + \frac{i}{n}\right)}^{n}\right)}^{3} - {1}^{3}}{\frac{i}{n} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot {\left(1 + \frac{i}{n}\right)}^{n} + \left(1 \cdot 1 + {\left(1 + \frac{i}{n}\right)}^{n} \cdot 1\right)\right)}}\]

   5. Simplified 27.1

      \[\leadsto 100 \cdot \frac{{\left({\left(1 + \frac{i}{n}\right)}^{n}\right)}^{3} - {1}^{3}}{\color{blue}{\left(1 \cdot \left(1 + {\left(1 + \frac{i}{n}\right)}^{n}\right) + {\left(1 + \frac{i}{n}\right)}^{\left(2 \cdot n\right)}\right) \cdot \frac{i}{n}}}\]

   if -0.028332219067036327 < i < 0.0004011259599316577

   1. Initial program 58.5

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}\]

   2. Taylor expanded around 0 25.9

      \[\leadsto 100 \cdot \frac{\color{blue}{\left(1 \cdot i + \left(0.5 \cdot {i}^{2} + \log 1 \cdot n\right)\right) - 0.5 \cdot \left({i}^{2} \cdot \log 1\right)}}{\frac{i}{n}}\]
   3. Using strategy rm

   4. Applied associate-/r/ 9.0

      \[\leadsto 100 \cdot \color{blue}{\left(\frac{\left(1 \cdot i + \left(0.5 \cdot {i}^{2} + \log 1 \cdot n\right)\right) - 0.5 \cdot \left({i}^{2} \cdot \log 1\right)}{i} \cdot n\right)}\]

   5. Applied associate-*r* 9.0

      \[\leadsto \color{blue}{\left(100 \cdot \frac{\left(1 \cdot i + \left(0.5 \cdot {i}^{2} + \log 1 \cdot n\right)\right) - 0.5 \cdot \left({i}^{2} \cdot \log 1\right)}{i}\right) \cdot n}\]

   if 0.0004011259599316577 < i

   1. Initial program 30.4

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}\]
   2. Using strategy rm

   3. Applied associate-/r/ 30.4

      \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{i} \cdot n\right)}\]

   4. Applied associate-*r* 30.4

      \[\leadsto \color{blue}{\left(100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{i}\right) \cdot n}\]
3. Recombined 3 regimes into one program.

4. Final simplification 16.0

   \[\leadsto \begin{array}{l} \mathbf{if}\;i \le -0.028332219067036327:\\ \;\;\;\;100 \cdot \frac{{\left({\left(1 + \frac{i}{n}\right)}^{n}\right)}^{3} - {1}^{3}}{\left(1 \cdot \left(1 + {\left(1 + \frac{i}{n}\right)}^{n}\right) + {\left(1 + \frac{i}{n}\right)}^{\left(2 \cdot n\right)}\right) \cdot \frac{i}{n}}\\ \mathbf{elif}\;i \le 4.0112595993165771 \cdot 10^{-4}:\\ \;\;\;\;\left(100 \cdot \frac{\left(1 \cdot i + \left(0.5 \cdot {i}^{2} + \log 1 \cdot n\right)\right) - 0.5 \cdot \left({i}^{2} \cdot \log 1\right)}{i}\right) \cdot n\\ \mathbf{else}:\\ \;\;\;\;\left(100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{i}\right) \cdot n\\ \end{array}\]

Reproduce

herbie shell --seed 2020131 
(FPCore (i n)
  :name "Compound Interest"
  :precision binary64

  :herbie-target
  (* 100.0 (/ (- (exp (* n (if (== (+ 1.0 (/ i n)) 1.0) (/ i n) (/ (* (/ i n) (log (+ 1.0 (/ i n)))) (- (+ (/ i n) 1.0) 1.0))))) 1.0) (/ i n)))

  (* 100.0 (/ (- (pow (+ 1.0 (/ i n)) n) 1.0) (/ i n))))