Average Error: 0.0 → 0.0
Time: 2.5s
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 r49189 = re;
        double r49190 = exp(r49189);
        double r49191 = im;
        double r49192 = cos(r49191);
        double r49193 = r49190 * r49192;
        return r49193;
}
↓
double f(double re, double im) {
        double r49194 = re;
        double r49195 = exp(r49194);
        double r49196 = im;
        double r49197 = cos(r49196);
        double r49198 = r49195 * r49197;
        return r49198;
}

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