Average Error: 0.0 → 0.0
Time: 8.1s
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 r34809 = re;
        double r34810 = exp(r34809);
        double r34811 = im;
        double r34812 = cos(r34811);
        double r34813 = r34810 * r34812;
        return r34813;
}
↓
double f(double re, double im) {
        double r34814 = re;
        double r34815 = exp(r34814);
        double r34816 = im;
        double r34817 = cos(r34816);
        double r34818 = r34815 * r34817;
        return r34818;
}

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