Average Error: 0.0 → 0.0
Time: 2.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 r54976 = re;
        double r54977 = exp(r54976);
        double r54978 = im;
        double r54979 = cos(r54978);
        double r54980 = r54977 * r54979;
        return r54980;
}
↓
double f(double re, double im) {
        double r54981 = re;
        double r54982 = exp(r54981);
        double r54983 = im;
        double r54984 = cos(r54983);
        double r54985 = r54982 * r54984;
        return r54985;
}

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)))