Average Error: 0.0 → 0.0
Time: 13.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 r34506 = re;
        double r34507 = exp(r34506);
        double r34508 = im;
        double r34509 = sin(r34508);
        double r34510 = r34507 * r34509;
        return r34510;
}
↓
double f(double re, double im) {
        double r34511 = re;
        double r34512 = exp(r34511);
        double r34513 = im;
        double r34514 = sin(r34513);
        double r34515 = r34512 * r34514;
        return r34515;
}

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