Average Error: 0.0 → 0.0
Time: 1.3s
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 r26081 = re;
        double r26082 = exp(r26081);
        double r26083 = im;
        double r26084 = cos(r26083);
        double r26085 = r26082 * r26084;
        return r26085;
}
↓
double f(double re, double im) {
        double r26086 = re;
        double r26087 = exp(r26086);
        double r26088 = im;
        double r26089 = cos(r26088);
        double r26090 = r26087 * r26089;
        return r26090;
}

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