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 r35219 = re;
        double r35220 = exp(r35219);
        double r35221 = im;
        double r35222 = cos(r35221);
        double r35223 = r35220 * r35222;
        return r35223;
}
↓
double f(double re, double im) {
        double r35224 = re;
        double r35225 = exp(r35224);
        double r35226 = im;
        double r35227 = cos(r35226);
        double r35228 = r35225 * r35227;
        return r35228;
}

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