Average Error: 0.0 → 0.0
Time: 3.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 r34062 = re;
        double r34063 = exp(r34062);
        double r34064 = im;
        double r34065 = cos(r34064);
        double r34066 = r34063 * r34065;
        return r34066;
}
↓
double f(double re, double im) {
        double r34067 = re;
        double r34068 = exp(r34067);
        double r34069 = im;
        double r34070 = cos(r34069);
        double r34071 = r34068 * r34070;
        return r34071;
}

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