Average Error: 0.0 → 0.0
Time: 3.5s
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 r99845 = re;
        double r99846 = exp(r99845);
        double r99847 = im;
        double r99848 = sin(r99847);
        double r99849 = r99846 * r99848;
        return r99849;
}
↓
double f(double re, double im) {
        double r99850 = re;
        double r99851 = exp(r99850);
        double r99852 = im;
        double r99853 = sin(r99852);
        double r99854 = r99851 * r99853;
        return r99854;
}

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