Average Error: 0.0 → 0.0
Time: 3.5s
Precision: 64
\[e^{re} \cdot \sin im\]
↓
\[e^{re} \cdot \sin im\]
e^{re} \cdot \sin im
↓
e^{re} \cdot \sin im
double f(double re, double im) {
        double r101229 = re;
        double r101230 = exp(r101229);
        double r101231 = im;
        double r101232 = sin(r101231);
        double r101233 = r101230 * r101232;
        return r101233;
}
↓
double f(double re, double im) {
        double r101234 = re;
        double r101235 = exp(r101234);
        double r101236 = im;
        double r101237 = sin(r101236);
        double r101238 = r101235 * r101237;
        return r101238;
}

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 \sin im\]

  2. Final simplification0.0

    \[\leadsto e^{re} \cdot \sin im\]

Reproduce

herbie shell --seed 2020025 
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  :precision binary64
  (* (exp re) (sin im)))