2log (problem 3.3.6)

Percentage Accurate: 23.7% → 99.8%
Time: 8.8s
Alternatives: 6
Speedup: 68.3×

Specification

?
\[N > 1 \land N < 10^{+40}\]
\[\begin{array}{l} \\ \log \left(N + 1\right) - \log N \end{array} \]
(FPCore (N) :precision binary64 (- (log (+ N 1.0)) (log N)))
double code(double N) {
	return log((N + 1.0)) - log(N);
}
real(8) function code(n)
    real(8), intent (in) :: n
    code = log((n + 1.0d0)) - log(n)
end function
public static double code(double N) {
	return Math.log((N + 1.0)) - Math.log(N);
}
def code(N):
	return math.log((N + 1.0)) - math.log(N)
function code(N)
	return Float64(log(Float64(N + 1.0)) - log(N))
end
function tmp = code(N)
	tmp = log((N + 1.0)) - log(N);
end
code[N_] := N[(N[Log[N[(N + 1.0), $MachinePrecision]], $MachinePrecision] - N[Log[N], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\log \left(N + 1\right) - \log N
\end{array}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 6 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 23.7% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \log \left(N + 1\right) - \log N \end{array} \]
(FPCore (N) :precision binary64 (- (log (+ N 1.0)) (log N)))
double code(double N) {
	return log((N + 1.0)) - log(N);
}
real(8) function code(n)
    real(8), intent (in) :: n
    code = log((n + 1.0d0)) - log(n)
end function
public static double code(double N) {
	return Math.log((N + 1.0)) - Math.log(N);
}
def code(N):
	return math.log((N + 1.0)) - math.log(N)
function code(N)
	return Float64(log(Float64(N + 1.0)) - log(N))
end
function tmp = code(N)
	tmp = log((N + 1.0)) - log(N);
end
code[N_] := N[(N[Log[N[(N + 1.0), $MachinePrecision]], $MachinePrecision] - N[Log[N], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\log \left(N + 1\right) - \log N
\end{array}

Alternative 1: 99.8% accurate, 2.0× speedup?

\[\begin{array}{l} \\ \mathsf{log1p}\left(\frac{1}{N}\right) \end{array} \]
(FPCore (N) :precision binary64 (log1p (/ 1.0 N)))
double code(double N) {
	return log1p((1.0 / N));
}
public static double code(double N) {
	return Math.log1p((1.0 / N));
}
def code(N):
	return math.log1p((1.0 / N))
function code(N)
	return log1p(Float64(1.0 / N))
end
code[N_] := N[Log[1 + N[(1.0 / N), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}

\\
\mathsf{log1p}\left(\frac{1}{N}\right)
\end{array}
Derivation
  1. Initial program 23.1%

    \[\log \left(N + 1\right) - \log N \]
  2. Add Preprocessing
  3. Step-by-step derivation
    1. diff-logN/A

      \[\leadsto \log \left(\frac{N + 1}{N}\right) \]
    2. div-invN/A

      \[\leadsto \log \left(\left(N + 1\right) \cdot \frac{1}{N}\right) \]
    3. *-commutativeN/A

      \[\leadsto \log \left(\frac{1}{N} \cdot \left(N + 1\right)\right) \]
    4. distribute-lft-inN/A

      \[\leadsto \log \left(\frac{1}{N} \cdot N + \frac{1}{N} \cdot 1\right) \]
    5. lft-mult-inverseN/A

      \[\leadsto \log \left(1 + \frac{1}{N} \cdot 1\right) \]
    6. *-rgt-identityN/A

      \[\leadsto \log \left(1 + \frac{1}{N}\right) \]
    7. log1p-defineN/A

      \[\leadsto \mathsf{log1p}\left(\frac{1}{N}\right) \]
    8. log1p-lowering-log1p.f64N/A

      \[\leadsto \mathsf{log1p.f64}\left(\left(\frac{1}{N}\right)\right) \]
    9. /-lowering-/.f6499.8%

      \[\leadsto \mathsf{log1p.f64}\left(\mathsf{/.f64}\left(1, N\right)\right) \]
  4. Applied egg-rr99.8%

    \[\leadsto \color{blue}{\mathsf{log1p}\left(\frac{1}{N}\right)} \]
  5. Add Preprocessing

Alternative 2: 96.8% accurate, 15.8× speedup?

\[\begin{array}{l} \\ \frac{1}{\left(N + 0.5\right) + \frac{\frac{0.041666666666666664}{N} - 0.08333333333333333}{N}} \end{array} \]
(FPCore (N)
 :precision binary64
 (/
  1.0
  (+ (+ N 0.5) (/ (- (/ 0.041666666666666664 N) 0.08333333333333333) N))))
double code(double N) {
	return 1.0 / ((N + 0.5) + (((0.041666666666666664 / N) - 0.08333333333333333) / N));
}
real(8) function code(n)
    real(8), intent (in) :: n
    code = 1.0d0 / ((n + 0.5d0) + (((0.041666666666666664d0 / n) - 0.08333333333333333d0) / n))
end function
public static double code(double N) {
	return 1.0 / ((N + 0.5) + (((0.041666666666666664 / N) - 0.08333333333333333) / N));
}
def code(N):
	return 1.0 / ((N + 0.5) + (((0.041666666666666664 / N) - 0.08333333333333333) / N))
function code(N)
	return Float64(1.0 / Float64(Float64(N + 0.5) + Float64(Float64(Float64(0.041666666666666664 / N) - 0.08333333333333333) / N)))
end
function tmp = code(N)
	tmp = 1.0 / ((N + 0.5) + (((0.041666666666666664 / N) - 0.08333333333333333) / N));
end
code[N_] := N[(1.0 / N[(N[(N + 0.5), $MachinePrecision] + N[(N[(N[(0.041666666666666664 / N), $MachinePrecision] - 0.08333333333333333), $MachinePrecision] / N), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{1}{\left(N + 0.5\right) + \frac{\frac{0.041666666666666664}{N} - 0.08333333333333333}{N}}
\end{array}
Derivation
  1. Initial program 23.1%

    \[\log \left(N + 1\right) - \log N \]
  2. Add Preprocessing
  3. Taylor expanded in N around inf

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

    \[\leadsto \color{blue}{\frac{1 + \frac{-0.5 + \frac{0.3333333333333333 + \frac{-0.25}{N}}{N}}{N}}{N}} \]
  5. Step-by-step derivation
    1. clear-numN/A

      \[\leadsto \frac{1}{\color{blue}{\frac{N}{1 + \frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{N}}}} \]
    2. /-lowering-/.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(\frac{N}{1 + \frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{N}}\right)}\right) \]
    3. /-lowering-/.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \color{blue}{\left(1 + \frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{N}\right)}\right)\right) \]
    4. frac-2negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \left(1 + \frac{\mathsf{neg}\left(\left(\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}\right)\right)}{\color{blue}{\mathsf{neg}\left(N\right)}}\right)\right)\right) \]
    5. distribute-frac-negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \left(1 + \left(\mathsf{neg}\left(\frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{\mathsf{neg}\left(N\right)}\right)\right)\right)\right)\right) \]
    6. unsub-negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \left(1 - \color{blue}{\frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{\mathsf{neg}\left(N\right)}}\right)\right)\right) \]
    7. --lowering--.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \mathsf{\_.f64}\left(1, \color{blue}{\left(\frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{\mathsf{neg}\left(N\right)}\right)}\right)\right)\right) \]
    8. frac-2negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \mathsf{\_.f64}\left(1, \left(\frac{\mathsf{neg}\left(\left(\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}\right)\right)}{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(N\right)\right)\right)}}\right)\right)\right)\right) \]
    9. remove-double-negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \mathsf{\_.f64}\left(1, \left(\frac{\mathsf{neg}\left(\left(\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}\right)\right)}{N}\right)\right)\right)\right) \]
    10. /-lowering-/.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \mathsf{\_.f64}\left(1, \mathsf{/.f64}\left(\left(\mathsf{neg}\left(\left(\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}\right)\right)\right), \color{blue}{N}\right)\right)\right)\right) \]
  6. Applied egg-rr96.9%

    \[\leadsto \color{blue}{\frac{1}{\frac{N}{1 - \frac{0.5 + \frac{-0.3333333333333333 + \frac{0.25}{N}}{N}}{N}}}} \]
  7. Taylor expanded in N around inf

    \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(N \cdot \left(\left(1 + \left(\frac{1}{2} \cdot \frac{1}{N} + \frac{1}{24} \cdot \frac{1}{{N}^{3}}\right)\right) - \frac{\frac{1}{12}}{{N}^{2}}\right)\right)}\right) \]
  8. Step-by-step derivation
    1. associate--l+N/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(N \cdot \left(1 + \color{blue}{\left(\left(\frac{1}{2} \cdot \frac{1}{N} + \frac{1}{24} \cdot \frac{1}{{N}^{3}}\right) - \frac{\frac{1}{12}}{{N}^{2}}\right)}\right)\right)\right) \]
    2. distribute-rgt-inN/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(1 \cdot N + \color{blue}{\left(\left(\frac{1}{2} \cdot \frac{1}{N} + \frac{1}{24} \cdot \frac{1}{{N}^{3}}\right) - \frac{\frac{1}{12}}{{N}^{2}}\right) \cdot N}\right)\right) \]
    3. *-lft-identityN/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(N + \color{blue}{\left(\left(\frac{1}{2} \cdot \frac{1}{N} + \frac{1}{24} \cdot \frac{1}{{N}^{3}}\right) - \frac{\frac{1}{12}}{{N}^{2}}\right)} \cdot N\right)\right) \]
    4. +-lowering-+.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(N, \color{blue}{\left(\left(\left(\frac{1}{2} \cdot \frac{1}{N} + \frac{1}{24} \cdot \frac{1}{{N}^{3}}\right) - \frac{\frac{1}{12}}{{N}^{2}}\right) \cdot N\right)}\right)\right) \]
    5. *-commutativeN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(N, \left(N \cdot \color{blue}{\left(\left(\frac{1}{2} \cdot \frac{1}{N} + \frac{1}{24} \cdot \frac{1}{{N}^{3}}\right) - \frac{\frac{1}{12}}{{N}^{2}}\right)}\right)\right)\right) \]
    6. associate--l+N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(N, \left(N \cdot \left(\frac{1}{2} \cdot \frac{1}{N} + \color{blue}{\left(\frac{1}{24} \cdot \frac{1}{{N}^{3}} - \frac{\frac{1}{12}}{{N}^{2}}\right)}\right)\right)\right)\right) \]
    7. distribute-lft-inN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(N, \left(N \cdot \left(\frac{1}{2} \cdot \frac{1}{N}\right) + \color{blue}{N \cdot \left(\frac{1}{24} \cdot \frac{1}{{N}^{3}} - \frac{\frac{1}{12}}{{N}^{2}}\right)}\right)\right)\right) \]
    8. *-commutativeN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(N, \left(N \cdot \left(\frac{1}{N} \cdot \frac{1}{2}\right) + N \cdot \left(\frac{1}{24} \cdot \frac{1}{{N}^{3}} - \frac{\frac{1}{12}}{{N}^{2}}\right)\right)\right)\right) \]
    9. associate-*r*N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(N, \left(\left(N \cdot \frac{1}{N}\right) \cdot \frac{1}{2} + \color{blue}{N} \cdot \left(\frac{1}{24} \cdot \frac{1}{{N}^{3}} - \frac{\frac{1}{12}}{{N}^{2}}\right)\right)\right)\right) \]
    10. rgt-mult-inverseN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(N, \left(1 \cdot \frac{1}{2} + N \cdot \left(\frac{1}{24} \cdot \frac{1}{{N}^{3}} - \frac{\frac{1}{12}}{{N}^{2}}\right)\right)\right)\right) \]
    11. metadata-evalN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(N, \left(\frac{1}{2} + \color{blue}{N} \cdot \left(\frac{1}{24} \cdot \frac{1}{{N}^{3}} - \frac{\frac{1}{12}}{{N}^{2}}\right)\right)\right)\right) \]
    12. +-lowering-+.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(N, \mathsf{+.f64}\left(\frac{1}{2}, \color{blue}{\left(N \cdot \left(\frac{1}{24} \cdot \frac{1}{{N}^{3}} - \frac{\frac{1}{12}}{{N}^{2}}\right)\right)}\right)\right)\right) \]
    13. *-lowering-*.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(N, \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(N, \color{blue}{\left(\frac{1}{24} \cdot \frac{1}{{N}^{3}} - \frac{\frac{1}{12}}{{N}^{2}}\right)}\right)\right)\right)\right) \]
  9. Simplified97.3%

    \[\leadsto \frac{1}{\color{blue}{N + \left(0.5 + N \cdot \frac{\frac{0.041666666666666664}{N} + -0.08333333333333333}{N \cdot N}\right)}} \]
  10. Step-by-step derivation
    1. associate-+r+N/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(\left(N + \frac{1}{2}\right) + \color{blue}{N \cdot \frac{\frac{\frac{1}{24}}{N} + \frac{-1}{12}}{N \cdot N}}\right)\right) \]
    2. *-commutativeN/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(\left(N + \frac{1}{2}\right) + \frac{\frac{\frac{1}{24}}{N} + \frac{-1}{12}}{N \cdot N} \cdot \color{blue}{N}\right)\right) \]
    3. associate-/r*N/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(\left(N + \frac{1}{2}\right) + \frac{\frac{\frac{\frac{1}{24}}{N} + \frac{-1}{12}}{N}}{N} \cdot N\right)\right) \]
    4. div-invN/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(\left(N + \frac{1}{2}\right) + \left(\frac{\frac{\frac{1}{24}}{N} + \frac{-1}{12}}{N} \cdot \frac{1}{N}\right) \cdot N\right)\right) \]
    5. associate-*l*N/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(\left(N + \frac{1}{2}\right) + \frac{\frac{\frac{1}{24}}{N} + \frac{-1}{12}}{N} \cdot \color{blue}{\left(\frac{1}{N} \cdot N\right)}\right)\right) \]
    6. lft-mult-inverseN/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(\left(N + \frac{1}{2}\right) + \frac{\frac{\frac{1}{24}}{N} + \frac{-1}{12}}{N} \cdot 1\right)\right) \]
    7. associate-/r/N/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(\left(N + \frac{1}{2}\right) + \frac{\frac{\frac{1}{24}}{N} + \frac{-1}{12}}{\color{blue}{\frac{N}{1}}}\right)\right) \]
    8. /-rgt-identityN/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(\left(N + \frac{1}{2}\right) + \frac{\frac{\frac{1}{24}}{N} + \frac{-1}{12}}{N}\right)\right) \]
    9. frac-2negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(\left(N + \frac{1}{2}\right) + \frac{\mathsf{neg}\left(\left(\frac{\frac{1}{24}}{N} + \frac{-1}{12}\right)\right)}{\color{blue}{\mathsf{neg}\left(N\right)}}\right)\right) \]
    10. distribute-frac-negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(\left(N + \frac{1}{2}\right) + \left(\mathsf{neg}\left(\frac{\frac{\frac{1}{24}}{N} + \frac{-1}{12}}{\mathsf{neg}\left(N\right)}\right)\right)\right)\right) \]
    11. unsub-negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(\left(N + \frac{1}{2}\right) - \color{blue}{\frac{\frac{\frac{1}{24}}{N} + \frac{-1}{12}}{\mathsf{neg}\left(N\right)}}\right)\right) \]
    12. --lowering--.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{\_.f64}\left(\left(N + \frac{1}{2}\right), \color{blue}{\left(\frac{\frac{\frac{1}{24}}{N} + \frac{-1}{12}}{\mathsf{neg}\left(N\right)}\right)}\right)\right) \]
    13. +-lowering-+.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{\_.f64}\left(\mathsf{+.f64}\left(N, \frac{1}{2}\right), \left(\frac{\color{blue}{\frac{\frac{1}{24}}{N} + \frac{-1}{12}}}{\mathsf{neg}\left(N\right)}\right)\right)\right) \]
    14. distribute-frac-neg2N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{\_.f64}\left(\mathsf{+.f64}\left(N, \frac{1}{2}\right), \left(\mathsf{neg}\left(\frac{\frac{\frac{1}{24}}{N} + \frac{-1}{12}}{N}\right)\right)\right)\right) \]
    15. distribute-frac-negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{\_.f64}\left(\mathsf{+.f64}\left(N, \frac{1}{2}\right), \left(\frac{\mathsf{neg}\left(\left(\frac{\frac{1}{24}}{N} + \frac{-1}{12}\right)\right)}{\color{blue}{N}}\right)\right)\right) \]
    16. /-lowering-/.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{\_.f64}\left(\mathsf{+.f64}\left(N, \frac{1}{2}\right), \mathsf{/.f64}\left(\left(\mathsf{neg}\left(\left(\frac{\frac{1}{24}}{N} + \frac{-1}{12}\right)\right)\right), \color{blue}{N}\right)\right)\right) \]
    17. +-commutativeN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{\_.f64}\left(\mathsf{+.f64}\left(N, \frac{1}{2}\right), \mathsf{/.f64}\left(\left(\mathsf{neg}\left(\left(\frac{-1}{12} + \frac{\frac{1}{24}}{N}\right)\right)\right), N\right)\right)\right) \]
    18. distribute-neg-inN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{\_.f64}\left(\mathsf{+.f64}\left(N, \frac{1}{2}\right), \mathsf{/.f64}\left(\left(\left(\mathsf{neg}\left(\frac{-1}{12}\right)\right) + \left(\mathsf{neg}\left(\frac{\frac{1}{24}}{N}\right)\right)\right), N\right)\right)\right) \]
    19. unsub-negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{\_.f64}\left(\mathsf{+.f64}\left(N, \frac{1}{2}\right), \mathsf{/.f64}\left(\left(\left(\mathsf{neg}\left(\frac{-1}{12}\right)\right) - \frac{\frac{1}{24}}{N}\right), N\right)\right)\right) \]
    20. --lowering--.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{\_.f64}\left(\mathsf{+.f64}\left(N, \frac{1}{2}\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(\left(\mathsf{neg}\left(\frac{-1}{12}\right)\right), \left(\frac{\frac{1}{24}}{N}\right)\right), N\right)\right)\right) \]
    21. metadata-evalN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{\_.f64}\left(\mathsf{+.f64}\left(N, \frac{1}{2}\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(\frac{1}{12}, \left(\frac{\frac{1}{24}}{N}\right)\right), N\right)\right)\right) \]
    22. /-lowering-/.f6497.3%

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{\_.f64}\left(\mathsf{+.f64}\left(N, \frac{1}{2}\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(\frac{1}{12}, \mathsf{/.f64}\left(\frac{1}{24}, N\right)\right), N\right)\right)\right) \]
  11. Applied egg-rr97.3%

    \[\leadsto \frac{1}{\color{blue}{\left(N + 0.5\right) - \frac{0.08333333333333333 - \frac{0.041666666666666664}{N}}{N}}} \]
  12. Final simplification97.3%

    \[\leadsto \frac{1}{\left(N + 0.5\right) + \frac{\frac{0.041666666666666664}{N} - 0.08333333333333333}{N}} \]
  13. Add Preprocessing

