Average Error: 0.0 → 0.0
Time: 2.2s
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 r41143 = re;
        double r41144 = exp(r41143);
        double r41145 = im;
        double r41146 = cos(r41145);
        double r41147 = r41144 * r41146;
        return r41147;
}
↓
double f(double re, double im) {
        double r41148 = re;
        double r41149 = exp(r41148);
        double r41150 = im;
        double r41151 = cos(r41150);
        double r41152 = r41149 * r41151;
        return r41152;
}

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