Average Error: 0.0 → 0.0
Time: 2.4s
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 r103788 = re;
        double r103789 = exp(r103788);
        double r103790 = im;
        double r103791 = sin(r103790);
        double r103792 = r103789 * r103791;
        return r103792;
}
↓
double f(double re, double im) {
        double r103793 = re;
        double r103794 = exp(r103793);
        double r103795 = im;
        double r103796 = sin(r103795);
        double r103797 = r103794 * r103796;
        return r103797;
}

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