Average Error: 0.0 → 0.0
Time: 3.6s
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 r62120 = re;
        double r62121 = exp(r62120);
        double r62122 = im;
        double r62123 = sin(r62122);
        double r62124 = r62121 * r62123;
        return r62124;
}
↓
double f(double re, double im) {
        double r62125 = re;
        double r62126 = exp(r62125);
        double r62127 = im;
        double r62128 = sin(r62127);
        double r62129 = r62126 * r62128;
        return r62129;
}

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