Average Error: 0.0 → 0.0
Time: 2.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 r43633 = re;
        double r43634 = exp(r43633);
        double r43635 = im;
        double r43636 = cos(r43635);
        double r43637 = r43634 * r43636;
        return r43637;
}
↓
double f(double re, double im) {
        double r43638 = re;
        double r43639 = exp(r43638);
        double r43640 = im;
        double r43641 = cos(r43640);
        double r43642 = r43639 * r43641;
        return r43642;
}

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