Average Error: 0.0 → 0.0
Time: 3.0s
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 r38811 = re;
        double r38812 = exp(r38811);
        double r38813 = im;
        double r38814 = cos(r38813);
        double r38815 = r38812 * r38814;
        return r38815;
}
↓
double f(double re, double im) {
        double r38816 = re;
        double r38817 = exp(r38816);
        double r38818 = im;
        double r38819 = cos(r38818);
        double r38820 = r38817 * r38819;
        return r38820;
}

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