Average Error: 29.7 → 0.5
Time: 8.4s
Precision: binary64
Cost: 32896
\[\sqrt[3]{x + 1} - \sqrt[3]{x} \]
↓
\[\begin{array}{l} t_0 := \sqrt[3]{1 + x}\\ \frac{1}{{t_0}^{2} + \sqrt[3]{x} \cdot \left(t_0 + \sqrt[3]{x}\right)} \end{array} \]
(FPCore (x) :precision binary64 (- (cbrt (+ x 1.0)) (cbrt x)))
↓
(FPCore (x)
 :precision binary64
 (let* ((t_0 (cbrt (+ 1.0 x))))
   (/ 1.0 (+ (pow t_0 2.0) (* (cbrt x) (+ t_0 (cbrt x)))))))
double code(double x) {
	return cbrt((x + 1.0)) - cbrt(x);
}
↓
double code(double x) {
	double t_0 = cbrt((1.0 + x));
	return 1.0 / (pow(t_0, 2.0) + (cbrt(x) * (t_0 + cbrt(x))));
}

public static double code(double x) {
	return Math.cbrt((x + 1.0)) - Math.cbrt(x);
}
↓
public static double code(double x) {
	double t_0 = Math.cbrt((1.0 + x));
	return 1.0 / (Math.pow(t_0, 2.0) + (Math.cbrt(x) * (t_0 + Math.cbrt(x))));
}

function code(x)
	return Float64(cbrt(Float64(x + 1.0)) - cbrt(x))
end
↓
function code(x)
	t_0 = cbrt(Float64(1.0 + x))
	return Float64(1.0 / Float64((t_0 ^ 2.0) + Float64(cbrt(x) * Float64(t_0 + cbrt(x)))))
end

code[x_] := N[(N[Power[N[(x + 1.0), $MachinePrecision], 1/3], $MachinePrecision] - N[Power[x, 1/3], $MachinePrecision]), $MachinePrecision]
↓
code[x_] := Block[{t$95$0 = N[Power[N[(1.0 + x), $MachinePrecision], 1/3], $MachinePrecision]}, N[(1.0 / N[(N[Power[t$95$0, 2.0], $MachinePrecision] + N[(N[Power[x, 1/3], $MachinePrecision] * N[(t$95$0 + N[Power[x, 1/3], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

\sqrt[3]{x + 1} - \sqrt[3]{x}
↓
\begin{array}{l}
t_0 := \sqrt[3]{1 + x}\\
\frac{1}{{t_0}^{2} + \sqrt[3]{x} \cdot \left(t_0 + \sqrt[3]{x}\right)}
\end{array}

Error

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 29.7

    \[\sqrt[3]{x + 1} - \sqrt[3]{x} \]

  2. Applied egg-rr29.0

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

  3. Taylor expanded in x around 0 0.5

    \[\leadsto \frac{\color{blue}{1}}{{\left(\sqrt[3]{x + 1}\right)}^{2} + \sqrt[3]{x} \cdot \left(\sqrt[3]{x + 1} + \sqrt[3]{x}\right)} \]

  4. Final simplification0.5

    \[\leadsto \frac{1}{{\left(\sqrt[3]{1 + x}\right)}^{2} + \sqrt[3]{x} \cdot \left(\sqrt[3]{1 + x} + \sqrt[3]{x}\right)} \]

Alternatives

Alternative 1
Error25.6
Cost39364
\[\begin{array}{l} t_0 := \sqrt[3]{1 + x}\\ \mathbf{if}\;t_0 - \sqrt[3]{x} \leq 0:\\ \;\;\;\;\frac{1}{{t_0}^{2} + \sqrt[3]{x}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt[3]{\mathsf{fma}\left(x, x, -1\right)}}{\sqrt[3]{x + -1}} - \sqrt[3]{x}\\ \end{array} \]
Alternative 2
Error14.7
Cost33028
\[\begin{array}{l} t_0 := \sqrt[3]{1 + x}\\ \mathbf{if}\;x \leq -5.702088076441556 \cdot 10^{+159}:\\ \;\;\;\;\frac{1}{{t_0}^{2} + \sqrt[3]{x}}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\sqrt[3]{x} \cdot \left(t_0 + \sqrt[3]{x}\right) + \sqrt[3]{{\left(1 + x\right)}^{2}}}\\ \end{array} \]
Alternative 3
Error25.6
Cost19976
\[\begin{array}{l} t_0 := \sqrt[3]{1 + x}\\ t_1 := \frac{1}{{t_0}^{2} + \sqrt[3]{x}}\\ \mathbf{if}\;x \leq -125841791574572240:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 84117115384042.34:\\ \;\;\;\;t_0 - \sqrt[3]{x}\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]
Alternative 4
Error29.7
Cost13120
\[\sqrt[3]{1 + x} - \sqrt[3]{x} \]
Alternative 5
Error31.4
Cost6592
\[1 - \sqrt[3]{x} \]
Alternative 6
Error61.7
Cost64
\[0 \]
Alternative 7
Error31.9
Cost64
\[1 \]

Error

Reproduce

herbie shell --seed 2022318 
(FPCore (x)
  :name "2cbrt (problem 3.3.4)"
  :precision binary64
  (- (cbrt (+ x 1.0)) (cbrt x)))