Average Error: 0.0 → 0.0
Time: 4.0s
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 r88414 = re;
        double r88415 = exp(r88414);
        double r88416 = im;
        double r88417 = sin(r88416);
        double r88418 = r88415 * r88417;
        return r88418;
}
↓
double f(double re, double im) {
        double r88419 = re;
        double r88420 = exp(r88419);
        double r88421 = im;
        double r88422 = sin(r88421);
        double r88423 = r88420 * r88422;
        return r88423;
}

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