Average Error: 0.0 → 0.0
Time: 1.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 r23767 = re;
        double r23768 = exp(r23767);
        double r23769 = im;
        double r23770 = cos(r23769);
        double r23771 = r23768 * r23770;
        return r23771;
}
↓
double f(double re, double im) {
        double r23772 = re;
        double r23773 = exp(r23772);
        double r23774 = im;
        double r23775 = cos(r23774);
        double r23776 = r23773 * r23775;
        return r23776;
}

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