Average Error: 0.0 → 0.0
Time: 16.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 r26605 = re;
        double r26606 = exp(r26605);
        double r26607 = im;
        double r26608 = sin(r26607);
        double r26609 = r26606 * r26608;
        return r26609;
}
↓
double f(double re, double im) {
        double r26610 = re;
        double r26611 = exp(r26610);
        double r26612 = im;
        double r26613 = sin(r26612);
        double r26614 = r26611 * r26613;
        return r26614;
}

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