Average Error: 0.0 → 0.0
Time: 2.0s
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 r34985 = re;
        double r34986 = exp(r34985);
        double r34987 = im;
        double r34988 = cos(r34987);
        double r34989 = r34986 * r34988;
        return r34989;
}
↓
double f(double re, double im) {
        double r34990 = re;
        double r34991 = exp(r34990);
        double r34992 = im;
        double r34993 = cos(r34992);
        double r34994 = r34991 * r34993;
        return r34994;
}

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