Average Error: 48.0 → 17.2
Time: 13.0s
Precision: binary64
\[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}\]
↓
\[\begin{array}{l} \mathbf{if}\;i \le -1.10896230119024275:\\ \;\;\;\;100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\frac{i}{n}}\right)\\ \mathbf{elif}\;i \le 4.75133035666039973 \cdot 10^{-15}:\\ \;\;\;\;100 \cdot \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)\\ \mathbf{elif}\;i \le 1.55046554716659385 \cdot 10^{160}:\\ \;\;\;\;\left(100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot \frac{1}{\frac{i}{n}}\\ \mathbf{elif}\;i \le 3.6778071700114373 \cdot 10^{224}:\\ \;\;\;\;100 \cdot \frac{\left(1 \cdot i + \left(\log 1 \cdot n + 1\right)\right) - 1}{\frac{i}{n}}\\ \mathbf{else}:\\ \;\;\;\;\frac{100}{i} \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{1}{n}}\\ \end{array}\]
100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}
↓
\begin{array}{l}
\mathbf{if}\;i \le -1.10896230119024275:\\
\;\;\;\;100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\frac{i}{n}}\right)\\

\mathbf{elif}\;i \le 4.75133035666039973 \cdot 10^{-15}:\\
\;\;\;\;100 \cdot \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)\\

\mathbf{elif}\;i \le 1.55046554716659385 \cdot 10^{160}:\\
\;\;\;\;\left(100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot \frac{1}{\frac{i}{n}}\\

\mathbf{elif}\;i \le 3.6778071700114373 \cdot 10^{224}:\\
\;\;\;\;100 \cdot \frac{\left(1 \cdot i + \left(\log 1 \cdot n + 1\right)\right) - 1}{\frac{i}{n}}\\

\mathbf{else}:\\
\;\;\;\;\frac{100}{i} \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{1}{n}}\\

\end{array}
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 <= -1.1089623011902427)) {
		VAR = ((double) (100.0 * ((double) (((double) (((double) pow(((double) (1.0 + ((double) (i / n)))), n)) / ((double) (i / n)))) - ((double) (1.0 / ((double) (i / n))))))));
	} else {
		double VAR_1;
		if ((i <= 4.7513303566604e-15)) {
			VAR_1 = ((double) (100.0 * ((double) (((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 {
			double VAR_2;
			if ((i <= 1.550465547166594e+160)) {
				VAR_2 = ((double) (((double) (100.0 * ((double) (((double) pow(((double) (1.0 + ((double) (i / n)))), n)) - 1.0)))) * ((double) (1.0 / ((double) (i / n))))));
			} else {
				double VAR_3;
				if ((i <= 3.6778071700114373e+224)) {
					VAR_3 = ((double) (100.0 * ((double) (((double) (((double) (((double) (1.0 * i)) + ((double) (((double) (((double) log(1.0)) * n)) + 1.0)))) - 1.0)) / ((double) (i / n))))));
				} else {
					VAR_3 = ((double) (((double) (100.0 / i)) * ((double) (((double) (((double) pow(((double) (1.0 + ((double) (i / n)))), n)) - 1.0)) / ((double) (1.0 / n))))));
				}
				VAR_2 = VAR_3;
			}
			VAR_1 = VAR_2;
		}
		VAR = VAR_1;
	}
	return VAR;
}

Error

Bits error versus i

Bits error versus n

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original48.0
Target47.8
Herbie17.2
\[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 5 regimes

  2. if i < -1.10896230119024275

    1. Initial program 28.4

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

    3. Applied div-sub28.4

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

    if -1.10896230119024275 < i < 4.75133035666039973e-15

    1. Initial program 58.1

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

    2. Taylor expanded around 0 26.6

      \[\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.4

      \[\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)}\]

    if 4.75133035666039973e-15 < i < 1.55046554716659385e160

    1. Initial program 35.6

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

    3. Applied div-inv35.6

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

    4. Applied associate-*r*35.6

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

    if 1.55046554716659385e160 < i < 3.6778071700114373e224

    1. Initial program 35.2

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

    2. Taylor expanded around 0 34.5

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

    if 3.6778071700114373e224 < i

    1. Initial program 31.1

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

    3. Applied div-inv31.2

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

    4. Applied *-un-lft-identity31.2

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

    5. Applied times-frac31.2

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

    6. Applied associate-*r*31.2

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

    7. Simplified31.1

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

  4. Final simplification17.2

    \[\leadsto \begin{array}{l} \mathbf{if}\;i \le -1.10896230119024275:\\ \;\;\;\;100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\frac{i}{n}}\right)\\ \mathbf{elif}\;i \le 4.75133035666039973 \cdot 10^{-15}:\\ \;\;\;\;100 \cdot \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)\\ \mathbf{elif}\;i \le 1.55046554716659385 \cdot 10^{160}:\\ \;\;\;\;\left(100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot \frac{1}{\frac{i}{n}}\\ \mathbf{elif}\;i \le 3.6778071700114373 \cdot 10^{224}:\\ \;\;\;\;100 \cdot \frac{\left(1 \cdot i + \left(\log 1 \cdot n + 1\right)\right) - 1}{\frac{i}{n}}\\ \mathbf{else}:\\ \;\;\;\;\frac{100}{i} \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{1}{n}}\\ \end{array}\]

Reproduce

herbie shell --seed 2020152 
(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))))