Average Error: 0.0 → 0.0
Time: 1.9s
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 r95365 = re;
        double r95366 = exp(r95365);
        double r95367 = im;
        double r95368 = cos(r95367);
        double r95369 = r95366 * r95368;
        return r95369;
}
↓
double f(double re, double im) {
        double r95370 = re;
        double r95371 = exp(r95370);
        double r95372 = im;
        double r95373 = cos(r95372);
        double r95374 = r95371 * r95373;
        return r95374;
}

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