2log (problem 3.3.6)

Percentage Accurate: 24.1% → 99.4%

Time: 12.2s

Alternatives: 11

Speedup: 68.3×

Specification

\[N > 1 \land N < 10^{+40}\]

Math

\[\begin{array}{l} \\ \log \left(N + 1\right) - \log N \end{array} \]

FPCore

(FPCore (N) :precision binary64 (- (log (+ N 1.0)) (log N)))

C

double code(double N) {
	return log((N + 1.0)) - log(N);
}

Fortran

real(8) function code(n)
    real(8), intent (in) :: n
    code = log((n + 1.0d0)) - log(n)
end function

Java

public static double code(double N) {
	return Math.log((N + 1.0)) - Math.log(N);
}

Python

def code(N):
	return math.log((N + 1.0)) - math.log(N)

Julia

function code(N)
	return Float64(log(Float64(N + 1.0)) - log(N))
end

MATLAB

function tmp = code(N)
	tmp = log((N + 1.0)) - log(N);
end

Wolfram

code[N_] := N[(N[Log[N[(N + 1.0), $MachinePrecision]], $MachinePrecision] - N[Log[N], $MachinePrecision]), $MachinePrecision]

Initial Program: 24.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \log \left(N + 1\right) - \log N \end{array} \]

FPCore

(FPCore (N) :precision binary64 (- (log (+ N 1.0)) (log N)))

C

double code(double N) {
	return log((N + 1.0)) - log(N);
}

Fortran

real(8) function code(n)
    real(8), intent (in) :: n
    code = log((n + 1.0d0)) - log(n)
end function

Java

public static double code(double N) {
	return Math.log((N + 1.0)) - Math.log(N);
}

Python

def code(N):
	return math.log((N + 1.0)) - math.log(N)

Julia

function code(N)
	return Float64(log(Float64(N + 1.0)) - log(N))
end

MATLAB

function tmp = code(N)
	tmp = log((N + 1.0)) - log(N);
end

Wolfram

