Average Error: 0.0 → 0.0
Time: 1.7s
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 r85532 = re;
        double r85533 = exp(r85532);
        double r85534 = im;
        double r85535 = sin(r85534);
        double r85536 = r85533 * r85535;
        return r85536;
}
↓
double f(double re, double im) {
        double r85537 = re;
        double r85538 = exp(r85537);
        double r85539 = im;
        double r85540 = sin(r85539);
        double r85541 = r85538 * r85540;
        return r85541;
}

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