Average Error: 0.0 → 0.0
Time: 3.0s
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 r44722 = re;
        double r44723 = exp(r44722);
        double r44724 = im;
        double r44725 = sin(r44724);
        double r44726 = r44723 * r44725;
        return r44726;
}
↓
double f(double re, double im) {
        double r44727 = re;
        double r44728 = exp(r44727);
        double r44729 = im;
        double r44730 = sin(r44729);
        double r44731 = r44728 * r44730;
        return r44731;
}

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