Average Error: 47.6 → 16.5
Time: 14.8s
Precision: binary64
\[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}\]
\[\begin{array}{l} \mathbf{if}\;i \le -1.3412065908225887 \cdot 10^{-10} \lor \neg \left(i \le 0.187331341053011829\right):\\ \;\;\;\;100 \cdot \frac{\frac{{\left(1 + \frac{i}{n}\right)}^{\left(2 \cdot n\right)} + \left(-1 \cdot 1\right)}{{\left(1 + \frac{i}{n}\right)}^{n} + 1}}{\frac{i}{n}}\\ \mathbf{else}:\\ \;\;\;\;100 \cdot \left(\left(\left(0.5 \cdot i + \left(\frac{\log 1 \cdot n}{i} + 1\right)\right) - 0.5 \cdot \left(i \cdot \log 1\right)\right) \cdot n\right)\\ \end{array}\]

Error

Bits error versus i

Bits error versus n

Target

Original47.6
Target47.6
Herbie16.5
\[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 2 regimes
  2. if i < -1.3412065908225887e-10 or 0.187331341053011829 < i

    1. Initial program 29.5

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

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

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

    if -1.3412065908225887e-10 < i < 0.187331341053011829

    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.5

      \[\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/8.7

      \[\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. Taylor expanded around 0 8.7

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

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

    \[\leadsto \begin{array}{l} \mathbf{if}\;i \le -1.3412065908225887 \cdot 10^{-10} \lor \neg \left(i \le 0.187331341053011829\right):\\ \;\;\;\;100 \cdot \frac{\frac{{\left(1 + \frac{i}{n}\right)}^{\left(2 \cdot n\right)} + \left(-1 \cdot 1\right)}{{\left(1 + \frac{i}{n}\right)}^{n} + 1}}{\frac{i}{n}}\\ \mathbf{else}:\\ \;\;\;\;100 \cdot \left(\left(\left(0.5 \cdot i + \left(\frac{\log 1 \cdot n}{i} + 1\right)\right) - 0.5 \cdot \left(i \cdot \log 1\right)\right) \cdot n\right)\\ \end{array}\]

Reproduce

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