Average Error: 0.0 → 0.0
Time: 3.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 r94496 = re;
        double r94497 = exp(r94496);
        double r94498 = im;
        double r94499 = cos(r94498);
        double r94500 = r94497 * r94499;
        return r94500;
}
↓
double f(double re, double im) {
        double r94501 = re;
        double r94502 = exp(r94501);
        double r94503 = im;
        double r94504 = cos(r94503);
        double r94505 = r94502 * r94504;
        return r94505;
}

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