Average Error: 42.4 → 30.2
Time: 3.5m
Precision: 64
Internal Precision: 128
\[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}\]
\[\begin{array}{l} \mathbf{if}\;n \le -6.15239565177811 \cdot 10^{+40}:\\ \;\;\;\;100 \cdot \frac{\left(\frac{1}{6} \cdot i + \frac{1}{2}\right) \cdot \left(i \cdot i\right) + i}{\frac{i}{n}}\\ \mathbf{elif}\;n \le -240361969150.9007:\\ \;\;\;\;100 \cdot \left(\frac{n}{i} \cdot \left({\left(\frac{1}{\frac{n}{i}}\right)}^{n} - 1\right)\right)\\ \mathbf{elif}\;n \le -1.9906372068903042:\\ \;\;\;\;100 \cdot \frac{\left(\frac{1}{6} \cdot i + \frac{1}{2}\right) \cdot \left(i \cdot i\right) + i}{\frac{i}{n}}\\ \mathbf{elif}\;n \le 1.566547185340197 \cdot 10^{-126}:\\ \;\;\;\;0\\ \mathbf{elif}\;n \le 1.302728670222634 \cdot 10^{+231}:\\ \;\;\;\;100 \cdot \frac{\left(\frac{1}{6} \cdot i + \frac{1}{2}\right) \cdot \left(i \cdot i\right) + i}{\frac{i}{n}}\\ \mathbf{else}:\\ \;\;\;\;100 \cdot \left(\frac{n}{i} \cdot \left({\left(\frac{1}{\frac{n}{i}}\right)}^{n} - 1\right)\right)\\ \end{array}\]

Error

Bits error versus i

Bits error versus n

Target

Original42.4
Target42.0
Herbie30.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 3 regimes
  2. if n < -6.15239565177811e+40 or -240361969150.9007 < n < -1.9906372068903042 or 1.566547185340197e-126 < n < 1.302728670222634e+231

    1. Initial program 52.5

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}\]
    2. Taylor expanded around 0 36.1

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

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

    if -6.15239565177811e+40 < n < -240361969150.9007 or 1.302728670222634e+231 < n

    1. Initial program 50.8

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}\]
    2. Taylor expanded around inf 61.9

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

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

    if -1.9906372068903042 < n < 1.566547185340197e-126

    1. Initial program 24.8

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}\]
    2. Taylor expanded around 0 18.8

      \[\leadsto \color{blue}{0}\]
  3. Recombined 3 regimes into one program.
  4. Final simplification30.2

    \[\leadsto \begin{array}{l} \mathbf{if}\;n \le -6.15239565177811 \cdot 10^{+40}:\\ \;\;\;\;100 \cdot \frac{\left(\frac{1}{6} \cdot i + \frac{1}{2}\right) \cdot \left(i \cdot i\right) + i}{\frac{i}{n}}\\ \mathbf{elif}\;n \le -240361969150.9007:\\ \;\;\;\;100 \cdot \left(\frac{n}{i} \cdot \left({\left(\frac{1}{\frac{n}{i}}\right)}^{n} - 1\right)\right)\\ \mathbf{elif}\;n \le -1.9906372068903042:\\ \;\;\;\;100 \cdot \frac{\left(\frac{1}{6} \cdot i + \frac{1}{2}\right) \cdot \left(i \cdot i\right) + i}{\frac{i}{n}}\\ \mathbf{elif}\;n \le 1.566547185340197 \cdot 10^{-126}:\\ \;\;\;\;0\\ \mathbf{elif}\;n \le 1.302728670222634 \cdot 10^{+231}:\\ \;\;\;\;100 \cdot \frac{\left(\frac{1}{6} \cdot i + \frac{1}{2}\right) \cdot \left(i \cdot i\right) + i}{\frac{i}{n}}\\ \mathbf{else}:\\ \;\;\;\;100 \cdot \left(\frac{n}{i} \cdot \left({\left(\frac{1}{\frac{n}{i}}\right)}^{n} - 1\right)\right)\\ \end{array}\]

Reproduce

herbie shell --seed 2019094 
(FPCore (i n)
  :name "Compound Interest"

  :herbie-target
  (* 100 (/ (- (exp (* n (if (== (+ 1 (/ i n)) 1) (/ i n) (/ (* (/ i n) (log (+ 1 (/ i n)))) (- (+ (/ i n) 1) 1))))) 1) (/ i n)))

  (* 100 (/ (- (pow (+ 1 (/ i n)) n) 1) (/ i n))))