Average Error: 0.0 → 0.0
Time: 1.3s
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 r38770 = re;
        double r38771 = exp(r38770);
        double r38772 = im;
        double r38773 = cos(r38772);
        double r38774 = r38771 * r38773;
        return r38774;
}
↓
double f(double re, double im) {
        double r38775 = re;
        double r38776 = exp(r38775);
        double r38777 = im;
        double r38778 = cos(r38777);
        double r38779 = r38776 * r38778;
        return r38779;
}

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