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 r28831 = re;
        double r28832 = exp(r28831);
        double r28833 = im;
        double r28834 = cos(r28833);
        double r28835 = r28832 * r28834;
        return r28835;
}
↓
double f(double re, double im) {
        double r28836 = re;
        double r28837 = exp(r28836);
        double r28838 = im;
        double r28839 = cos(r28838);
        double r28840 = r28837 * r28839;
        return r28840;
}

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