Average Error: 0.0 → 0.0
Time: 7.5s
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 r38911 = re;
        double r38912 = exp(r38911);
        double r38913 = im;
        double r38914 = cos(r38913);
        double r38915 = r38912 * r38914;
        return r38915;
}
↓
double f(double re, double im) {
        double r38916 = re;
        double r38917 = exp(r38916);
        double r38918 = im;
        double r38919 = cos(r38918);
        double r38920 = r38917 * r38919;
        return r38920;
}

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