Average Error: 29.6 → 0.0
Time: 25.2s
Precision: 64
Internal Precision: 1600
\[\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.6

    \[\log \left(N + 1\right) - \log N\]

  2. Applied simplify29.6

    \[\leadsto \color{blue}{\log_* (1 + N) - \log N}\]
  3. Using strategy rm

  4. Applied log1p-udef29.6

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

  5. Applied diff-log29.5

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

  6. Taylor expanded around 0 29.5

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

  7. Applied simplify0.0

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

Runtime

Time bar (total: 25.2s)Debug logProfile

herbie shell --seed 2018214 +o rules:numerics
(FPCore (N)
  :name "2log (problem 3.3.6)"
  (- (log (+ N 1)) (log N)))