Average Error: 0.0 → 0.0
Time: 3.2s
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 r47601 = re;
        double r47602 = exp(r47601);
        double r47603 = im;
        double r47604 = sin(r47603);
        double r47605 = r47602 * r47604;
        return r47605;
}
↓
double f(double re, double im) {
        double r47606 = re;
        double r47607 = exp(r47606);
        double r47608 = im;
        double r47609 = sin(r47608);
        double r47610 = r47607 * r47609;
        return r47610;
}

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