code[N_] := N[(N[Log[N[(N + 1.0), $MachinePrecision]], $MachinePrecision] - N[Log[N], $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\log \left(N + 1\right) - \log N \leq 0.0002:\\ \;\;\;\;\frac{1 + \frac{-0.5 + \frac{0.3333333333333333 + \frac{-0.25}{N}}{N}}{N}}{N}\\ \mathbf{else}:\\ \;\;\;\;-\log \left(\frac{N}{N + 1}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (N)
 :precision binary64
 (if (<= (- (log (+ N 1.0)) (log N)) 0.0002)
   (/ (+ 1.0 (/ (+ -0.5 (/ (+ 0.3333333333333333 (/ -0.25 N)) N)) N)) N)
   (- (log (/ N (+ N 1.0))))))

C

double code(double N) {
	double tmp;
	if ((log((N + 1.0)) - log(N)) <= 0.0002) {
		tmp = (1.0 + ((-0.5 + ((0.3333333333333333 + (-0.25 / N)) / N)) / N)) / N;
	} else {
		tmp = -log((N / (N + 1.0)));
	}
	return tmp;
}

Fortran

real(8) function code(n)
    real(8), intent (in) :: n
    real(8) :: tmp
    if ((log((n + 1.0d0)) - log(n)) <= 0.0002d0) then
        tmp = (1.0d0 + (((-0.5d0) + ((0.3333333333333333d0 + ((-0.25d0) / n)) / n)) / n)) / n
    else
        tmp = -log((n / (n + 1.0d0)))
    end if
    code = tmp
end function

Java

public static double code(double N) {
	double tmp;
	if ((Math.log((N + 1.0)) - Math.log(N)) <= 0.0002) {
		tmp = (1.0 + ((-0.5 + ((0.3333333333333333 + (-0.25 / N)) / N)) / N)) / N;
	} else {
		tmp = -Math.log((N / (N + 1.0)));
	}
	return tmp;
}

Python

def code(N):
	tmp = 0
	if (math.log((N + 1.0)) - math.log(N)) <= 0.0002:
		tmp = (1.0 + ((-0.5 + ((0.3333333333333333 + (-0.25 / N)) / N)) / N)) / N
	else:
		tmp = -math.log((N / (N + 1.0)))
	return tmp

Julia

function code(N)
	tmp = 0.0
	if (Float64(log(Float64(N + 1.0)) - log(N)) <= 0.0002)
		tmp = Float64(Float64(1.0 + Float64(Float64(-0.5 + Float64(Float64(0.3333333333333333 + Float64(-0.25 / N)) / N)) / N)) / N);
	else
		tmp = Float64(-log(Float64(N / Float64(N + 1.0))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(N)
	tmp = 0.0;
	if ((log((N + 1.0)) - log(N)) <= 0.0002)
		tmp = (1.0 + ((-0.5 + ((0.3333333333333333 + (-0.25 / N)) / N)) / N)) / N;
	else
		tmp = -log((N / (N + 1.0)));
	end
	tmp_2 = tmp;
end

Wolfram

code[N_] := If[LessEqual[N[(N[Log[N[(N + 1.0), $MachinePrecision]], $MachinePrecision] - N[Log[N], $MachinePrecision]), $MachinePrecision], 0.0002], N[(N[(1.0 + N[(N[(-0.5 + N[(N[(0.3333333333333333 + N[(-0.25 / N), $MachinePrecision]), $MachinePrecision] / N), $MachinePrecision]), $MachinePrecision] / N), $MachinePrecision]), $MachinePrecision] / N), $MachinePrecision], (-N[Log[N[(N / N[(N + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (log.f64 (+.f64 N #s(literal 1 binary64))) (log.f64 N)) < 2.0000000000000001e-4

   1. Initial program 15.1%

      \[\log \left(N + 1\right) - \log N \]
   2. Step-by-step derivation

      1. +-commutative 15.1%

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

      2. log1p-define 15.1%

         \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right)} - \log N \]

   3. Simplified 15.1%

      \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right) - \log N} \]
   4. Add Preprocessing

   5. Taylor expanded in N around -inf 100.0%

      \[\leadsto \color{blue}{-1 \cdot \frac{-1 \cdot \frac{-1 \cdot \frac{0.25 \cdot \frac{1}{N} - 0.3333333333333333}{N} - 0.5}{N} - 1}{N}} \]
   6. Step-by-step derivation

      1. associate-*r/ 100.0%

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

   7. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + \frac{-0.5 + \frac{0.3333333333333333 + \frac{-0.25}{N}}{N}}{N}}{N}} \]

   if 2.0000000000000001e-4 < (-.f64 (log.f64 (+.f64 N #s(literal 1 binary64))) (log.f64 N))

   1. Initial program 90.5%

      \[\log \left(N + 1\right) - \log N \]
   2. Step-by-step derivation

      1. +-commutative 90.5%

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

      2. log1p-define 90.5%

         \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right)} - \log N \]

   3. Simplified 90.5%

      \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right) - \log N} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. add-sqr-sqrt 90.6%

         \[\leadsto \color{blue}{\sqrt{\mathsf{log1p}\left(N\right) - \log N} \cdot \sqrt{\mathsf{log1p}\left(N\right) - \log N}} \]

      2. pow2 90.6%

         \[\leadsto \color{blue}{{\left(\sqrt{\mathsf{log1p}\left(N\right) - \log N}\right)}^{2}} \]

   6. Applied egg-rr 90.6%

      \[\leadsto \color{blue}{{\left(\sqrt{\mathsf{log1p}\left(N\right) - \log N}\right)}^{2}} \]
   7. Step-by-step derivation

      1. unpow2 90.6%

         \[\leadsto \color{blue}{\sqrt{\mathsf{log1p}\left(N\right) - \log N} \cdot \sqrt{\mathsf{log1p}\left(N\right) - \log N}} \]

      2. add-sqr-sqrt 90.5%

         \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right) - \log N} \]

      3. log1p-undefine 90.5%

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

      4. +-commutative 90.5%

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

      5. diff-log 93.3%

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

      6. clear-num 93.2%

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

      7. log-div 94.4%

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

      8. metadata-eval 94.4%

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

   8. Applied egg-rr 94.4%

      \[\leadsto \color{blue}{0 - \log \left(\frac{N}{N + 1}\right)} \]
   9. Step-by-step derivation

      1. neg-sub0 94.4%

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

   10. Simplified 94.4%

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

Alternative 2: 99.4% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;N \leq 1700:\\ \;\;\;\;\log \left(1 + \frac{1}{N}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + \frac{-0.5 + \frac{0.3333333333333333 + \frac{-0.25}{N}}{N}}{N}}{N}\\ \end{array} \end{array} \]

FPCore

(FPCore (N)
 :precision binary64
 (if (<= N 1700.0)
   (log (+ 1.0 (/ 1.0 N)))
   (/ (+ 1.0 (/ (+ -0.5 (/ (+ 0.3333333333333333 (/ -0.25 N)) N)) N)) N)))

C

double code(double N) {
	double tmp;
	if (N <= 1700.0) {
		tmp = log((1.0 + (1.0 / N)));
	} else {
		tmp = (1.0 + ((-0.5 + ((0.3333333333333333 + (-0.25 / N)) / N)) / N)) / N;
	}
	return tmp;
}

Fortran

real(8) function code(n)
    real(8), intent (in) :: n
    real(8) :: tmp
    if (n <= 1700.0d0) then
        tmp = log((1.0d0 + (1.0d0 / n)))
    else
        tmp = (1.0d0 + (((-0.5d0) + ((0.3333333333333333d0 + ((-0.25d0) / n)) / n)) / n)) / n
    end if
    code = tmp
end function

Java

public static double code(double N) {
	double tmp;
	if (N <= 1700.0) {
		tmp = Math.log((1.0 + (1.0 / N)));
	} else {
		tmp = (1.0 + ((-0.5 + ((0.3333333333333333 + (-0.25 / N)) / N)) / N)) / N;
	}
	return tmp;
}

Python

def code(N):
	tmp = 0
	if N <= 1700.0:
		tmp = math.log((1.0 + (1.0 / N)))
	else:
		tmp = (1.0 + ((-0.5 + ((0.3333333333333333 + (-0.25 / N)) / N)) / N)) / N
	return tmp

