Average Error: 0.0 → 0.0
Time: 1.4s
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 r43651 = re;
        double r43652 = exp(r43651);
        double r43653 = im;
        double r43654 = sin(r43653);
        double r43655 = r43652 * r43654;
        return r43655;
}
↓
double f(double re, double im) {
        double r43656 = re;
        double r43657 = exp(r43656);
        double r43658 = im;
        double r43659 = sin(r43658);
        double r43660 = r43657 * r43659;
        return r43660;
}

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