Error

Derivation

1. Split input into 2 regimes

2. if N < 8165.724924927464

   1. Initial program 0.1

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

   2. Initial simplification0.1

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

   4. Applied log1p-udef0.1

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

   5. Applied diff-log0.1

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

   6. Taylor expanded around inf 0.1

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

   if 8165.724924927464 < N

   1. Initial program 59.6

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

   2. Initial simplification59.6

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

   4. Applied log1p-udef59.6

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

   5. Applied diff-log59.4

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

   6. Taylor expanded around inf 59.4

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

   7. Taylor expanded around inf 0.0

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

   8. Simplified0.0

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

4. Final simplification0.0

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

Reproduce

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

Details

Time bar (total: 4.4s)Debug log