Average Error: 0.0 → 0.0
Time: 2.3s
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 r36245 = re;
        double r36246 = exp(r36245);
        double r36247 = im;
        double r36248 = cos(r36247);
        double r36249 = r36246 * r36248;
        return r36249;
}
↓
double f(double re, double im) {
        double r36250 = re;
        double r36251 = exp(r36250);
        double r36252 = im;
        double r36253 = cos(r36252);
        double r36254 = r36251 * r36253;
        return r36254;
}

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