Average Error: 0.0 → 0.0
Time: 15.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 r30283 = re;
        double r30284 = exp(r30283);
        double r30285 = im;
        double r30286 = cos(r30285);
        double r30287 = r30284 * r30286;
        return r30287;
}
↓
double f(double re, double im) {
        double r30288 = re;
        double r30289 = exp(r30288);
        double r30290 = im;
        double r30291 = cos(r30290);
        double r30292 = r30289 * r30291;
        return r30292;
}

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