Average Error: 3.8 → 3.8
Time: 1.3s
Precision: binary64
\[\left(p + \frac{inflow}{lam}\right) - \frac{outflow \cdot p}{lam}\]
↓
\[\left(p + \frac{inflow}{lam}\right) - \frac{outflow \cdot p}{lam}\]
\left(p + \frac{inflow}{lam}\right) - \frac{outflow \cdot p}{lam}
↓
\left(p + \frac{inflow}{lam}\right) - \frac{outflow \cdot p}{lam}
double code(double p, double inflow, double lam, double outflow) {
	return ((double) (((double) (p + ((double) (inflow / lam)))) - ((double) (((double) (outflow * p)) / lam))));
}
↓
double code(double p, double inflow, double lam, double outflow) {
	return ((double) (((double) (p + ((double) (inflow / lam)))) - ((double) (((double) (outflow * p)) / lam))));
}

Error

Bits error versus p

Bits error versus inflow

Bits error versus lam

Bits error versus outflow

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 3.8

    \[\left(p + \frac{inflow}{lam}\right) - \frac{outflow \cdot p}{lam}\]

  2. Final simplification3.8

    \[\leadsto \left(p + \frac{inflow}{lam}\right) - \frac{outflow \cdot p}{lam}\]

Reproduce

herbie shell --seed 2020152 
(FPCore (p inflow lam outflow)
  :name "(- (+ p (/ inflow lam)) (/ (* outflow p) lam))"
  :precision binary64
  (- (+ p (/ inflow lam)) (/ (* outflow p) lam)))