Average Error: 0.0 → 0.0
Time: 6.1s
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 r39718 = re;
        double r39719 = exp(r39718);
        double r39720 = im;
        double r39721 = sin(r39720);
        double r39722 = r39719 * r39721;
        return r39722;
}
↓
double f(double re, double im) {
        double r39723 = re;
        double r39724 = exp(r39723);
        double r39725 = im;
        double r39726 = sin(r39725);
        double r39727 = r39724 * r39726;
        return r39727;
}

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