Average Error: 63.0 → 0
Time: 12.7s
Precision: 64
Internal Precision: 128
\[\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1\]
\[\left(\log n + \frac{\frac{1}{2}}{n}\right) - \frac{\frac{1}{6}}{n \cdot n}\]

Error

Bits error versus n

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original63.0
Target0
Herbie0
\[\log \left(n + 1\right) - \left(\frac{1}{2 \cdot n} - \left(\frac{1}{3 \cdot \left(n \cdot n\right)} - \frac{4}{{n}^{3}}\right)\right)\]

Derivation

  1. Initial program 63.0

    \[\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1\]
  2. Simplified62.0

    \[\leadsto \color{blue}{(n \cdot \left(\log_* (1 + n)\right) + \left(\log_* (1 + n)\right))_* - (n \cdot \left(\log n\right) + 1)_*}\]
  3. Taylor expanded around -inf 62.0

    \[\leadsto \color{blue}{\left(\log -1 + \frac{1}{2} \cdot \frac{1}{n}\right) - \left(\frac{1}{6} \cdot \frac{1}{{n}^{2}} + \log \left(\frac{-1}{n}\right)\right)}\]
  4. Simplified0

    \[\leadsto \color{blue}{\left(\frac{\frac{1}{2}}{n} + \log n\right) - \frac{\frac{1}{6}}{n \cdot n}}\]
  5. Final simplification0

    \[\leadsto \left(\log n + \frac{\frac{1}{2}}{n}\right) - \frac{\frac{1}{6}}{n \cdot n}\]

Reproduce

herbie shell --seed 2019010 +o rules:numerics
(FPCore (n)
  :name "logs (example 3.8)"
  :pre (> n 6.8e+15)

  :herbie-target
  (- (log (+ n 1)) (- (/ 1 (* 2 n)) (- (/ 1 (* 3 (* n n))) (/ 4 (pow n 3)))))

  (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1))

Details

Time bar (total: 12.4s)Debug log

sample116.0ms

Algorithm
intervals

simplify161.0ms

Counts
1 → 1
Calls
1 calls:
Slowest
161.0ms
(- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1)

prune10.0ms

Pruning

1 alts after pruning (1 fresh and 0 done)

Merged error: 62.0b

localize33.0ms

Local error

Found 3 expressions with local error:

4.6b
(- (fma n (log1p n) (log1p n)) (fma n (log n) 1))
0.3b
(fma n (log1p n) (log1p n))
0.3b
(fma n (log n) 1)

rewrite6.0ms

Algorithm
rewrite-expression-head
Rules
12×*-un-lft-identity
12×add-sqr-sqrt
10×add-cube-cbrt
prod-diff
add-log-exp
fma-udef
log1p-expm1-u
add-exp-log
fma-neg
add-cbrt-cube
pow1
expm1-log1p-u
difference-of-squares
distribute-lft-out--
associate--r+
flip--
associate--l+
diff-log
flip3--
sub-neg
Counts
3 → 50
Calls
3 calls:
Slowest
5.0ms
(- (fma n (log1p n) (log1p n)) (fma n (log n) 1))
0.0ms
(fma n (log1p n) (log1p n))
0.0ms
(fma n (log n) 1)

series483.0ms

Counts
3 → 9
Calls
3 calls:
Slowest
289.0ms
(fma n (log n) 1)
134.0ms
(- (fma n (log1p n) (log1p n)) (fma n (log n) 1))
59.0ms
(fma n (log1p n) (log1p n))

simplify5.0s

Counts
34 → 59
Calls
34 calls:
Slowest
686.0ms
(- (+ n (* 1/2 (pow n 2))) (+ (* n (log n)) 1))
577.0ms
(- (+ (* n (log -1)) (+ 1 (+ (log -1) (* 1/2 (/ 1 n))))) (+ (* n (log (/ -1 n))) (log (/ -1 n))))
440.0ms
(- (+ 1 (* 1/2 (/ 1 n))) (+ (* n (log (/ 1 n))) (log (/ 1 n))))
436.0ms
(- (+ (log -1) (* 1/2 (/ 1 n))) (+ (* 1/6 (/ 1 (pow n 2))) (log (/ -1 n))))
272.0ms
(- (* 1/2 (/ 1 n)) (+ (* 1/6 (/ 1 (pow n 2))) (log (/ 1 n))))

prune296.0ms

Pruning

1 alts after pruning (1 fresh and 0 done)

Merged error: 0b

localize27.0ms

Local error

Found 1 expressions with local error:

1.2b
(/ 1/6 (* n n))

rewrite1.0ms

Algorithm
rewrite-expression-head
Rules
add-log-exp
div-inv
log1p-expm1-u
add-cube-cbrt
add-exp-log
add-cbrt-cube
*-un-lft-identity
frac-2neg
associate-/r*
clear-num
pow1
expm1-log1p-u
add-sqr-sqrt
Counts
1 → 13
Calls
1 calls:
Slowest
1.0ms
(/ 1/6 (* n n))

series20.0ms

Counts
1 → 3
Calls
1 calls:
Slowest
20.0ms
(/ 1/6 (* n n))

simplify13.0ms

Counts
3 → 16
Calls
3 calls:
Slowest
6.0ms
(/ 1/6 (pow n 2))
3.0ms
(/ 1/6 (pow n 2))
3.0ms
(/ 1/6 (pow n 2))

prune114.0ms

Pruning

1 alts after pruning (0 fresh and 1 done)

Merged error: 0b

end0.0ms

sample6.1s

Algorithm
intervals