Alternative 3: 95.7% accurate, 22.8× speedup?

\[\begin{array}{l} \\ \frac{1}{N + \left(0.5 - \frac{0.08333333333333333}{N}\right)} \end{array} \]
(FPCore (N)
 :precision binary64
 (/ 1.0 (+ N (- 0.5 (/ 0.08333333333333333 N)))))
double code(double N) {
	return 1.0 / (N + (0.5 - (0.08333333333333333 / N)));
}
real(8) function code(n)
    real(8), intent (in) :: n
    code = 1.0d0 / (n + (0.5d0 - (0.08333333333333333d0 / n)))
end function
public static double code(double N) {
	return 1.0 / (N + (0.5 - (0.08333333333333333 / N)));
}
def code(N):
	return 1.0 / (N + (0.5 - (0.08333333333333333 / N)))
function code(N)
	return Float64(1.0 / Float64(N + Float64(0.5 - Float64(0.08333333333333333 / N))))
end
function tmp = code(N)
	tmp = 1.0 / (N + (0.5 - (0.08333333333333333 / N)));
end
code[N_] := N[(1.0 / N[(N + N[(0.5 - N[(0.08333333333333333 / N), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{1}{N + \left(0.5 - \frac{0.08333333333333333}{N}\right)}
\end{array}
Derivation
  1. Initial program 23.1%

    \[\log \left(N + 1\right) - \log N \]
  2. Add Preprocessing
  3. Taylor expanded in N around inf

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

    \[\leadsto \color{blue}{\frac{1 + \frac{-0.5 + \frac{0.3333333333333333 + \frac{-0.25}{N}}{N}}{N}}{N}} \]
  5. Step-by-step derivation
    1. clear-numN/A

      \[\leadsto \frac{1}{\color{blue}{\frac{N}{1 + \frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{N}}}} \]
    2. /-lowering-/.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(\frac{N}{1 + \frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{N}}\right)}\right) \]
    3. /-lowering-/.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \color{blue}{\left(1 + \frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{N}\right)}\right)\right) \]
    4. frac-2negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \left(1 + \frac{\mathsf{neg}\left(\left(\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}\right)\right)}{\color{blue}{\mathsf{neg}\left(N\right)}}\right)\right)\right) \]
    5. distribute-frac-negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \left(1 + \left(\mathsf{neg}\left(\frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{\mathsf{neg}\left(N\right)}\right)\right)\right)\right)\right) \]
    6. unsub-negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \left(1 - \color{blue}{\frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{\mathsf{neg}\left(N\right)}}\right)\right)\right) \]
    7. --lowering--.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \mathsf{\_.f64}\left(1, \color{blue}{\left(\frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{\mathsf{neg}\left(N\right)}\right)}\right)\right)\right) \]
    8. frac-2negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \mathsf{\_.f64}\left(1, \left(\frac{\mathsf{neg}\left(\left(\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}\right)\right)}{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(N\right)\right)\right)}}\right)\right)\right)\right) \]
    9. remove-double-negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \mathsf{\_.f64}\left(1, \left(\frac{\mathsf{neg}\left(\left(\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}\right)\right)}{N}\right)\right)\right)\right) \]
    10. /-lowering-/.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \mathsf{\_.f64}\left(1, \mathsf{/.f64}\left(\left(\mathsf{neg}\left(\left(\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}\right)\right)\right), \color{blue}{N}\right)\right)\right)\right) \]
  6. Applied egg-rr96.9%

    \[\leadsto \color{blue}{\frac{1}{\frac{N}{1 - \frac{0.5 + \frac{-0.3333333333333333 + \frac{0.25}{N}}{N}}{N}}}} \]
  7. Taylor expanded in N around inf

    \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(N \cdot \left(\left(1 + \frac{1}{2} \cdot \frac{1}{N}\right) - \frac{\frac{1}{12}}{{N}^{2}}\right)\right)}\right) \]
  8. Simplified96.2%

    \[\leadsto \frac{1}{\color{blue}{N + \left(0.5 - \frac{0.08333333333333333}{N}\right)}} \]
  9. Add Preprocessing

