Average Error: 42.5 → 19.0
Time: 32.4s
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 -1.748423254290977 \cdot 10^{-07}:\\ \;\;\;\;\frac{(e^{n \cdot \log_* (1 + \frac{i}{n})} - 1)^* \cdot 100}{\frac{i}{n}}\\ \mathbf{elif}\;n \le 1.2254101993335981 \cdot 10^{-216}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\frac{(e^{n \cdot \log_* (1 + \frac{i}{n})} - 1)^*}{\frac{i}{n}} \cdot 100\\ \end{array}\]

Error

Bits error versus i

Bits error versus n

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original42.5
Target42.2
Herbie19.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 n < -1.748423254290977e-07

    1. Initial program 43.6

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

      \[\leadsto 100 \cdot \frac{{\color{blue}{\left(e^{\log \left(1 + \frac{i}{n}\right)}\right)}}^{n} - 1}{\frac{i}{n}}\]
    4. Applied pow-exp51.8

      \[\leadsto 100 \cdot \frac{\color{blue}{e^{\log \left(1 + \frac{i}{n}\right) \cdot n}} - 1}{\frac{i}{n}}\]
    5. Applied expm1-def51.8

      \[\leadsto 100 \cdot \frac{\color{blue}{(e^{\log \left(1 + \frac{i}{n}\right) \cdot n} - 1)^*}}{\frac{i}{n}}\]
    6. Simplified25.8

      \[\leadsto 100 \cdot \frac{(e^{\color{blue}{n \cdot \log_* (1 + \frac{i}{n})}} - 1)^*}{\frac{i}{n}}\]
    7. Using strategy rm
    8. Applied associate-*r/25.8

      \[\leadsto \color{blue}{\frac{100 \cdot (e^{n \cdot \log_* (1 + \frac{i}{n})} - 1)^*}{\frac{i}{n}}}\]

    if -1.748423254290977e-07 < n < 1.2254101993335981e-216

    1. Initial program 20.9

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

      \[\leadsto \color{blue}{0}\]

    if 1.2254101993335981e-216 < n

    1. Initial program 57.2

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

      \[\leadsto 100 \cdot \frac{{\color{blue}{\left(e^{\log \left(1 + \frac{i}{n}\right)}\right)}}^{n} - 1}{\frac{i}{n}}\]
    4. Applied pow-exp57.2

      \[\leadsto 100 \cdot \frac{\color{blue}{e^{\log \left(1 + \frac{i}{n}\right) \cdot n}} - 1}{\frac{i}{n}}\]
    5. Applied expm1-def50.3

      \[\leadsto 100 \cdot \frac{\color{blue}{(e^{\log \left(1 + \frac{i}{n}\right) \cdot n} - 1)^*}}{\frac{i}{n}}\]
    6. Simplified15.5

      \[\leadsto 100 \cdot \frac{(e^{\color{blue}{n \cdot \log_* (1 + \frac{i}{n})}} - 1)^*}{\frac{i}{n}}\]
  3. Recombined 3 regimes into one program.
  4. Final simplification19.0

    \[\leadsto \begin{array}{l} \mathbf{if}\;n \le -1.748423254290977 \cdot 10^{-07}:\\ \;\;\;\;\frac{(e^{n \cdot \log_* (1 + \frac{i}{n})} - 1)^* \cdot 100}{\frac{i}{n}}\\ \mathbf{elif}\;n \le 1.2254101993335981 \cdot 10^{-216}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\frac{(e^{n \cdot \log_* (1 + \frac{i}{n})} - 1)^*}{\frac{i}{n}} \cdot 100\\ \end{array}\]

Runtime

Time bar (total: 32.4s)Debug logProfile

BaselineHerbieOracleSpan%
Regimes20.119.09.710.510.3%
herbie shell --seed 2018355 +o rules:numerics
(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))))