Average Error: 0.0 → 0.0
Time: 5.4s
Precision: 64
\[e^{re} \cdot \cos im\]
↓
\[e^{re} \cdot \cos im\]
e^{re} \cdot \cos im
↓
e^{re} \cdot \cos im
double f(double re, double im) {
        double r38284 = re;
        double r38285 = exp(r38284);
        double r38286 = im;
        double r38287 = cos(r38286);
        double r38288 = r38285 * r38287;
        return r38288;
}
↓
double f(double re, double im) {
        double r38289 = re;
        double r38290 = exp(r38289);
        double r38291 = im;
        double r38292 = cos(r38291);
        double r38293 = r38290 * r38292;
        return r38293;
}

Error

Bits error versus re

Bits error versus im

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[e^{re} \cdot \cos im\]

  2. Final simplification0.0

    \[\leadsto e^{re} \cdot \cos im\]

Reproduce

herbie shell --seed 2019294 
(FPCore (re im)
  :name "math.exp on complex, real part"
  :precision binary64
  (* (exp re) (cos im)))