Average Error: 12.5 → 12.5
Time: 1.5s
Precision: binary64
\[\frac{1}{{\left(n - 1\right)}^{2}} - \frac{1}{{n}^{2}}\]
↓
\[\frac{1}{{\left(n - 1\right)}^{2}} - \frac{1}{{n}^{2}}\]
\frac{1}{{\left(n - 1\right)}^{2}} - \frac{1}{{n}^{2}}
↓
\frac{1}{{\left(n - 1\right)}^{2}} - \frac{1}{{n}^{2}}
double code(double n) {
	return ((double) (((double) (1.0 / ((double) pow(((double) (n - 1.0)), 2.0)))) - ((double) (1.0 / ((double) pow(n, 2.0))))));
}
↓
double code(double n) {
	return ((double) (((double) (1.0 / ((double) pow(((double) (n - 1.0)), 2.0)))) - ((double) (1.0 / ((double) pow(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 12.5

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

  2. Final simplification12.5

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

Reproduce

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