Average Error: 0.0 → 0.0
Time: 12.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 r43607 = re;
        double r43608 = exp(r43607);
        double r43609 = im;
        double r43610 = sin(r43609);
        double r43611 = r43608 * r43610;
        return r43611;
}
↓
double f(double re, double im) {
        double r43612 = re;
        double r43613 = exp(r43612);
        double r43614 = im;
        double r43615 = sin(r43614);
        double r43616 = r43613 * r43615;
        return r43616;
}

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