Julia

function code(N)
	tmp = 0.0
	if (N <= 1700.0)
		tmp = log(Float64(1.0 + Float64(1.0 / N)));
	else
		tmp = Float64(Float64(1.0 + Float64(Float64(-0.5 + Float64(Float64(0.3333333333333333 + Float64(-0.25 / N)) / N)) / N)) / N);
	end
	return tmp
end

MATLAB

function tmp_2 = code(N)
	tmp = 0.0;
	if (N <= 1700.0)
		tmp = log((1.0 + (1.0 / N)));
	else
		tmp = (1.0 + ((-0.5 + ((0.3333333333333333 + (-0.25 / N)) / N)) / N)) / N;
	end
	tmp_2 = tmp;
end

Wolfram

code[N_] := If[LessEqual[N, 1700.0], N[Log[N[(1.0 + N[(1.0 / N), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(1.0 + N[(N[(-0.5 + N[(N[(0.3333333333333333 + N[(-0.25 / N), $MachinePrecision]), $MachinePrecision] / N), $MachinePrecision]), $MachinePrecision] / N), $MachinePrecision]), $MachinePrecision] / N), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if N < 1700

   1. Initial program 90.5%

      \[\log \left(N + 1\right) - \log N \]
   2. Step-by-step derivation

      1. +-commutative 90.5%

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

      2. log1p-define 90.5%

         \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right)} - \log N \]

   3. Simplified 90.5%

      \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right) - \log N} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. add-sqr-sqrt 90.6%

         \[\leadsto \color{blue}{\sqrt{\mathsf{log1p}\left(N\right) - \log N} \cdot \sqrt{\mathsf{log1p}\left(N\right) - \log N}} \]

      2. pow2 90.6%

         \[\leadsto \color{blue}{{\left(\sqrt{\mathsf{log1p}\left(N\right) - \log N}\right)}^{2}} \]

   6. Applied egg-rr 90.6%

      \[\leadsto \color{blue}{{\left(\sqrt{\mathsf{log1p}\left(N\right) - \log N}\right)}^{2}} \]
   7. Step-by-step derivation

      1. unpow2 90.6%

         \[\leadsto \color{blue}{\sqrt{\mathsf{log1p}\left(N\right) - \log N} \cdot \sqrt{\mathsf{log1p}\left(N\right) - \log N}} \]

      2. add-sqr-sqrt 90.5%

         \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right) - \log N} \]

      3. log1p-undefine 90.5%

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

      4. +-commutative 90.5%

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

      5. diff-log 93.3%

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

   8. Applied egg-rr 93.3%

      \[\leadsto \color{blue}{\log \left(\frac{N + 1}{N}\right)} \]
   9. Step-by-step derivation

      1. *-lft-identity 93.3%

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

      2. associate-*l/ 93.3%

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

      3. distribute-rgt-in 93.2%

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

      4. rgt-mult-inverse 93.4%

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

      5. *-lft-identity 93.4%

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

   10. Simplified 93.4%

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

   if 1700 < N

   1. Initial program 15.1%

      \[\log \left(N + 1\right) - \log N \]
   2. Step-by-step derivation

      1. +-commutative 15.1%

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

      2. log1p-define 15.1%

         \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right)} - \log N \]

   3. Simplified 15.1%

      \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right) - \log N} \]
   4. Add Preprocessing

   5. Taylor expanded in N around -inf 100.0%

      \[\leadsto \color{blue}{-1 \cdot \frac{-1 \cdot \frac{-1 \cdot \frac{0.25 \cdot \frac{1}{N} - 0.3333333333333333}{N} - 0.5}{N} - 1}{N}} \]
   6. Step-by-step derivation

      1. associate-*r/ 100.0%

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

   7. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + \frac{-0.5 + \frac{0.3333333333333333 + \frac{-0.25}{N}}{N}}{N}}{N}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 96.1% accurate, 12.1× speedup

Math

\[\begin{array}{l} \\ \frac{1}{\frac{N}{1 + \frac{-0.5 + \frac{0.3333333333333333 + \frac{-0.25}{N}}{N}}{N}}} \end{array} \]

FPCore

(FPCore (N)
 :precision binary64
 (/ 1.0 (/ N (+ 1.0 (/ (+ -0.5 (/ (+ 0.3333333333333333 (/ -0.25 N)) N)) N)))))

C

double code(double N) {
	return 1.0 / (N / (1.0 + ((-0.5 + ((0.3333333333333333 + (-0.25 / N)) / N)) / N)));
}

Fortran

real(8) function code(n)
    real(8), intent (in) :: n
    code = 1.0d0 / (n / (1.0d0 + (((-0.5d0) + ((0.3333333333333333d0 + ((-0.25d0) / n)) / n)) / n)))
end function

Java

public static double code(double N) {
	return 1.0 / (N / (1.0 + ((-0.5 + ((0.3333333333333333 + (-0.25 / N)) / N)) / N)));
}

Python

