Average Error: 0.0 → 0.0
Time: 21.3s
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 r35391 = re;
        double r35392 = exp(r35391);
        double r35393 = im;
        double r35394 = sin(r35393);
        double r35395 = r35392 * r35394;
        return r35395;
}
↓
double f(double re, double im) {
        double r35396 = re;
        double r35397 = exp(r35396);
        double r35398 = im;
        double r35399 = sin(r35398);
        double r35400 = r35397 * r35399;
        return r35400;
}

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