Average Error: 0.0 → 0.0
Time: 3.1s
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 r8607 = re;
        double r8608 = exp(r8607);
        double r8609 = im;
        double r8610 = cos(r8609);
        double r8611 = r8608 * r8610;
        return r8611;
}
↓
double f(double re, double im) {
        double r8612 = re;
        double r8613 = exp(r8612);
        double r8614 = im;
        double r8615 = cos(r8614);
        double r8616 = r8613 * r8615;
        return r8616;
}

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