Average Error: 0.0 → 0.0
Time: 2.0s
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 r33664 = re;
        double r33665 = exp(r33664);
        double r33666 = im;
        double r33667 = cos(r33666);
        double r33668 = r33665 * r33667;
        return r33668;
}
↓
double f(double re, double im) {
        double r33669 = re;
        double r33670 = exp(r33669);
        double r33671 = im;
        double r33672 = cos(r33671);
        double r33673 = r33670 * r33672;
        return r33673;
}

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