Average Error: 0.0 → 0.0
Time: 7.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 r36986 = re;
        double r36987 = exp(r36986);
        double r36988 = im;
        double r36989 = cos(r36988);
        double r36990 = r36987 * r36989;
        return r36990;
}
↓
double f(double re, double im) {
        double r36991 = re;
        double r36992 = exp(r36991);
        double r36993 = im;
        double r36994 = cos(r36993);
        double r36995 = r36992 * r36994;
        return r36995;
}

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