Average Error: 0.0 → 0.0
Time: 3.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 r98784 = re;
        double r98785 = exp(r98784);
        double r98786 = im;
        double r98787 = sin(r98786);
        double r98788 = r98785 * r98787;
        return r98788;
}
↓
double f(double re, double im) {
        double r98789 = re;
        double r98790 = exp(r98789);
        double r98791 = im;
        double r98792 = sin(r98791);
        double r98793 = r98790 * r98792;
        return r98793;
}

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