Average Error: 0.0 → 0.0
Time: 7.4s
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 r50987 = re;
        double r50988 = exp(r50987);
        double r50989 = im;
        double r50990 = cos(r50989);
        double r50991 = r50988 * r50990;
        return r50991;
}
↓
double f(double re, double im) {
        double r50992 = re;
        double r50993 = exp(r50992);
        double r50994 = im;
        double r50995 = cos(r50994);
        double r50996 = r50993 * r50995;
        return r50996;
}

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