def code(N):
	return 1.0 / (N / (1.0 + ((-0.5 + ((0.3333333333333333 + (-0.25 / N)) / N)) / N)))

Julia

function code(N)
	return Float64(1.0 / Float64(N / Float64(1.0 + Float64(Float64(-0.5 + Float64(Float64(0.3333333333333333 + Float64(-0.25 / N)) / N)) / N))))
end

MATLAB

function tmp = code(N)
	tmp = 1.0 / (N / (1.0 + ((-0.5 + ((0.3333333333333333 + (-0.25 / N)) / N)) / N)));
end

Wolfram

code[N_] := N[(1.0 / N[(N / N[(1.0 + N[(N[(-0.5 + N[(N[(0.3333333333333333 + N[(-0.25 / N), $MachinePrecision]), $MachinePrecision] / N), $MachinePrecision]), $MachinePrecision] / N), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 23.7%

   \[\log \left(N + 1\right) - \log N \]
2. Step-by-step derivation

   1. +-commutative 23.7%

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

   2. log1p-define 23.7%

      \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right)} - \log N \]

3. Simplified 23.7%

   \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right) - \log N} \]
4. Add Preprocessing

5. Taylor expanded in N around -inf 95.3%

   \[\leadsto \color{blue}{-1 \cdot \frac{-1 \cdot \frac{-1 \cdot \frac{0.25 \cdot \frac{1}{N} - 0.3333333333333333}{N} - 0.5}{N} - 1}{N}} \]
6. Step-by-step derivation

   1. associate-*r/ 95.3%

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

7. Simplified 95.3%

   \[\leadsto \color{blue}{\frac{1 + \frac{-0.5 + \frac{0.3333333333333333 + \frac{-0.25}{N}}{N}}{N}}{N}} \]
8. Step-by-step derivation

   1. clear-num 95.3%

      \[\leadsto \color{blue}{\frac{1}{\frac{N}{1 + \frac{-0.5 + \frac{0.3333333333333333 + \frac{-0.25}{N}}{N}}{N}}}} \]

   2. inv-pow 95.3%

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

   3. +-commutative 95.3%

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

9. Applied egg-rr 95.3%

   \[\leadsto \color{blue}{{\left(\frac{N}{1 + \frac{\frac{0.3333333333333333 + \frac{-0.25}{N}}{N} + -0.5}{N}}\right)}^{-1}} \]
10. Step-by-step derivation

    1. unpow-1 95.3%

       \[\leadsto \color{blue}{\frac{1}{\frac{N}{1 + \frac{\frac{0.3333333333333333 + \frac{-0.25}{N}}{N} + -0.5}{N}}}} \]

    2. +-commutative 95.3%

       \[\leadsto \frac{1}{\frac{N}{1 + \frac{\color{blue}{-0.5 + \frac{0.3333333333333333 + \frac{-0.25}{N}}{N}}}{N}}} \]

11. Simplified 95.3%

    \[\leadsto \color{blue}{\frac{1}{\frac{N}{1 + \frac{-0.5 + \frac{0.3333333333333333 + \frac{-0.25}{N}}{N}}{N}}}} \]
12. Add Preprocessing

Alternative 4: 96.1% accurate, 13.7× speedup

Math

\[\begin{array}{l} \\ \frac{1 + \frac{-0.5 + \frac{0.3333333333333333 + \frac{-0.25}{N}}{N}}{N}}{N} \end{array} \]

FPCore

(FPCore (N)
 :precision binary64
 (/ (+ 1.0 (/ (+ -0.5 (/ (+ 0.3333333333333333 (/ -0.25 N)) N)) N)) N))

C

double code(double N) {
	return (1.0 + ((-0.5 + ((0.3333333333333333 + (-0.25 / N)) / N)) / N)) / N;
}

Fortran

real(8) function code(n)
    real(8), intent (in) :: n
    code = (1.0d0 + (((-0.5d0) + ((0.3333333333333333d0 + ((-0.25d0) / n)) / n)) / n)) / n
end function

Java

public static double code(double N) {
	return (1.0 + ((-0.5 + ((0.3333333333333333 + (-0.25 / N)) / N)) / N)) / N;
}

Python

def code(N):
	return (1.0 + ((-0.5 + ((0.3333333333333333 + (-0.25 / N)) / N)) / N)) / N

Julia

function code(N)
	return Float64(Float64(1.0 + Float64(Float64(-0.5 + Float64(Float64(0.3333333333333333 + Float64(-0.25 / N)) / N)) / N)) / N)
end

MATLAB

function tmp = code(N)
	tmp = (1.0 + ((-0.5 + ((0.3333333333333333 + (-0.25 / N)) / N)) / N)) / N;
end

Wolfram

code[N_] := N[(N[(1.0 + N[(N[(-0.5 + N[(N[(0.3333333333333333 + N[(-0.25 / N), $MachinePrecision]), $MachinePrecision] / N), $MachinePrecision]), $MachinePrecision] / N), $MachinePrecision]), $MachinePrecision] / N), $MachinePrecision]

Derivation

1. Initial program 23.7%

   \[\log \left(N + 1\right) - \log N \]
2. Step-by-step derivation

   1. +-commutative 23.7%

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

   2. log1p-define 23.7%

      \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right)} - \log N \]

