Average Error: 0.0 → 0.0
Time: 3.2s
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 r64676 = re;
        double r64677 = exp(r64676);
        double r64678 = im;
        double r64679 = sin(r64678);
        double r64680 = r64677 * r64679;
        return r64680;
}
↓
double f(double re, double im) {
        double r64681 = re;
        double r64682 = exp(r64681);
        double r64683 = im;
        double r64684 = sin(r64683);
        double r64685 = r64682 * r64684;
        return r64685;
}

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