2frac (problem 3.3.1)

Average Error: 14.7 → 0.1

Time: 4.6s

Precision: binary64

Cost: 448

Math

\[\frac{1}{x + 1} - \frac{1}{x} \]

↓

\[\frac{\frac{-1}{1 + x}}{x} \]

FPCore

(FPCore (x) :precision binary64 (- (/ 1.0 (+ x 1.0)) (/ 1.0 x)))

↓

(FPCore (x) :precision binary64 (/ (/ -1.0 (+ 1.0 x)) x))

C

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

↓

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

Fortran

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

↓

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

Java

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

↓

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

Python

def code(x):
	return (1.0 / (x + 1.0)) - (1.0 / x)

↓

def code(x):
	return (-1.0 / (1.0 + x)) / x

Julia

function code(x)
	return Float64(Float64(1.0 / Float64(x + 1.0)) - Float64(1.0 / x))
end

↓

function code(x)
	return Float64(Float64(-1.0 / Float64(1.0 + x)) / x)
end

MATLAB

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

↓

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

Wolfram

code[x_] := N[(N[(1.0 / N[(x + 1.0), $MachinePrecision]), $MachinePrecision] - N[(1.0 / x), $MachinePrecision]), $MachinePrecision]

↓

code[x_] := N[(N[(-1.0 / N[(1.0 + x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]

Derivation

1. Initial program 14.7

   \[\frac{1}{x + 1} - \frac{1}{x} \]

2. Applied egg-rr 14.1

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

3. Taylor expanded in x around 0 0.1

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

4. Final simplification 0.1

   \[\leadsto \frac{\frac{-1}{1 + x}}{x} \]

Alternatives

Alternative 1
Error	2.0
Cost	584

\[\begin{array}{l} t_0 := \frac{-1}{x \cdot x}\\ \mathbf{if}\;x \leq -291147832.0563465:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq 4.792282004356962 \cdot 10^{-13}:\\ \;\;\;\;\frac{-1 + x}{x}\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 2
Error	2.0
Cost	584

\[\begin{array}{l} t_0 := \frac{-1}{x \cdot x}\\ \mathbf{if}\;x \leq -291147832.0563465:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq 4.792282004356962 \cdot 10^{-13}:\\ \;\;\;\;1 + \frac{-1}{x}\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 3
Error	1.9
Cost	584

\[\begin{array}{l} \mathbf{if}\;x \leq -291147832.0563465:\\ \;\;\;\;\frac{-1}{x \cdot x}\\ \mathbf{elif}\;x \leq 4.792282004356962 \cdot 10^{-13}:\\ \;\;\;\;1 + \frac{-1}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{-1}{x}}{x}\\ \end{array} \]

Alternative 4
Error	30.7
Cost	192

\[\frac{-1}{x} \]

Alternative 5
Error	62.0
Cost	128

\[-x \]

Alternative 6
Error	62.1
Cost	64

\[1 \]

Reproduce

herbie shell --seed 2022317 
(FPCore (x)
  :name "2frac (problem 3.3.1)"
  :precision binary64
  (- (/ 1.0 (+ x 1.0)) (/ 1.0 x)))