Average Error: 0.0 → 0.0
Time: 456.0ms
Precision: binary64
\[\left(x \cdot x\right) \cdot 2 - 1\]
↓
\[\left(x \cdot x\right) \cdot 2 - 1\]
\left(x \cdot x\right) \cdot 2 - 1
↓
\left(x \cdot x\right) \cdot 2 - 1
(FPCore (x) :precision binary64 (- (* (* x x) 2.0) 1.0))
↓
(FPCore (x) :precision binary64 (- (* (* x x) 2.0) 1.0))
double code(double x) {
	return ((double) (((double) (((double) (x * x)) * 2.0)) - 1.0));
}
↓
double code(double x) {
	return ((double) (((double) (((double) (x * x)) * 2.0)) - 1.0));
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program Error: 0.0 bits

    \[\left(x \cdot x\right) \cdot 2 - 1\]

  2. Final simplificationError: 0.0 bits

    \[\leadsto \left(x \cdot x\right) \cdot 2 - 1\]

Reproduce

herbie shell --seed 2020204 
(FPCore (x)
  :name "Numeric.SpecFunctions:logGammaCorrection from math-functions-0.1.5.2"
  :precision binary64
  (- (* (* x x) 2.0) 1.0))