Average Error: 0.0 → 0.0
Time: 2.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 r52389 = re;
        double r52390 = exp(r52389);
        double r52391 = im;
        double r52392 = cos(r52391);
        double r52393 = r52390 * r52392;
        return r52393;
}
↓
double f(double re, double im) {
        double r52394 = re;
        double r52395 = exp(r52394);
        double r52396 = im;
        double r52397 = cos(r52396);
        double r52398 = r52395 * r52397;
        return r52398;
}

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 2020027 
(FPCore (re im)
  :name "math.exp on complex, real part"
  :precision binary64
  (* (exp re) (cos im)))