Average Error: 0.0 → 0.0
Time: 3.7s
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 r43613 = re;
        double r43614 = exp(r43613);
        double r43615 = im;
        double r43616 = sin(r43615);
        double r43617 = r43614 * r43616;
        return r43617;
}
↓
double f(double re, double im) {
        double r43618 = re;
        double r43619 = exp(r43618);
        double r43620 = im;
        double r43621 = sin(r43620);
        double r43622 = r43619 * r43621;
        return r43622;
}

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