Average Error: 0.0 → 0.0
Time: 14.1s
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 r52655 = re;
        double r52656 = exp(r52655);
        double r52657 = im;
        double r52658 = cos(r52657);
        double r52659 = r52656 * r52658;
        return r52659;
}
↓
double f(double re, double im) {
        double r52660 = re;
        double r52661 = exp(r52660);
        double r52662 = im;
        double r52663 = cos(r52662);
        double r52664 = r52661 * r52663;
        return r52664;
}

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