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 r28841 = re;
        double r28842 = exp(r28841);
        double r28843 = im;
        double r28844 = cos(r28843);
        double r28845 = r28842 * r28844;
        return r28845;
}
↓
double f(double re, double im) {
        double r28846 = re;
        double r28847 = exp(r28846);
        double r28848 = im;
        double r28849 = cos(r28848);
        double r28850 = r28847 * r28849;
        return r28850;
}

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)))