Average Error: 0.0 → 0.0
Time: 2.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 r47828 = re;
        double r47829 = exp(r47828);
        double r47830 = im;
        double r47831 = sin(r47830);
        double r47832 = r47829 * r47831;
        return r47832;
}
↓
double f(double re, double im) {
        double r47833 = re;
        double r47834 = exp(r47833);
        double r47835 = im;
        double r47836 = sin(r47835);
        double r47837 = r47834 * r47836;
        return r47837;
}

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)))