Average Error: 0.1 → 0.1
Time: 2.2s
Precision: binary64
\[xi - \frac{{xi}^{n} - x}{n \cdot xi}\]
↓
\[xi - \frac{{xi}^{n} - x}{n \cdot xi}\]
xi - \frac{{xi}^{n} - x}{n \cdot xi}
↓
xi - \frac{{xi}^{n} - x}{n \cdot xi}
double code(double xi, double n, double x) {
	return ((double) (xi - ((double) (((double) (((double) pow(xi, n)) - x)) / ((double) (n * xi))))));
}
↓
double code(double xi, double n, double x) {
	return ((double) (xi - ((double) (((double) (((double) pow(xi, n)) - x)) / ((double) (n * xi))))));
}

Error

Bits error versus xi

Bits error versus n

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[xi - \frac{{xi}^{n} - x}{n \cdot xi}\]

  2. Final simplification0.1

    \[\leadsto xi - \frac{{xi}^{n} - x}{n \cdot xi}\]

Reproduce

herbie shell --seed 2020153 
(FPCore (xi n x)
  :name "(- xi (/ (- (pow xi n) x) (* n xi)))"
  :precision binary64
  (- xi (/ (- (pow xi n) x) (* n xi))))