Average Error: 0.0 → 0.0
Time: 2.3s
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 r89891 = re;
        double r89892 = exp(r89891);
        double r89893 = im;
        double r89894 = cos(r89893);
        double r89895 = r89892 * r89894;
        return r89895;
}
↓
double f(double re, double im) {
        double r89896 = re;
        double r89897 = exp(r89896);
        double r89898 = im;
        double r89899 = cos(r89898);
        double r89900 = r89897 * r89899;
        return r89900;
}

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