Average Error: 0.0 → 0.0
Time: 2.2s
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 r87833 = re;
        double r87834 = exp(r87833);
        double r87835 = im;
        double r87836 = cos(r87835);
        double r87837 = r87834 * r87836;
        return r87837;
}
↓
double f(double re, double im) {
        double r87838 = re;
        double r87839 = exp(r87838);
        double r87840 = im;
        double r87841 = cos(r87840);
        double r87842 = r87839 * r87841;
        return r87842;
}

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