Average Error: 0.0 → 0.0
Time: 1.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 r92580 = re;
        double r92581 = exp(r92580);
        double r92582 = im;
        double r92583 = cos(r92582);
        double r92584 = r92581 * r92583;
        return r92584;
}
↓
double f(double re, double im) {
        double r92585 = re;
        double r92586 = exp(r92585);
        double r92587 = im;
        double r92588 = cos(r92587);
        double r92589 = r92586 * r92588;
        return r92589;
}

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