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 r90098 = re;
        double r90099 = exp(r90098);
        double r90100 = im;
        double r90101 = cos(r90100);
        double r90102 = r90099 * r90101;
        return r90102;
}
↓
double f(double re, double im) {
        double r90103 = re;
        double r90104 = exp(r90103);
        double r90105 = im;
        double r90106 = cos(r90105);
        double r90107 = r90104 * r90106;
        return r90107;
}

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