Average Error: 0.0 → 0.0
Time: 14.1s
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 r24897 = re;
        double r24898 = exp(r24897);
        double r24899 = im;
        double r24900 = cos(r24899);
        double r24901 = r24898 * r24900;
        return r24901;
}
↓
double f(double re, double im) {
        double r24902 = re;
        double r24903 = exp(r24902);
        double r24904 = im;
        double r24905 = cos(r24904);
        double r24906 = r24903 * r24905;
        return r24906;
}

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