Average Error: 0.0 → 0.0
Time: 1.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 r37953 = re;
        double r37954 = exp(r37953);
        double r37955 = im;
        double r37956 = cos(r37955);
        double r37957 = r37954 * r37956;
        return r37957;
}
↓
double f(double re, double im) {
        double r37958 = re;
        double r37959 = exp(r37958);
        double r37960 = im;
        double r37961 = cos(r37960);
        double r37962 = r37959 * r37961;
        return r37962;
}

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