Average Error: 0.0 → 0.0
Time: 1.5s
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 r95079 = re;
        double r95080 = exp(r95079);
        double r95081 = im;
        double r95082 = cos(r95081);
        double r95083 = r95080 * r95082;
        return r95083;
}
↓
double f(double re, double im) {
        double r95084 = re;
        double r95085 = exp(r95084);
        double r95086 = im;
        double r95087 = cos(r95086);
        double r95088 = r95085 * r95087;
        return r95088;
}

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