Average Error: 0.0 → 0.0
Time: 43.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 r40783 = re;
        double r40784 = exp(r40783);
        double r40785 = im;
        double r40786 = sin(r40785);
        double r40787 = r40784 * r40786;
        return r40787;
}
↓
double f(double re, double im) {
        double r40788 = re;
        double r40789 = exp(r40788);
        double r40790 = im;
        double r40791 = sin(r40790);
        double r40792 = r40789 * r40791;
        return r40792;
}

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