Average Error: 0.1 → 0.1
Time: 604.0ms
Precision: binary64
\[\frac{1}{x} + \frac{1}{x \cdot x}\]
↓
\[\frac{1}{x} + \frac{1}{x \cdot x}\]
\frac{1}{x} + \frac{1}{x \cdot x}
↓
\frac{1}{x} + \frac{1}{x \cdot x}
double code(double x) {
	return ((double) (((double) (1.0 / x)) + ((double) (1.0 / ((double) (x * x))))));
}
↓
double code(double x) {
	return ((double) (((double) (1.0 / x)) + ((double) (1.0 / ((double) (x * x))))));
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[\frac{1}{x} + \frac{1}{x \cdot x}\]

  2. Final simplification0.1

    \[\leadsto \frac{1}{x} + \frac{1}{x \cdot x}\]

Reproduce

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