3. Simplified 23.7%

   \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right) - \log N} \]
4. Add Preprocessing

5. Taylor expanded in N around -inf 95.3%

   \[\leadsto \color{blue}{-1 \cdot \frac{-1 \cdot \frac{-1 \cdot \frac{0.25 \cdot \frac{1}{N} - 0.3333333333333333}{N} - 0.5}{N} - 1}{N}} \]
6. Step-by-step derivation

   1. associate-*r/ 95.3%

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

7. Simplified 95.3%

   \[\leadsto \color{blue}{\frac{1 + \frac{-0.5 + \frac{0.3333333333333333 + \frac{-0.25}{N}}{N}}{N}}{N}} \]
8. Add Preprocessing

Alternative 5: 94.8% accurate, 15.8× speedup

Math

\[\begin{array}{l} \\ \frac{1}{\frac{N}{1 + \frac{-0.5 + \frac{0.3333333333333333}{N}}{N}}} \end{array} \]

FPCore

(FPCore (N)
 :precision binary64
 (/ 1.0 (/ N (+ 1.0 (/ (+ -0.5 (/ 0.3333333333333333 N)) N)))))

C

double code(double N) {
	return 1.0 / (N / (1.0 + ((-0.5 + (0.3333333333333333 / N)) / N)));
}

Fortran

real(8) function code(n)
    real(8), intent (in) :: n
    code = 1.0d0 / (n / (1.0d0 + (((-0.5d0) + (0.3333333333333333d0 / n)) / n)))
end function

Java

public static double code(double N) {
	return 1.0 / (N / (1.0 + ((-0.5 + (0.3333333333333333 / N)) / N)));
}

Python

def code(N):
	return 1.0 / (N / (1.0 + ((-0.5 + (0.3333333333333333 / N)) / N)))

Julia

function code(N)
	return Float64(1.0 / Float64(N / Float64(1.0 + Float64(Float64(-0.5 + Float64(0.3333333333333333 / N)) / N))))
end

MATLAB

function tmp = code(N)
	tmp = 1.0 / (N / (1.0 + ((-0.5 + (0.3333333333333333 / N)) / N)));
end

Wolfram

code[N_] := N[(1.0 / N[(N / N[(1.0 + N[(N[(-0.5 + N[(0.3333333333333333 / N), $MachinePrecision]), $MachinePrecision] / N), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 23.7%

   \[\log \left(N + 1\right) - \log N \]
2. Step-by-step derivation

   1. +-commutative 23.7%

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

   2. log1p-define 23.7%

      \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right)} - \log N \]

3. Simplified 23.7%

   \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right) - \log N} \]
4. Add Preprocessing

5. Taylor expanded in N around -inf 95.3%

   \[\leadsto \color{blue}{-1 \cdot \frac{-1 \cdot \frac{-1 \cdot \frac{0.25 \cdot \frac{1}{N} - 0.3333333333333333}{N} - 0.5}{N} - 1}{N}} \]
6. Step-by-step derivation

   1. associate-*r/ 95.3%

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

7. Simplified 95.3%

   \[\leadsto \color{blue}{\frac{1 + \frac{-0.5 + \frac{0.3333333333333333 + \frac{-0.25}{N}}{N}}{N}}{N}} \]
8. Step-by-step derivation

   1. clear-num 95.3%

      \[\leadsto \color{blue}{\frac{1}{\frac{N}{1 + \frac{-0.5 + \frac{0.3333333333333333 + \frac{-0.25}{N}}{N}}{N}}}} \]

   2. inv-pow 95.3%

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

   3. +-commutative 95.3%

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

9. Applied egg-rr 95.3%

   \[\leadsto \color{blue}{{\left(\frac{N}{1 + \frac{\frac{0.3333333333333333 + \frac{-0.25}{N}}{N} + -0.5}{N}}\right)}^{-1}} \]
10. Step-by-step derivation

    1. unpow-1 95.3%

       \[\leadsto \color{blue}{\frac{1}{\frac{N}{1 + \frac{\frac{0.3333333333333333 + \frac{-0.25}{N}}{N} + -0.5}{N}}}} \]

    2. +-commutative 95.3%

       \[\leadsto \frac{1}{\frac{N}{1 + \frac{\color{blue}{-0.5 + \frac{0.3333333333333333 + \frac{-0.25}{N}}{N}}}{N}}} \]

11. Simplified 95.3%

    \[\leadsto \color{blue}{\frac{1}{\frac{N}{1 + \frac{-0.5 + \frac{0.3333333333333333 + \frac{-0.25}{N}}{N}}{N}}}} \]

12. Taylor expanded in N around inf 93.9%

    \[\leadsto \frac{1}{\frac{N}{1 + \color{blue}{\frac{0.3333333333333333 \cdot \frac{1}{N} - 0.5}{N}}}} \]
13. Step-by-step derivation

    1. sub-neg 93.9%

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

    2. associate-*r/ 93.9%

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

    3. metadata-eval 93.9%

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

    4. metadata-eval 93.9%

       \[\leadsto \frac{1}{\frac{N}{1 + \frac{\frac{0.3333333333333333}{N} + \color{blue}{-0.5}}{N}}} \]

14. Simplified 93.9%

    \[\leadsto \frac{1}{\frac{N}{1 + \color{blue}{\frac{\frac{0.3333333333333333}{N} + -0.5}{N}}}} \]

15. Final simplification 93.9%

    \[\leadsto \frac{1}{\frac{N}{1 + \frac{-0.5 + \frac{0.3333333333333333}{N}}{N}}} \]
16. Add Preprocessing

Alternative 6: 94.8% accurate, 18.6× speedup

Math

\[\begin{array}{l} \\ \frac{1 + \frac{-0.5 + \frac{0.3333333333333333}{N}}{N}}{N} \end{array} \]

FPCore

(FPCore (N)
 :precision binary64
 (/ (+ 1.0 (/ (+ -0.5 (/ 0.3333333333333333 N)) N)) N))

C

double code(double N) {
	return (1.0 + ((-0.5 + (0.3333333333333333 / N)) / N)) / N;
}

Fortran

real(8) function code(n)
    real(8), intent (in) :: n
    code = (1.0d0 + (((-0.5d0) + (0.3333333333333333d0 / n)) / n)) / n
end function

Java

public static double code(double N) {
	return (1.0 + ((-0.5 + (0.3333333333333333 / N)) / N)) / N;
}

Python

def code(N):
	return (1.0 + ((-0.5 + (0.3333333333333333 / N)) / N)) / N

Julia

function code(N)
	return Float64(Float64(1.0 + Float64(Float64(-0.5 + Float64(0.3333333333333333 / N)) / N)) / N)
end

MATLAB

function tmp = code(N)
	tmp = (1.0 + ((-0.5 + (0.3333333333333333 / N)) / N)) / N;
end

Wolfram

code[N_] := N[(N[(1.0 + N[(N[(-0.5 + N[(0.3333333333333333 / N), $MachinePrecision]), $MachinePrecision] / N), $MachinePrecision]), $MachinePrecision] / N), $MachinePrecision]

Derivation

1. Initial program 23.7%

   \[\log \left(N + 1\right) - \log N \]
2. Step-by-step derivation

   1. +-commutative 23.7%

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

   2. log1p-define 23.7%

      \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right)} - \log N \]

