Average Error: 0.0 → 0.0
Time: 1.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 r35420 = re;
        double r35421 = exp(r35420);
        double r35422 = im;
        double r35423 = sin(r35422);
        double r35424 = r35421 * r35423;
        return r35424;
}
↓
double f(double re, double im) {
        double r35425 = re;
        double r35426 = exp(r35425);
        double r35427 = im;
        double r35428 = sin(r35427);
        double r35429 = r35426 * r35428;
        return r35429;
}

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)))