Average Error: 0.0 → 0.0
Time: 2.0s
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 r35491 = re;
        double r35492 = exp(r35491);
        double r35493 = im;
        double r35494 = cos(r35493);
        double r35495 = r35492 * r35494;
        return r35495;
}
↓
double f(double re, double im) {
        double r35496 = re;
        double r35497 = exp(r35496);
        double r35498 = im;
        double r35499 = cos(r35498);
        double r35500 = r35497 * r35499;
        return r35500;
}

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