Average Error: 0.0 → 0.0
Time: 12.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 r29327 = re;
        double r29328 = exp(r29327);
        double r29329 = im;
        double r29330 = cos(r29329);
        double r29331 = r29328 * r29330;
        return r29331;
}
↓
double f(double re, double im) {
        double r29332 = re;
        double r29333 = exp(r29332);
        double r29334 = im;
        double r29335 = cos(r29334);
        double r29336 = r29333 * r29335;
        return r29336;
}

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