3. Simplified 23.7%

   \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right) - \log N} \]
4. Add Preprocessing

5. Taylor expanded in N around inf 93.9%

   \[\leadsto \color{blue}{\frac{\left(1 + \frac{0.3333333333333333}{{N}^{2}}\right) - 0.5 \cdot \frac{1}{N}}{N}} \]
6. Step-by-step derivation

   1. sub-neg 93.9%

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

   2. associate-+l+ 93.9%

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

   3. sub-neg 93.9%

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

   4. unpow2 93.9%

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

   5. associate-/r* 93.9%

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

   6. metadata-eval 93.9%

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

   7. associate-*r/ 93.9%

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

   8. associate-*r/ 93.9%

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

   9. metadata-eval 93.9%

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

   10. div-sub 93.9%

       \[\leadsto \frac{1 + \color{blue}{\frac{0.3333333333333333 \cdot \frac{1}{N} - 0.5}{N}}}{N} \]

   11. sub-neg 93.9%

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

   12. metadata-eval 93.9%

       \[\leadsto \frac{1 + \frac{0.3333333333333333 \cdot \frac{1}{N} + \color{blue}{-0.5}}{N}}{N} \]

   13. +-commutative 93.9%

       \[\leadsto \frac{1 + \frac{\color{blue}{-0.5 + 0.3333333333333333 \cdot \frac{1}{N}}}{N}}{N} \]

   14. associate-*r/ 93.9%

       \[\leadsto \frac{1 + \frac{-0.5 + \color{blue}{\frac{0.3333333333333333 \cdot 1}{N}}}{N}}{N} \]

   15. metadata-eval 93.9%

       \[\leadsto \frac{1 + \frac{-0.5 + \frac{\color{blue}{0.3333333333333333}}{N}}{N}}{N} \]

7. Simplified 93.9%

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

Alternative 7: 92.2% accurate, 22.8× speedup

Math

\[\begin{array}{l} \\ \frac{1}{\frac{N}{1 + \frac{-0.5}{N}}} \end{array} \]

FPCore

(FPCore (N) :precision binary64 (/ 1.0 (/ N (+ 1.0 (/ -0.5 N)))))

C

double code(double N) {
	return 1.0 / (N / (1.0 + (-0.5 / N)));
}

Fortran

real(8) function code(n)
    real(8), intent (in) :: n
    code = 1.0d0 / (n / (1.0d0 + ((-0.5d0) / n)))
end function

Java

public static double code(double N) {
	return 1.0 / (N / (1.0 + (-0.5 / N)));
}

Python

def code(N):
	return 1.0 / (N / (1.0 + (-0.5 / N)))

Julia

function code(N)
	return Float64(1.0 / Float64(N / Float64(1.0 + Float64(-0.5 / N))))
end

MATLAB

