Average Error: 0.0 → 0.0
Time: 12.9s
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 r52644 = re;
        double r52645 = exp(r52644);
        double r52646 = im;
        double r52647 = sin(r52646);
        double r52648 = r52645 * r52647;
        return r52648;
}
↓
double f(double re, double im) {
        double r52649 = re;
        double r52650 = exp(r52649);
        double r52651 = im;
        double r52652 = sin(r52651);
        double r52653 = r52650 * r52652;
        return r52653;
}

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