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

Error

Bits error versus p

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.5

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

  2. Final simplification0.5

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

Reproduce

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