Average Error: 42.6 → 7.9
Time: 24.0s
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 -0.5048727192312397:\\ \;\;\;\;\frac{100 \cdot (e^{i} - 1)^*}{i} \cdot n\\ \mathbf{elif}\;n \le -1.4243394807001 \cdot 10^{-310}:\\ \;\;\;\;\frac{100 \cdot (e^{\sqrt[3]{\left(\log_* (1 + \frac{i}{n}) \cdot \log_* (1 + \frac{i}{n})\right) \cdot \log_* (1 + \frac{i}{n})} \cdot n} - 1)^*}{\frac{i}{n}}\\ \mathbf{elif}\;n \le 0.0021140823519030126:\\ \;\;\;\;n \cdot \frac{100}{\frac{i}{(e^{\log_* (1 + \frac{i}{n}) \cdot n} - 1)^*}}\\ \mathbf{else}:\\ \;\;\;\;\frac{100 \cdot (e^{i} - 1)^*}{i} \cdot n\\ \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.6
Target42.1
Herbie7.9
\[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 < -0.5048727192312397 or 0.0021140823519030126 < n

    1. Initial program 50.9

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

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

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

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

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

      \[\leadsto \color{blue}{\frac{100 \cdot (e^{\log_* (1 + \frac{i}{n}) \cdot n} - 1)^*}{i} \cdot n}\]
    10. Taylor expanded around 0 5.0

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

    if -0.5048727192312397 < n < -1.4243394807001e-310

    1. Initial program 16.5

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

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

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

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

      \[\leadsto \color{blue}{\frac{100 \cdot (e^{\log_* (1 + \frac{i}{n}) \cdot n} - 1)^*}{\frac{i}{n}}}\]
    8. Using strategy rm
    9. Applied add-cbrt-cube10.0

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

    if -1.4243394807001e-310 < n < 0.0021140823519030126

    1. Initial program 49.1

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

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

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

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

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

      \[\leadsto \color{blue}{\frac{100 \cdot (e^{\log_* (1 + \frac{i}{n}) \cdot n} - 1)^*}{i} \cdot n}\]
    10. Using strategy rm
    11. Applied associate-/l*12.8

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

    \[\leadsto \begin{array}{l} \mathbf{if}\;n \le -0.5048727192312397:\\ \;\;\;\;\frac{100 \cdot (e^{i} - 1)^*}{i} \cdot n\\ \mathbf{elif}\;n \le -1.4243394807001 \cdot 10^{-310}:\\ \;\;\;\;\frac{100 \cdot (e^{\sqrt[3]{\left(\log_* (1 + \frac{i}{n}) \cdot \log_* (1 + \frac{i}{n})\right) \cdot \log_* (1 + \frac{i}{n})} \cdot n} - 1)^*}{\frac{i}{n}}\\ \mathbf{elif}\;n \le 0.0021140823519030126:\\ \;\;\;\;n \cdot \frac{100}{\frac{i}{(e^{\log_* (1 + \frac{i}{n}) \cdot n} - 1)^*}}\\ \mathbf{else}:\\ \;\;\;\;\frac{100 \cdot (e^{i} - 1)^*}{i} \cdot n\\ \end{array}\]

Reproduce

herbie shell --seed 2019005 +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))))

Details

Time bar (total: 23.3s)Debug log

sample355.0ms

Algorithm
intervals

simplify332.0ms

Counts
1 → 1
Calls

1 calls. Slowest were:

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

prune6.0ms

Pruning

1 alts after pruning (1 fresh and 0 done)

Merged error: 40.4b

localize25.0ms

Local error

Found 4 expressions with local error:

10.9b
(/ (- (pow (+ 1 (/ i n)) n) 1) (/ i n))
4.9b
(pow (+ 1 (/ i n)) n)
2.2b
(- (pow (+ 1 (/ i n)) n) 1)
0.1b
(* 100 (/ (- (pow (+ 1 (/ i n)) n) 1) (/ i n)))

rewrite48.0ms

Algorithm
rewrite-expression-head
Counts
4 → 122
Calls

4 calls. Slowest were:

22.0ms
(/ (- (pow (+ 1 (/ i n)) n) 1) (/ i n))
12.0ms
(* 100 (/ (- (pow (+ 1 (/ i n)) n) 1) (/ i n)))
10.0ms
(- (pow (+ 1 (/ i n)) n) 1)

series735.0ms

Counts
4 → 12
Calls

4 calls. Slowest were:

228.0ms
(* 100 (/ (- (pow (+ 1 (/ i n)) n) 1) (/ i n)))
211.0ms
(/ (- (pow (+ 1 (/ i n)) n) 1) (/ i n))
160.0ms
(pow (+ 1 (/ i n)) n)
136.0ms
(- (pow (+ 1 (/ i n)) n) 1)

simplify4.1s

Counts
105 → 134
Calls

105 calls. Slowest were:

363.0ms
(/ (* (- (exp (* (- (log (/ 1 n)) (log (/ 1 i))) n)) 1) n) i)
316.0ms
(/ (* (* (- (pow (+ 1 (/ i n)) n) 1) (- (pow (+ 1 (/ i n)) n) 1)) (- (pow (+ 1 (/ i n)) n) 1)) (* (* (/ i n) (/ i n)) (/ i n)))
281.0ms
(* 100 (/ (* n (- (exp (* n (- (log (/ -1 n)) (log (/ -1 i))))) 1)) i))

prune1.3s

Pruning

