Average Error: 29.5 → 0.1
Time: 4.7s
Precision: binary64
\[\log \left(N + 1\right) - \log N\]
↓
\[\begin{array}{l} \mathbf{if}\;\log \left(N + 1\right) - \log N \leq 2.6520138902697 \cdot 10^{-06}:\\ \;\;\;\;\left(\frac{0.3333333333333333}{{N}^{3}} + \frac{1}{N}\right) - \frac{0.5}{N \cdot N}\\ \mathbf{else}:\\ \;\;\;\;\sqrt[3]{{\log \left(N + 1\right)}^{3}} - \log N\\ \end{array}\]
\log \left(N + 1\right) - \log N
↓
\begin{array}{l}
\mathbf{if}\;\log \left(N + 1\right) - \log N \leq 2.6520138902697 \cdot 10^{-06}:\\
\;\;\;\;\left(\frac{0.3333333333333333}{{N}^{3}} + \frac{1}{N}\right) - \frac{0.5}{N \cdot N}\\

\mathbf{else}:\\
\;\;\;\;\sqrt[3]{{\log \left(N + 1\right)}^{3}} - \log N\\

\end{array}
(FPCore (N) :precision binary64 (- (log (+ N 1.0)) (log N)))
↓
(FPCore (N)
 :precision binary64
 (if (<= (- (log (+ N 1.0)) (log N)) 2.6520138902697e-06)
   (- (+ (/ 0.3333333333333333 (pow N 3.0)) (/ 1.0 N)) (/ 0.5 (* N N)))
   (- (cbrt (pow (log (+ N 1.0)) 3.0)) (log N))))
double code(double N) {
	return log(N + 1.0) - log(N);
}
↓
double code(double N) {
	double tmp;
	if ((log(N + 1.0) - log(N)) <= 2.6520138902697e-06) {
		tmp = ((0.3333333333333333 / pow(N, 3.0)) + (1.0 / N)) - (0.5 / (N * N));
	} else {
		tmp = cbrt(pow(log(N + 1.0), 3.0)) - log(N);
	}
	return tmp;
}

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 (-.f64 (log.f64 (+.f64 N 1)) (log.f64 N)) < 2.65201389e-6

    1. Initial program 59.9

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

    2. Taylor expanded around inf 0.0

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

    3. Simplified0.0

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

    if 2.65201389e-6 < (-.f64 (log.f64 (+.f64 N 1)) (log.f64 N))

    1. Initial program 0.2

      \[\log \left(N + 1\right) - \log N\]
    2. Using strategy rm

    3. Applied add-cbrt-cube_binary64_1140.2

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

    4. Simplified0.2

      \[\leadsto \sqrt[3]{\color{blue}{{\log \left(N + 1\right)}^{3}}} - \log N\]
  3. Recombined 2 regimes into one program.

  4. Final simplification0.1

    \[\leadsto \begin{array}{l} \mathbf{if}\;\log \left(N + 1\right) - \log N \leq 2.6520138902697 \cdot 10^{-06}:\\ \;\;\;\;\left(\frac{0.3333333333333333}{{N}^{3}} + \frac{1}{N}\right) - \frac{0.5}{N \cdot N}\\ \mathbf{else}:\\ \;\;\;\;\sqrt[3]{{\log \left(N + 1\right)}^{3}} - \log N\\ \end{array}\]

Reproduce

herbie shell --seed 2020308 
(FPCore (N)
  :name "2log (problem 3.3.6)"
  :precision binary64
  (- (log (+ N 1.0)) (log N)))