Average Error: 29.5 → 0.2
Time: 34.6s
Precision: 64
Ground Truth: 128
\[\log \left(N + 1\right) - \log N\]
⬇
\[\begin{array}{l}
\mathbf{if}\;N \le 1438490.0801097094:\\
\;\;\;\;\frac{{\left(\log \left(N + 1\right)\right)}^3 - {\left(\log N\right)}^3}{{\left(\log \left(N + 1\right)\right)}^2 + \left({\left(\log N\right)}^2 + \log \left(N + 1\right) \cdot \log N\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{3}}{N} - \frac{1}{2}}{{N}^2} + \frac{1}{N}\\
\end{array}\]
Derivation
- Split input into 2 regimes.
-
if N < 1438490.0801097094
Initial program 0.2
\[\log \left(N + 1\right) - \log N\]
- Using strategy
rm
Applied flip3-- 0.5
\[\leadsto \color{blue}{\frac{{\left(\log \left(N + 1\right)\right)}^{3} - {\left(\log N\right)}^{3}}{{\left(\log \left(N + 1\right)\right)}^2 + \left({\left(\log N\right)}^2 + \log \left(N + 1\right) \cdot \log N\right)}}\]
Applied simplify 0.3
\[\leadsto \frac{\color{blue}{{\left(\log \left(N + 1\right)\right)}^3 - {\left(\log N\right)}^3}}{{\left(\log \left(N + 1\right)\right)}^2 + \left({\left(\log N\right)}^2 + \log \left(N + 1\right) \cdot \log N\right)}\]
if 1438490.0801097094 < N
Initial program 59.8
\[\log \left(N + 1\right) - \log N\]
Applied taylor 0.0
\[\leadsto \left(\frac{1}{3} \cdot \frac{1}{{N}^{3}} + \frac{1}{N}\right) - \frac{1}{2} \cdot \frac{1}{{N}^2}\]
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}}\]
Applied simplify 0.0
\[\leadsto \color{blue}{\frac{\frac{1}{N}}{N} \cdot \left(\frac{\frac{1}{3}}{N} - \frac{1}{2}\right) + \frac{1}{N}}\]
Applied simplify 0.0
\[\leadsto \color{blue}{\frac{\frac{\frac{1}{3}}{N} - \frac{1}{2}}{{N}^2}} + \frac{1}{N}\]
- Recombined 2 regimes into one program.
- Removed slow pow expressions
Runtime
Please include this information when filing a bug report:
herbie --seed '#(2915042545 3591512314 4229004281 3744598893 166345636 3506032321)'
(FPCore (N)
:name "NMSE problem 3.3.6"
(- (log (+ N 1)) (log N)))