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 r27667 = re;
        double r27668 = exp(r27667);
        double r27669 = im;
        double r27670 = cos(r27669);
        double r27671 = r27668 * r27670;
        return r27671;
}
↓
double f(double re, double im) {
        double r27672 = re;
        double r27673 = exp(r27672);
        double r27674 = im;
        double r27675 = cos(r27674);
        double r27676 = r27673 * r27675;
        return r27676;
}

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