logs (example 3.8)

Average Error: 63.0 → 0.0

Time: 5.1s

Precision: binary64

Cost: 6656

\[n > 6.8 \cdot 10^{+15}\]

Math

\[\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1 \]

↓

\[-\log \left(\frac{1}{n}\right) \]

FPCore

(FPCore (n)
 :precision binary64
 (- (- (* (+ n 1.0) (log (+ n 1.0))) (* n (log n))) 1.0))

↓

(FPCore (n) :precision binary64 (- (log (/ 1.0 n))))

C

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

↓

double code(double n) {
	return -log((1.0 / n));
}

Fortran

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

↓

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

Java

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

↓

public static double code(double n) {
	return -Math.log((1.0 / n));
}

Python

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

↓

def code(n):
	return -math.log((1.0 / n))

Julia

function code(n)
	return Float64(Float64(Float64(Float64(n + 1.0) * log(Float64(n + 1.0))) - Float64(n * log(n))) - 1.0)
end

↓

function code(n)
	return Float64(-log(Float64(1.0 / n)))
end

MATLAB

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

↓

function tmp = code(n)
	tmp = -log((1.0 / n));
end

Wolfram

code[n_] := N[(N[(N[(N[(n + 1.0), $MachinePrecision] * N[Log[N[(n + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(n * N[Log[n], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]

↓

code[n_] := (-N[Log[N[(1.0 / n), $MachinePrecision]], $MachinePrecision])

Target

Original	63.0
Target	0
Herbie	0.0

\[\log \left(n + 1\right) - \left(\frac{1}{2 \cdot n} - \left(\frac{1}{3 \cdot \left(n \cdot n\right)} - \frac{4}{{n}^{3}}\right)\right) \]

Derivation

1. Initial program 63.0

   \[\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1 \]

2. Simplified 62.0

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

   [Start] 63.0	\[ \left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1 \]
   rational_best_45_simplify-70 [=>] 62.0	\[ \color{blue}{\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - 1\right) - n \cdot \log n} \]
   rational_best_45_simplify-56 [=>] 62.0	\[ \color{blue}{\left(\left(n + 1\right) \cdot \log \left(n + 1\right) + -1\right)} - n \cdot \log n \]
   rational_best_45_simplify-73 [=>] 62.0	\[ \color{blue}{\left(-1 + \left(n + 1\right) \cdot \log \left(n + 1\right)\right)} - n \cdot \log n \]
   rational_best_45_simplify-109 [=>] 62.0	\[ \color{blue}{\left(n + 1\right) \cdot \log \left(n + 1\right) + \left(-1 - n \cdot \log n\right)} \]

3. Taylor expanded in n around inf 0.0

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

4. Simplified 0.0

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

   [Start] 0.0	\[ -1 \cdot \log \left(\frac{1}{n}\right) \]
   rational_best_45_simplify-91 [=>] 0.0	\[ \color{blue}{\log \left(\frac{1}{n}\right) \cdot -1} \]
   rational_best_45_simplify-16 [=>] 0.0	\[ \color{blue}{-\log \left(\frac{1}{n}\right)} \]

5. Final simplification 0.0

   \[\leadsto -\log \left(\frac{1}{n}\right) \]

Alternatives

Alternative 1
Error	62.0
Cost	64

\[0 \]

Reproduce

herbie shell --seed 2023098 
(FPCore (n)
  :name "logs (example 3.8)"
  :precision binary64
  :pre (> n 6.8e+15)

  :herbie-target
  (- (log (+ n 1.0)) (- (/ 1.0 (* 2.0 n)) (- (/ 1.0 (* 3.0 (* n n))) (/ 4.0 (pow n 3.0)))))

  (- (- (* (+ n 1.0) (log (+ n 1.0))) (* n (log n))) 1.0))