Average Error: 0.4 → 0.3
Time: 7.6s
Precision: binary64
\[\]
\[\]
↓
\[\]
↓
double code(double u1, double u2) {
	return (((1.0 / 6.0) * pow((-2.0 * log(u1)), 0.5)) * cos((2.0 * ((double) M_PI)) * u2)) + 0.5;
}

↓
double code(double u1, double u2) {
	return 0.5 + ((1.0 * (pow((-2.0 * log(u1)), 0.5) / 6.0)) * cos((2.0 * ((double) M_PI)) * u2));
}

Error
Bits error versus u1
Bits error versus u2
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 0.4
    \[\]
  2. Using strategy rm
  3. Applied div-inv0.4
    \[\leadsto \]
  4. Applied associate-*l*0.4
    \[\leadsto \]
  5. Simplified0.3
    \[\leadsto \]
  6. Final simplification0.3
    \[\leadsto \]
Reproduce
herbie shell --seed 2020338 
(FPCore (u1 u2)
  :name "normal distribution"
  :precision binary64
  :pre (and (<= 0.0 u1 1.0) (<= 0.0 u2 1.0))
  (+ (* (* (/ 1.0 6.0) (pow (* -2.0 (log u1)) 0.5)) (cos (* (* 2.0 PI) u2))) 0.5))