Average Error: 0.0 → 0.0
Time: 3.2s
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 r103997 = re;
        double r103998 = exp(r103997);
        double r103999 = im;
        double r104000 = cos(r103999);
        double r104001 = r103998 * r104000;
        return r104001;
}
↓
double f(double re, double im) {
        double r104002 = re;
        double r104003 = exp(r104002);
        double r104004 = im;
        double r104005 = cos(r104004);
        double r104006 = r104003 * r104005;
        return r104006;
}

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