Average Error: 0.0 → 0.0
Time: 2.8s
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 r48415 = re;
        double r48416 = exp(r48415);
        double r48417 = im;
        double r48418 = sin(r48417);
        double r48419 = r48416 * r48418;
        return r48419;
}
↓
double f(double re, double im) {
        double r48420 = re;
        double r48421 = exp(r48420);
        double r48422 = im;
        double r48423 = sin(r48422);
        double r48424 = r48421 * r48423;
        return r48424;
}

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