Average Error: 0.0 → 0.0
Time: 1.4s
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 r30123 = re;
        double r30124 = exp(r30123);
        double r30125 = im;
        double r30126 = sin(r30125);
        double r30127 = r30124 * r30126;
        return r30127;
}
↓
double f(double re, double im) {
        double r30128 = re;
        double r30129 = exp(r30128);
        double r30130 = im;
        double r30131 = sin(r30130);
        double r30132 = r30129 * r30131;
        return r30132;
}

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