Average Error: 0.0 → 0.0
Time: 2.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 r60446 = re;
        double r60447 = exp(r60446);
        double r60448 = im;
        double r60449 = cos(r60448);
        double r60450 = r60447 * r60449;
        return r60450;
}
↓
double f(double re, double im) {
        double r60451 = re;
        double r60452 = exp(r60451);
        double r60453 = im;
        double r60454 = cos(r60453);
        double r60455 = r60452 * r60454;
        return r60455;
}

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