Average Error: 0.0 → 0.0
Time: 3.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 r25689 = re;
        double r25690 = exp(r25689);
        double r25691 = im;
        double r25692 = cos(r25691);
        double r25693 = r25690 * r25692;
        return r25693;
}
↓
double f(double re, double im) {
        double r25694 = re;
        double r25695 = exp(r25694);
        double r25696 = im;
        double r25697 = cos(r25696);
        double r25698 = r25695 * r25697;
        return r25698;
}

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