7 alts after pruning (7 fresh and 0 done)

Merged error: 10.4b

localize20.0ms

Local error

Found 4 expressions with local error:

10.9b
(* (log1p (/ i n)) n)
10.7b
(/ (expm1 (* (log1p (/ i n)) n)) (/ i n))
4.4b
(log1p (/ i n))
0.2b
(* 100 (/ (expm1 (* (log1p (/ i n)) n)) (/ i n)))

rewrite18.0ms

Algorithm
rewrite-expression-head
Counts
4 → 87
Calls

4 calls. Slowest were:

7.0ms
(/ (expm1 (* (log1p (/ i n)) n)) (/ i n))
5.0ms
(* (log1p (/ i n)) n)
3.0ms
(* 100 (/ (expm1 (* (log1p (/ i n)) n)) (/ i n)))

series629.0ms

Counts
4 → 12
Calls

4 calls. Slowest were:

284.0ms
(* 100 (/ (expm1 (* (log1p (/ i n)) n)) (/ i n)))
227.0ms
(/ (expm1 (* (log1p (/ i n)) n)) (/ i n))
69.0ms
(* (log1p (/ i n)) n)
48.0ms
(log1p (/ i n))

simplify1.7s

Counts
65 → 99
Calls

65 calls. Slowest were:

325.0ms
(/ (* (- (exp (* (- (log (/ 1 n)) (log (/ 1 i))) n)) 1) n) i)
297.0ms
(* 100 (/ (* n (- (exp (* n (- (log (/ -1 n)) (log (/ -1 i))))) 1)) i))
229.0ms
(/ (* (* (expm1 (* (log1p (/ i n)) n)) (expm1 (* (log1p (/ i n)) n))) (expm1 (* (log1p (/ i n)) n))) (* (* (/ i n) (/ i n)) (/ i n)))

prune1.0s

Pruning

11 alts after pruning (10 fresh and 1 done)

Merged error: 10.2b

localize8.0ms

Local error

Found 4 expressions with local error:

10.9b
(* (log1p (/ i n)) n)
10.8b
(/ (* 100 (expm1 (* (log1p (/ i n)) n))) (/ i n))
4.4b
(log1p (/ i n))
0.1b
(* 100 (expm1 (* (log1p (/ i n)) n)))

rewrite15.0ms

Algorithm
rewrite-expression-head
Counts
4 → 61
Calls

4 calls. Slowest were:

7.0ms
(/ (* 100 (expm1 (* (log1p (/ i n)) n))) (/ i n))
4.0ms
(* (log1p (/ i n)) n)
2.0ms
(* 100 (expm1 (* (log1p (/ i n)) n)))

series541.0ms

Counts
4 → 12
Calls

4 calls. Slowest were:

238.0ms
(/ (* 100 (expm1 (* (log1p (/ i n)) n))) (/ i n))
147.0ms
(* 100 (expm1 (* (log1p (/ i n)) n)))
93.0ms
(* (log1p (/ i n)) n)
63.0ms
(log1p (/ i n))

simplify1.2s

Counts
32 → 73
Calls

32 calls. Slowest were:

219.0ms
(* 100 (/ (* n (- (exp (* n (- (log (/ -1 n)) (log (/ -1 i))))) 1)) i))
172.0ms
(* 100 (/ (* (- (exp (* (- (log (/ 1 n)) (log (/ 1 i))) n)) 1) n) i))
168.0ms
(* 100 (- (exp (* (- (log (/ 1 n)) (log (/ 1 i))) n)) 1))

prune633.0ms

Pruning

11 alts after pruning (10 fresh and 1 done)

Merged error: 10.2b

localize12.0ms

Local error

Found 4 expressions with local error:

10.9b
(* (log1p (/ i n)) n)
4.4b
(log1p (/ i n))
0.1b
(/ (* 100 (expm1 (* (log1p (/ i n)) n))) i)
0.1b
(* 100 (expm1 (* (log1p (/ i n)) n)))

rewrite15.0ms

Algorithm
rewrite-expression-head
Counts
4 → 50
Calls

4 calls. Slowest were:

7.0ms
(/ (* 100 (expm1 (* (log1p (/ i n)) n))) i)
5.0ms
(* (log1p (/ i n)) n)
2.0ms
(* 100 (expm1 (* (log1p (/ i n)) n)))

series344.0ms

Counts
4 → 12
Calls

4 calls. Slowest were:

137.0ms
(* 100 (expm1 (* (log1p (/ i n)) n)))
91.0ms
(/ (* 100 (expm1 (* (log1p (/ i n)) n))) i)
66.0ms
(* (log1p (/ i n)) n)
49.0ms
(log1p (/ i n))

simplify1.1s

Counts
18 → 62
Calls

18 calls. Slowest were:

317.0ms
(* -1 (/ (- 100 (* 100 (exp (* n (- (log (/ -1 n)) (log (/ -1 i))))))) i))
248.0ms
(/ (- (* 100 (exp (* (- (log (/ 1 n)) (log (/ 1 i))) n))) 100) i)
194.0ms
(+ (* 100 i) (+ (* 50 (pow i 2)) (* 50/3 (pow i 3))))

prune518.0ms

Pruning

11 alts after pruning (10 fresh and 1 done)

Merged error: 0.0b

regimes147.0ms

Accuracy

60.9% (7.8b remaining)

Error of 7.9b against oracle of 0.0b and baseline of 20.1b

bsearch453.0ms

end0.0ms

sample7.9s

Algorithm
intervals