Average Error: 0.0 → 0.0
Time: 8.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 r26925 = re;
        double r26926 = exp(r26925);
        double r26927 = im;
        double r26928 = cos(r26927);
        double r26929 = r26926 * r26928;
        return r26929;
}
↓
double f(double re, double im) {
        double r26930 = re;
        double r26931 = exp(r26930);
        double r26932 = im;
        double r26933 = cos(r26932);
        double r26934 = r26931 * r26933;
        return r26934;
}

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