Average Error: 0.0 → 0.0
Time: 1.4s
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 r51413 = re;
        double r51414 = exp(r51413);
        double r51415 = im;
        double r51416 = cos(r51415);
        double r51417 = r51414 * r51416;
        return r51417;
}
↓
double f(double re, double im) {
        double r51418 = re;
        double r51419 = exp(r51418);
        double r51420 = im;
        double r51421 = cos(r51420);
        double r51422 = r51419 * r51421;
        return r51422;
}

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