Average Error: 0.0 → 0.0
Time: 3.5s
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 r111505 = re;
        double r111506 = exp(r111505);
        double r111507 = im;
        double r111508 = sin(r111507);
        double r111509 = r111506 * r111508;
        return r111509;
}
↓
double f(double re, double im) {
        double r111510 = re;
        double r111511 = exp(r111510);
        double r111512 = im;
        double r111513 = sin(r111512);
        double r111514 = r111511 * r111513;
        return r111514;
}

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