Average Error: 0.0 → 0.0
Time: 2.6s
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 r43557 = re;
        double r43558 = exp(r43557);
        double r43559 = im;
        double r43560 = sin(r43559);
        double r43561 = r43558 * r43560;
        return r43561;
}
↓
double f(double re, double im) {
        double r43562 = re;
        double r43563 = exp(r43562);
        double r43564 = im;
        double r43565 = sin(r43564);
        double r43566 = r43563 * r43565;
        return r43566;
}

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