function tmp = code(N)
	tmp = 1.0 / (N / (1.0 + (-0.5 / N)));
end

Wolfram

code[N_] := N[(1.0 / N[(N / N[(1.0 + N[(-0.5 / N), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 23.7%

   \[\log \left(N + 1\right) - \log N \]
2. Step-by-step derivation

   1. +-commutative 23.7%

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

   2. log1p-define 23.7%

      \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right)} - \log N \]

3. Simplified 23.7%

   \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right) - \log N} \]
4. Add Preprocessing

5. Taylor expanded in N around inf 91.4%

   \[\leadsto \color{blue}{\frac{1 - 0.5 \cdot \frac{1}{N}}{N}} \]
6. Step-by-step derivation

   1. associate-*r/ 91.4%

      \[\leadsto \frac{1 - \color{blue}{\frac{0.5 \cdot 1}{N}}}{N} \]

   2. metadata-eval 91.4%

      \[\leadsto \frac{1 - \frac{\color{blue}{0.5}}{N}}{N} \]

7. Simplified 91.4%

   \[\leadsto \color{blue}{\frac{1 - \frac{0.5}{N}}{N}} \]
8. Step-by-step derivation

   1. clear-num 91.4%

      \[\leadsto \color{blue}{\frac{1}{\frac{N}{1 - \frac{0.5}{N}}}} \]

   2. inv-pow 91.4%

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

   3. sub-neg 91.4%

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

   4. distribute-neg-frac 91.4%

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

   5. metadata-eval 91.4%

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

9. Applied egg-rr 91.4%

   \[\leadsto \color{blue}{{\left(\frac{N}{1 + \frac{-0.5}{N}}\right)}^{-1}} \]
10. Step-by-step derivation

    1. unpow-1 91.4%

       \[\leadsto \color{blue}{\frac{1}{\frac{N}{1 + \frac{-0.5}{N}}}} \]

11. Simplified 91.4%

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

Alternative 8: 92.1% accurate, 22.8× speedup

Math

\[\begin{array}{l} \\ \frac{1}{N} - \frac{\frac{0.5}{N}}{N} \end{array} \]

FPCore

(FPCore (N) :precision binary64 (- (/ 1.0 N) (/ (/ 0.5 N) N)))

C

double code(double N) {
	return (1.0 / N) - ((0.5 / N) / N);
}

Fortran

real(8) function code(n)
    real(8), intent (in) :: n
    code = (1.0d0 / n) - ((0.5d0 / n) / n)
end function

Java

public static double code(double N) {
	return (1.0 / N) - ((0.5 / N) / N);
}

Python

def code(N):
	return (1.0 / N) - ((0.5 / N) / N)

Julia

function code(N)
	return Float64(Float64(1.0 / N) - Float64(Float64(0.5 / N) / N))
end

MATLAB

function tmp = code(N)
	tmp = (1.0 / N) - ((0.5 / N) / N);
end

Wolfram

code[N_] := N[(N[(1.0 / N), $MachinePrecision] - N[(N[(0.5 / N), $MachinePrecision] / N), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 23.7%

   \[\log \left(N + 1\right) - \log N \]
2. Step-by-step derivation

   1. +-commutative 23.7%

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

   2. log1p-define 23.7%

      \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right)} - \log N \]

3. Simplified 23.7%

   \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right) - \log N} \]
4. Add Preprocessing

5. Taylor expanded in N around inf 91.4%

   \[\leadsto \color{blue}{\frac{1 - 0.5 \cdot \frac{1}{N}}{N}} \]
6. Step-by-step derivation

   1. associate-*r/ 91.4%

      \[\leadsto \frac{1 - \color{blue}{\frac{0.5 \cdot 1}{N}}}{N} \]

   2. metadata-eval 91.4%

      \[\leadsto \frac{1 - \frac{\color{blue}{0.5}}{N}}{N} \]

7. Simplified 91.4%

   \[\leadsto \color{blue}{\frac{1 - \frac{0.5}{N}}{N}} \]
8. Step-by-step derivation

   1. div-sub 91.4%

      \[\leadsto \color{blue}{\frac{1}{N} - \frac{\frac{0.5}{N}}{N}} \]

9. Applied egg-rr 91.4%

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

Alternative 9: 92.1% accurate, 29.3× speedup

Math

\[\begin{array}{l} \\ \frac{1 - \frac{0.5}{N}}{N} \end{array} \]

FPCore

(FPCore (N) :precision binary64 (/ (- 1.0 (/ 0.5 N)) N))

C

double code(double N) {
	return (1.0 - (0.5 / N)) / N;
}

Fortran

real(8) function code(n)
    real(8), intent (in) :: n
    code = (1.0d0 - (0.5d0 / n)) / n
end function

Java

public static double code(double N) {
	return (1.0 - (0.5 / N)) / N;
}

Python

def code(N):
	return (1.0 - (0.5 / N)) / N

Julia

function code(N)
	return Float64(Float64(1.0 - Float64(0.5 / N)) / N)
end

MATLAB

function tmp = code(N)
	tmp = (1.0 - (0.5 / N)) / N;
end

Wolfram

