Average Error: 29.3 → 0.0
Time: 24.0s
Precision: 64
Internal Precision: 1344
\[\log \left(N + 1\right) - \log N\]
↓
\[\log_* (1 + \frac{1}{N})\]

Error

Bits error versus N

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 29.3

    \[\log \left(N + 1\right) - \log N\]
  2. Using strategy rm

  3. Applied diff-log29.2

    \[\leadsto \color{blue}{\log \left(\frac{N + 1}{N}\right)}\]

  4. Taylor expanded around 0 29.2

    \[\leadsto \log \color{blue}{\left(1 + \frac{1}{N}\right)}\]

  5. Applied simplify0.0

    \[\leadsto \color{blue}{\log_* (1 + \frac{1}{N})}\]

Runtime

Time bar (total: 24.0s)Debug logProfile

herbie shell --seed '#(1072936661 1621281212 3440817831 3219514234 460296804 1258167384)' +o rules:numerics
(FPCore (N)
  :name "2log (problem 3.3.6)"
  (- (log (+ N 1)) (log N)))