Average Error: 0.0 → 0.0
Time: 2.7s
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 r40893 = re;
        double r40894 = exp(r40893);
        double r40895 = im;
        double r40896 = cos(r40895);
        double r40897 = r40894 * r40896;
        return r40897;
}
↓
double f(double re, double im) {
        double r40898 = re;
        double r40899 = exp(r40898);
        double r40900 = im;
        double r40901 = cos(r40900);
        double r40902 = r40899 * r40901;
        return r40902;
}

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