Average Error: 0.0 → 0.0
Time: 2.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 r36275 = re;
        double r36276 = exp(r36275);
        double r36277 = im;
        double r36278 = cos(r36277);
        double r36279 = r36276 * r36278;
        return r36279;
}
↓
double f(double re, double im) {
        double r36280 = re;
        double r36281 = exp(r36280);
        double r36282 = im;
        double r36283 = cos(r36282);
        double r36284 = r36281 * r36283;
        return r36284;
}

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