Average Error: 0.0 → 0.0
Time: 2.6s
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 r44882 = re;
        double r44883 = exp(r44882);
        double r44884 = im;
        double r44885 = cos(r44884);
        double r44886 = r44883 * r44885;
        return r44886;
}
↓
double f(double re, double im) {
        double r44887 = re;
        double r44888 = exp(r44887);
        double r44889 = im;
        double r44890 = cos(r44889);
        double r44891 = r44888 * r44890;
        return r44891;
}

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