Average Error: 0.0 → 0.0
Time: 2.9s
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 r119767 = re;
        double r119768 = exp(r119767);
        double r119769 = im;
        double r119770 = sin(r119769);
        double r119771 = r119768 * r119770;
        return r119771;
}
↓
double f(double re, double im) {
        double r119772 = re;
        double r119773 = exp(r119772);
        double r119774 = im;
        double r119775 = sin(r119774);
        double r119776 = r119773 * r119775;
        return r119776;
}

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