code[N_] := N[(N[(1.0 - N[(0.5 / N), $MachinePrecision]), $MachinePrecision] / N), $MachinePrecision]

Derivation

1. Initial program 23.7%

   \[\log \left(N + 1\right) - \log N \]
2. Step-by-step derivation

   1. +-commutative 23.7%

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

   2. log1p-define 23.7%

      \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right)} - \log N \]

3. Simplified 23.7%

   \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right) - \log N} \]
4. Add Preprocessing

5. Taylor expanded in N around inf 91.4%

   \[\leadsto \color{blue}{\frac{1 - 0.5 \cdot \frac{1}{N}}{N}} \]
6. Step-by-step derivation

   1. associate-*r/ 91.4%

      \[\leadsto \frac{1 - \color{blue}{\frac{0.5 \cdot 1}{N}}}{N} \]

   2. metadata-eval 91.4%

      \[\leadsto \frac{1 - \frac{\color{blue}{0.5}}{N}}{N} \]

7. Simplified 91.4%

   \[\leadsto \color{blue}{\frac{1 - \frac{0.5}{N}}{N}} \]
8. Add Preprocessing

Alternative 10: 84.2% accurate, 68.3× speedup

Math

\[\begin{array}{l} \\ \frac{1}{N} \end{array} \]

FPCore

(FPCore (N) :precision binary64 (/ 1.0 N))

C

double code(double N) {
	return 1.0 / N;
}

Fortran

real(8) function code(n)
    real(8), intent (in) :: n
    code = 1.0d0 / n
end function

Java

public static double code(double N) {
	return 1.0 / N;
}

Python

def code(N):
	return 1.0 / N

Julia

function code(N)
	return Float64(1.0 / N)
end

MATLAB

function tmp = code(N)
	tmp = 1.0 / N;
end

Wolfram

code[N_] := N[(1.0 / N), $MachinePrecision]

Derivation

1. Initial program 23.7%

   \[\log \left(N + 1\right) - \log N \]
2. Step-by-step derivation

   1. +-commutative 23.7%

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

   2. log1p-define 23.7%

      \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right)} - \log N \]

3. Simplified 23.7%

   \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right) - \log N} \]
4. Add Preprocessing

5. Taylor expanded in N around inf 84.6%

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

Alternative 11: 3.3% accurate, 205.0× speedup

Math

\[\begin{array}{l} \\ 0 \end{array} \]

FPCore

(FPCore (N) :precision binary64 0.0)

C

double code(double N) {
	return 0.0;
}

Fortran

real(8) function code(n)
    real(8), intent (in) :: n
    code = 0.0d0
end function

Java

public static double code(double N) {
	return 0.0;
}

Python

def code(N):
	return 0.0

Julia

function code(N)
	return 0.0
end

MATLAB

function tmp = code(N)
	tmp = 0.0;
end

Wolfram

code[N_] := 0.0

Derivation

1. Initial program 23.7%

   \[\log \left(N + 1\right) - \log N \]
2. Step-by-step derivation

   1. +-commutative 23.7%

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

   2. log1p-define 23.7%

      \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right)} - \log N \]

3. Simplified 23.7%

   \[\leadsto \color{blue}{\mathsf{log1p}\left(N\right) - \log N} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. sub-neg 23.7%

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

   2. +-commutative 23.7%

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

   3. add-sqr-sqrt 24.0%

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

   4. distribute-rgt-neg-in 24.0%

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

   5. fma-define 25.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\sqrt{\log N}, -\sqrt{\log N}, \mathsf{log1p}\left(N\right)\right)} \]

6. Applied egg-rr 25.1%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\sqrt{\log N}, -\sqrt{\log N}, \mathsf{log1p}\left(N\right)\right)} \]

7. Taylor expanded in N around inf 3.3%

   \[\leadsto \color{blue}{\log \left(\frac{1}{N}\right) + -1 \cdot \log \left(\frac{1}{N}\right)} \]
8. Step-by-step derivation

   1. distribute-rgt1-in 3.3%

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

   2. metadata-eval 3.3%

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

   3. mul0-lft 3.3%

      \[\leadsto \color{blue}{0} \]

9. Simplified 3.3%

   \[\leadsto \color{blue}{0} \]
10. Add Preprocessing

Developer target: 99.8% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \mathsf{log1p}\left(\frac{1}{N}\right) \end{array} \]

FPCore

(FPCore (N) :precision binary64 (log1p (/ 1.0 N)))

C

double code(double N) {
	return log1p((1.0 / N));
}

Java

public static double code(double N) {
	return Math.log1p((1.0 / N));
}

Python

def code(N):
	return math.log1p((1.0 / N))

Julia

function code(N)
	return log1p(Float64(1.0 / N))
end

Wolfram

code[N_] := N[Log[1 + N[(1.0 / N), $MachinePrecision]], $MachinePrecision]

Reproduce

herbie shell --seed 2024107 
(FPCore (N)
  :name "2log (problem 3.3.6)"
  :precision binary64
  :pre (and (> N 1.0) (< N 1e+40))

  :alt
  (log1p (/ 1.0 N))

  (- (log (+ N 1.0)) (log N)))