Average Error: 4.3 → 4.3
Time: 1.3s
Precision: binary64
\[\frac{29}{40 \cdot {n}^{\left(\frac{1}{5}\right)}}\]
↓
\[\frac{29}{40 \cdot {n}^{\left(\frac{1}{5}\right)}}\]
\frac{29}{40 \cdot {n}^{\left(\frac{1}{5}\right)}}
↓
\frac{29}{40 \cdot {n}^{\left(\frac{1}{5}\right)}}
double code(double n) {
	return ((double) (29.0 / ((double) (40.0 * ((double) pow(n, ((double) (1.0 / 5.0))))))));
}
↓
double code(double n) {
	return ((double) (29.0 / ((double) (40.0 * ((double) pow(n, ((double) (1.0 / 5.0))))))));
}

Error

Bits error versus n

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 4.3

    \[\frac{29}{40 \cdot {n}^{\left(\frac{1}{5}\right)}}\]

  2. Final simplification4.3

    \[\leadsto \frac{29}{40 \cdot {n}^{\left(\frac{1}{5}\right)}}\]

Reproduce

herbie shell --seed 2020152 
(FPCore (n)
  :name "(/ 29 (* 40 (pow n (/ 1 5))))"
  :precision binary64
  (/ 29.0 (* 40.0 (pow n (/ 1.0 5.0)))))