Average Error: 0.0 → 0.0
Time: 1.9s
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 r50966 = re;
        double r50967 = exp(r50966);
        double r50968 = im;
        double r50969 = cos(r50968);
        double r50970 = r50967 * r50969;
        return r50970;
}
↓
double f(double re, double im) {
        double r50971 = re;
        double r50972 = exp(r50971);
        double r50973 = im;
        double r50974 = cos(r50973);
        double r50975 = r50972 * r50974;
        return r50975;
}

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