Average Error: 0.0 → 0.0
Time: 2.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 r51486 = re;
        double r51487 = exp(r51486);
        double r51488 = im;
        double r51489 = cos(r51488);
        double r51490 = r51487 * r51489;
        return r51490;
}
↓
double f(double re, double im) {
        double r51491 = re;
        double r51492 = exp(r51491);
        double r51493 = im;
        double r51494 = cos(r51493);
        double r51495 = r51492 * r51494;
        return r51495;
}

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