Alternative 4: 93.2% accurate, 41.0× speedup?

\[\begin{array}{l} \\ \frac{1}{N + 0.5} \end{array} \]
(FPCore (N) :precision binary64 (/ 1.0 (+ N 0.5)))
double code(double N) {
	return 1.0 / (N + 0.5);
}
real(8) function code(n)
    real(8), intent (in) :: n
    code = 1.0d0 / (n + 0.5d0)
end function
public static double code(double N) {
	return 1.0 / (N + 0.5);
}
def code(N):
	return 1.0 / (N + 0.5)
function code(N)
	return Float64(1.0 / Float64(N + 0.5))
end
function tmp = code(N)
	tmp = 1.0 / (N + 0.5);
end
code[N_] := N[(1.0 / N[(N + 0.5), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{1}{N + 0.5}
\end{array}
Derivation
  1. Initial program 23.1%

    \[\log \left(N + 1\right) - \log N \]
  2. Add Preprocessing
  3. Taylor expanded in N around inf

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

    \[\leadsto \color{blue}{\frac{1 + \frac{-0.5 + \frac{0.3333333333333333 + \frac{-0.25}{N}}{N}}{N}}{N}} \]
  5. Step-by-step derivation
    1. clear-numN/A

      \[\leadsto \frac{1}{\color{blue}{\frac{N}{1 + \frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{N}}}} \]
    2. /-lowering-/.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(\frac{N}{1 + \frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{N}}\right)}\right) \]
    3. /-lowering-/.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \color{blue}{\left(1 + \frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{N}\right)}\right)\right) \]
    4. frac-2negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \left(1 + \frac{\mathsf{neg}\left(\left(\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}\right)\right)}{\color{blue}{\mathsf{neg}\left(N\right)}}\right)\right)\right) \]
    5. distribute-frac-negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \left(1 + \left(\mathsf{neg}\left(\frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{\mathsf{neg}\left(N\right)}\right)\right)\right)\right)\right) \]
    6. unsub-negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \left(1 - \color{blue}{\frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{\mathsf{neg}\left(N\right)}}\right)\right)\right) \]
    7. --lowering--.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \mathsf{\_.f64}\left(1, \color{blue}{\left(\frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{\mathsf{neg}\left(N\right)}\right)}\right)\right)\right) \]
    8. frac-2negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \mathsf{\_.f64}\left(1, \left(\frac{\mathsf{neg}\left(\left(\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}\right)\right)}{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(N\right)\right)\right)}}\right)\right)\right)\right) \]
    9. remove-double-negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \mathsf{\_.f64}\left(1, \left(\frac{\mathsf{neg}\left(\left(\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}\right)\right)}{N}\right)\right)\right)\right) \]
    10. /-lowering-/.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \mathsf{\_.f64}\left(1, \mathsf{/.f64}\left(\left(\mathsf{neg}\left(\left(\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}\right)\right)\right), \color{blue}{N}\right)\right)\right)\right) \]
  6. Applied egg-rr96.9%

    \[\leadsto \color{blue}{\frac{1}{\frac{N}{1 - \frac{0.5 + \frac{-0.3333333333333333 + \frac{0.25}{N}}{N}}{N}}}} \]
  7. Taylor expanded in N around inf

    \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(N \cdot \left(1 + \frac{1}{2} \cdot \frac{1}{N}\right)\right)}\right) \]
  8. Step-by-step derivation
    1. distribute-lft-inN/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(N \cdot 1 + \color{blue}{N \cdot \left(\frac{1}{2} \cdot \frac{1}{N}\right)}\right)\right) \]
    2. *-rgt-identityN/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(N + \color{blue}{N} \cdot \left(\frac{1}{2} \cdot \frac{1}{N}\right)\right)\right) \]
    3. *-commutativeN/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(N + N \cdot \left(\frac{1}{N} \cdot \color{blue}{\frac{1}{2}}\right)\right)\right) \]
    4. associate-*r*N/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(N + \left(N \cdot \frac{1}{N}\right) \cdot \color{blue}{\frac{1}{2}}\right)\right) \]
    5. rgt-mult-inverseN/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(N + 1 \cdot \frac{1}{2}\right)\right) \]
    6. metadata-evalN/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(N + \frac{1}{2}\right)\right) \]
    7. +-lowering-+.f6493.9%

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(N, \color{blue}{\frac{1}{2}}\right)\right) \]
  9. Simplified93.9%

    \[\leadsto \frac{1}{\color{blue}{N + 0.5}} \]
  10. Add Preprocessing

