Average Error: 0.0 → 0.0
Time: 2.7s
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 r44786 = re;
        double r44787 = exp(r44786);
        double r44788 = im;
        double r44789 = sin(r44788);
        double r44790 = r44787 * r44789;
        return r44790;
}
↓
double f(double re, double im) {
        double r44791 = re;
        double r44792 = exp(r44791);
        double r44793 = im;
        double r44794 = sin(r44793);
        double r44795 = r44792 * r44794;
        return r44795;
}

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