Average Error: 0.0 → 0.0
Time: 2.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 r39619 = re;
        double r39620 = exp(r39619);
        double r39621 = im;
        double r39622 = sin(r39621);
        double r39623 = r39620 * r39622;
        return r39623;
}
↓
double f(double re, double im) {
        double r39624 = re;
        double r39625 = exp(r39624);
        double r39626 = im;
        double r39627 = sin(r39626);
        double r39628 = r39625 * r39627;
        return r39628;
}

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