Alternative 5: 84.6% accurate, 68.3× speedup?

\[\begin{array}{l} \\ \frac{1}{N} \end{array} \]
(FPCore (N) :precision binary64 (/ 1.0 N))
double code(double N) {
	return 1.0 / N;
}
real(8) function code(n)
    real(8), intent (in) :: n
    code = 1.0d0 / n
end function
public static double code(double N) {
	return 1.0 / N;
}
def code(N):
	return 1.0 / N
function code(N)
	return Float64(1.0 / N)
end
function tmp = code(N)
	tmp = 1.0 / N;
end
code[N_] := N[(1.0 / N), $MachinePrecision]
\begin{array}{l}

\\
\frac{1}{N}
\end{array}
Derivation
  1. Initial program 23.1%

    \[\log \left(N + 1\right) - \log N \]
  2. Add Preprocessing
  3. Taylor expanded in N around inf

    \[\leadsto \color{blue}{\frac{1}{N}} \]
  4. Step-by-step derivation
    1. /-lowering-/.f6485.2%

      \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{N}\right) \]
  5. Simplified85.2%

    \[\leadsto \color{blue}{\frac{1}{N}} \]
  6. Add Preprocessing

Alternative 6: 9.9% accurate, 205.0× speedup?

\[\begin{array}{l} \\ 2 \end{array} \]
(FPCore (N) :precision binary64 2.0)
double code(double N) {
	return 2.0;
}
real(8) function code(n)
    real(8), intent (in) :: n
    code = 2.0d0
