Average Error: 42.7 → 42.7
Time: 1.2s
Precision: binary64
\[{\left(\left(x \cdot x\right) \cdot x\right)}^{\left(\frac{1}{3}\right)}\]
↓
\[{\left(\left(x \cdot x\right) \cdot x\right)}^{\left(\frac{1}{3}\right)}\]
{\left(\left(x \cdot x\right) \cdot x\right)}^{\left(\frac{1}{3}\right)}
↓
{\left(\left(x \cdot x\right) \cdot x\right)}^{\left(\frac{1}{3}\right)}
double code(double x) {
	return ((double) pow(((double) (((double) (x * x)) * x)), ((double) (1.0 / 3.0))));
}
↓
double code(double x) {
	return ((double) pow(((double) (((double) (x * x)) * x)), ((double) (1.0 / 3.0))));
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 42.7

    \[{\left(\left(x \cdot x\right) \cdot x\right)}^{\left(\frac{1}{3}\right)}\]

  2. Final simplification42.7

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

Reproduce

herbie shell --seed 2020153 
(FPCore (x)
  :name "(pow (* (* x x) x) (/ 1 3))"
  :precision binary64
  (pow (* (* x x) x) (/ 1.0 3.0)))