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 r58693 = re;
        double r58694 = exp(r58693);
        double r58695 = im;
        double r58696 = cos(r58695);
        double r58697 = r58694 * r58696;
        return r58697;
}
↓
double f(double re, double im) {
        double r58698 = re;
        double r58699 = exp(r58698);
        double r58700 = im;
        double r58701 = cos(r58700);
        double r58702 = r58699 * r58701;
        return r58702;
}

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