Average Error: 16.1 → 16.1
Time: 742.0ms
Precision: binary64
\[\frac{{n}^{2}}{\left(n - 1\right) \cdot \left(n - 2\right)}\]
↓
\[\frac{{n}^{2}}{\left(n - 1\right) \cdot \left(n - 2\right)}\]
\frac{{n}^{2}}{\left(n - 1\right) \cdot \left(n - 2\right)}
↓
\frac{{n}^{2}}{\left(n - 1\right) \cdot \left(n - 2\right)}
double code(double n) {
	return ((double) (((double) pow(n, 2.0)) / ((double) (((double) (n - 1.0)) * ((double) (n - 2.0))))));
}
↓
double code(double n) {
	return ((double) (((double) pow(n, 2.0)) / ((double) (((double) (n - 1.0)) * ((double) (n - 2.0))))));
}

Error

Bits error versus n

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 16.1

    \[\frac{{n}^{2}}{\left(n - 1\right) \cdot \left(n - 2\right)}\]

  2. Final simplification16.1

    \[\leadsto \frac{{n}^{2}}{\left(n - 1\right) \cdot \left(n - 2\right)}\]

Reproduce

herbie shell --seed 2020152 
(FPCore (n)
  :name "(/ (pow n 2) (* (- n 1) (- n 2)))"
  :precision binary64
  (/ (pow n 2.0) (* (- n 1.0) (- n 2.0))))