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 r31712 = re;
        double r31713 = exp(r31712);
        double r31714 = im;
        double r31715 = sin(r31714);
        double r31716 = r31713 * r31715;
        return r31716;
}
↓
double f(double re, double im) {
        double r31717 = re;
        double r31718 = exp(r31717);
        double r31719 = im;
        double r31720 = sin(r31719);
        double r31721 = r31718 * r31720;
        return r31721;
}

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