Average Error: 0.0 → 0.0
Time: 9.4s
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 r26897 = re;
        double r26898 = exp(r26897);
        double r26899 = im;
        double r26900 = cos(r26899);
        double r26901 = r26898 * r26900;
        return r26901;
}
↓
double f(double re, double im) {
        double r26902 = re;
        double r26903 = exp(r26902);
        double r26904 = im;
        double r26905 = cos(r26904);
        double r26906 = r26903 * r26905;
        return r26906;
}

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