Average Error: 0.0 → 0.0
Time: 5.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 r53998 = re;
        double r53999 = exp(r53998);
        double r54000 = im;
        double r54001 = sin(r54000);
        double r54002 = r53999 * r54001;
        return r54002;
}
↓
double f(double re, double im) {
        double r54003 = re;
        double r54004 = exp(r54003);
        double r54005 = im;
        double r54006 = sin(r54005);
        double r54007 = r54004 * r54006;
        return r54007;
}

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