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 r35962 = re;
        double r35963 = exp(r35962);
        double r35964 = im;
        double r35965 = cos(r35964);
        double r35966 = r35963 * r35965;
        return r35966;
}
↓
double f(double re, double im) {
        double r35967 = re;
        double r35968 = exp(r35967);
        double r35969 = im;
        double r35970 = cos(r35969);
        double r35971 = r35968 * r35970;
        return r35971;
}

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