Average Error: 29.8 → 0.1
Time: 18.4s
Precision: 64
Internal Precision: 128
\[\log \left(N + 1\right) - \log N\]
\[\begin{array}{l} \mathbf{if}\;N \le 4923.879148057995:\\ \;\;\;\;\log \left(1 + N\right) - \log N\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{N} - \left(\frac{1}{2} - \frac{\frac{1}{3}}{N}\right) \cdot \frac{1}{N \cdot N}\\ \end{array}\]

Error

Bits error versus N

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Split input into 2 regimes
  2. if N < 4923.879148057995

    1. Initial program 0.1

      \[\log \left(N + 1\right) - \log N\]
    2. Initial simplification0.1

      \[\leadsto \log \left(1 + N\right) - \log N\]
    3. Using strategy rm
    4. Applied diff-log0.1

      \[\leadsto \color{blue}{\log \left(\frac{1 + N}{N}\right)}\]
    5. Using strategy rm
    6. Applied log-div0.1

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

    if 4923.879148057995 < N

    1. Initial program 59.5

      \[\log \left(N + 1\right) - \log N\]
    2. Initial simplification59.5

      \[\leadsto \log \left(1 + N\right) - \log N\]
    3. Taylor expanded around inf 0.1

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

      \[\leadsto \color{blue}{\frac{1}{N} - \frac{1}{N \cdot N} \cdot \left(\frac{1}{2} - \frac{\frac{1}{3}}{N}\right)}\]
  3. Recombined 2 regimes into one program.
  4. Final simplification0.1

    \[\leadsto \begin{array}{l} \mathbf{if}\;N \le 4923.879148057995:\\ \;\;\;\;\log \left(1 + N\right) - \log N\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{N} - \left(\frac{1}{2} - \frac{\frac{1}{3}}{N}\right) \cdot \frac{1}{N \cdot N}\\ \end{array}\]

Runtime

Time bar (total: 18.4s)Debug logProfile

BaselineHerbieOracleSpan%
Regimes30.60.10.030.599.9%
herbie shell --seed 2018353 
(FPCore (N)
  :name "2log (problem 3.3.6)"
  (- (log (+ N 1)) (log N)))