Average Error: 0.0 → 0.0
Time: 3.1s
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 r96592 = re;
        double r96593 = exp(r96592);
        double r96594 = im;
        double r96595 = sin(r96594);
        double r96596 = r96593 * r96595;
        return r96596;
}
↓
double f(double re, double im) {
        double r96597 = re;
        double r96598 = exp(r96597);
        double r96599 = im;
        double r96600 = sin(r96599);
        double r96601 = r96598 * r96600;
        return r96601;
}

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