Average Error: 0.0 → 0.0
Time: 2.2s
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 r40441 = re;
        double r40442 = exp(r40441);
        double r40443 = im;
        double r40444 = cos(r40443);
        double r40445 = r40442 * r40444;
        return r40445;
}
↓
double f(double re, double im) {
        double r40446 = re;
        double r40447 = exp(r40446);
        double r40448 = im;
        double r40449 = cos(r40448);
        double r40450 = r40447 * r40449;
        return r40450;
}

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