Average Error: 0.0 → 0.0
Time: 2.3s
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 r47815 = re;
        double r47816 = exp(r47815);
        double r47817 = im;
        double r47818 = sin(r47817);
        double r47819 = r47816 * r47818;
        return r47819;
}
↓
double f(double re, double im) {
        double r47820 = re;
        double r47821 = exp(r47820);
        double r47822 = im;
        double r47823 = sin(r47822);
        double r47824 = r47821 * r47823;
        return r47824;
}

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