Average Error: 0.0 → 0.0
Time: 2.6s
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 r52089 = re;
        double r52090 = exp(r52089);
        double r52091 = im;
        double r52092 = cos(r52091);
        double r52093 = r52090 * r52092;
        return r52093;
}
↓
double f(double re, double im) {
        double r52094 = re;
        double r52095 = exp(r52094);
        double r52096 = im;
        double r52097 = cos(r52096);
        double r52098 = r52095 * r52097;
        return r52098;
}

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