Average Error: 63.0 → 0
Time: 9.9s
Precision: 64
Internal Precision: 1344
\[\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. Initial simplification62.0

    \[\leadsto (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}\]

Runtime

Time bar (total: 9.9s)Debug logProfile

BaselineHerbieOracleSpan%
Regimes0000100%
herbie shell --seed 2018274 +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))