end function
public static double code(double N) {
	return 2.0;
}
def code(N):
	return 2.0
function code(N)
	return 2.0
end
function tmp = code(N)
	tmp = 2.0;
end
code[N_] := 2.0
\begin{array}{l}

\\
2
\end{array}
Derivation
  1. Initial program 23.1%

    \[\log \left(N + 1\right) - \log N \]
  2. Add Preprocessing
  3. Taylor expanded in N around inf

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

    \[\leadsto \color{blue}{\frac{1 + \frac{-0.5 + \frac{0.3333333333333333 + \frac{-0.25}{N}}{N}}{N}}{N}} \]
  5. Step-by-step derivation
    1. clear-numN/A

      \[\leadsto \frac{1}{\color{blue}{\frac{N}{1 + \frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{N}}}} \]
    2. /-lowering-/.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(\frac{N}{1 + \frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{N}}\right)}\right) \]
    3. /-lowering-/.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \color{blue}{\left(1 + \frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{N}\right)}\right)\right) \]
    4. frac-2negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \left(1 + \frac{\mathsf{neg}\left(\left(\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}\right)\right)}{\color{blue}{\mathsf{neg}\left(N\right)}}\right)\right)\right) \]
    5. distribute-frac-negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \left(1 + \left(\mathsf{neg}\left(\frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{\mathsf{neg}\left(N\right)}\right)\right)\right)\right)\right) \]
    6. unsub-negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \left(1 - \color{blue}{\frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{\mathsf{neg}\left(N\right)}}\right)\right)\right) \]
    7. --lowering--.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \mathsf{\_.f64}\left(1, \color{blue}{\left(\frac{\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}}{\mathsf{neg}\left(N\right)}\right)}\right)\right)\right) \]
    8. frac-2negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \mathsf{\_.f64}\left(1, \left(\frac{\mathsf{neg}\left(\left(\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}\right)\right)}{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(N\right)\right)\right)}}\right)\right)\right)\right) \]
    9. remove-double-negN/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \mathsf{\_.f64}\left(1, \left(\frac{\mathsf{neg}\left(\left(\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}\right)\right)}{N}\right)\right)\right)\right) \]
    10. /-lowering-/.f64N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{/.f64}\left(N, \mathsf{\_.f64}\left(1, \mathsf{/.f64}\left(\left(\mathsf{neg}\left(\left(\frac{-1}{2} + \frac{\frac{1}{3} + \frac{\frac{-1}{4}}{N}}{N}\right)\right)\right), \color{blue}{N}\right)\right)\right)\right) \]
  6. Applied egg-rr96.9%

    \[\leadsto \color{blue}{\frac{1}{\frac{N}{1 - \frac{0.5 + \frac{-0.3333333333333333 + \frac{0.25}{N}}{N}}{N}}}} \]
  7. Taylor expanded in N around inf

    \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(N \cdot \left(1 + \frac{1}{2} \cdot \frac{1}{N}\right)\right)}\right) \]
  8. Step-by-step derivation
    1. distribute-lft-inN/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(N \cdot 1 + \color{blue}{N \cdot \left(\frac{1}{2} \cdot \frac{1}{N}\right)}\right)\right) \]
    2. *-rgt-identityN/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(N + \color{blue}{N} \cdot \left(\frac{1}{2} \cdot \frac{1}{N}\right)\right)\right) \]
    3. *-commutativeN/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(N + N \cdot \left(\frac{1}{N} \cdot \color{blue}{\frac{1}{2}}\right)\right)\right) \]
    4. associate-*r*N/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(N + \left(N \cdot \frac{1}{N}\right) \cdot \color{blue}{\frac{1}{2}}\right)\right) \]
    5. rgt-mult-inverseN/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(N + 1 \cdot \frac{1}{2}\right)\right) \]
    6. metadata-evalN/A

      \[\leadsto \mathsf{/.f64}\left(1, \left(N + \frac{1}{2}\right)\right) \]
    7. +-lowering-+.f6493.9%

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(N, \color{blue}{\frac{1}{2}}\right)\right) \]
  9. Simplified93.9%

    \[\leadsto \frac{1}{\color{blue}{N + 0.5}} \]
  10. Taylor expanded in N around 0

    \[\leadsto \color{blue}{2} \]
  11. Step-by-step derivation
    1. Simplified9.8%

      \[\leadsto \color{blue}{2} \]
    2. Add Preprocessing

    Developer Target 1: 99.8% accurate, 2.0× speedup?

    \[\begin{array}{l} \\ \mathsf{log1p}\left(\frac{1}{N}\right) \end{array} \]
    (FPCore (N) :precision binary64 (log1p (/ 1.0 N)))
    double code(double N) {
    	return log1p((1.0 / N));
    }
    
    public static double code(double N) {
    	return Math.log1p((1.0 / N));
    }
    
    def code(N):
    	return math.log1p((1.0 / N))
    
    function code(N)
    	return log1p(Float64(1.0 / N))
    end
    
    code[N_] := N[Log[1 + N[(1.0 / N), $MachinePrecision]], $MachinePrecision]
    
    \begin{array}{l}
    
    \\
    \mathsf{log1p}\left(\frac{1}{N}\right)
    \end{array}
    

    Reproduce

    ?
    herbie shell --seed 2024164 
    (FPCore (N)
      :name "2log (problem 3.3.6)"
      :precision binary64
      :pre (and (> N 1.0) (< N 1e+40))
    
      :alt
      (! :herbie-platform default (log1p (/ 1 N)))
    
      (- (log (+ N 1.0)) (log N)))