Average Error: 0.0 → 0.0
Time: 2.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 r102454 = re;
        double r102455 = exp(r102454);
        double r102456 = im;
        double r102457 = sin(r102456);
        double r102458 = r102455 * r102457;
        return r102458;
}
↓
double f(double re, double im) {
        double r102459 = re;
        double r102460 = exp(r102459);
        double r102461 = im;
        double r102462 = sin(r102461);
        double r102463 = r102460 * r102462;
        return r102463;
}

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