2-ancestry mixing, zero discriminant

Average Error: 15.4 → 0.8

Time: 4.0s

Precision: binary64

Cost: 13120

Math

\[\sqrt[3]{\frac{g}{2 \cdot a}} \]

↓

\[\frac{\sqrt[3]{g}}{\sqrt[3]{2 \cdot a}} \]

FPCore

(FPCore (g a) :precision binary64 (cbrt (/ g (* 2.0 a))))

↓

(FPCore (g a) :precision binary64 (/ (cbrt g) (cbrt (* 2.0 a))))

C

double code(double g, double a) {
	return cbrt((g / (2.0 * a)));
}

↓

double code(double g, double a) {
	return cbrt(g) / cbrt((2.0 * a));
}

Java

public static double code(double g, double a) {
	return Math.cbrt((g / (2.0 * a)));
}

↓

public static double code(double g, double a) {
	return Math.cbrt(g) / Math.cbrt((2.0 * a));
}

Julia

function code(g, a)
	return cbrt(Float64(g / Float64(2.0 * a)))
end

↓

function code(g, a)
	return Float64(cbrt(g) / cbrt(Float64(2.0 * a)))
end

Wolfram

code[g_, a_] := N[Power[N[(g / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision]

↓

code[g_, a_] := N[(N[Power[g, 1/3], $MachinePrecision] / N[Power[N[(2.0 * a), $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 15.4

   \[\sqrt[3]{\frac{g}{2 \cdot a}} \]

2. Applied egg-rr 0.8

   \[\leadsto \color{blue}{\frac{\sqrt[3]{g}}{\sqrt[3]{2 \cdot a}}} \]

3. Final simplification 0.8

   \[\leadsto \frac{\sqrt[3]{g}}{\sqrt[3]{2 \cdot a}} \]

Alternatives

Alternative 1
Error	0.8
Cost	13120

\[\sqrt[3]{g} \cdot \sqrt[3]{\frac{0.5}{a}} \]

Alternative 2
Error	15.4
Cost	6848

\[\frac{1}{\sqrt[3]{\frac{2 \cdot a}{g}}} \]

Alternative 3
Error	15.4
Cost	6720

\[\sqrt[3]{g \cdot \frac{0.5}{a}} \]

Reproduce

herbie shell --seed 2022321 
(FPCore (g a)
  :name "2-ancestry mixing, zero discriminant"
  :precision binary64
  (cbrt (/ g (* 2.0 a))))