Average Error: 0.0 → 0.0
Time: 1.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 r87614 = re;
        double r87615 = exp(r87614);
        double r87616 = im;
        double r87617 = cos(r87616);
        double r87618 = r87615 * r87617;
        return r87618;
}
↓
double f(double re, double im) {
        double r87619 = re;
        double r87620 = exp(r87619);
        double r87621 = im;
        double r87622 = cos(r87621);
        double r87623 = r87620 * r87622;
        return r87623;
}

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