Average Error: 0.0 → 0.0
Time: 3.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 r42315 = re;
        double r42316 = exp(r42315);
        double r42317 = im;
        double r42318 = cos(r42317);
        double r42319 = r42316 * r42318;
        return r42319;
}
↓
double f(double re, double im) {
        double r42320 = re;
        double r42321 = exp(r42320);
        double r42322 = im;
        double r42323 = cos(r42322);
        double r42324 = r42321 * r42323;
        return r42324;
}

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