Average Error: 0.0 → 0.0
Time: 13.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 r31199 = re;
        double r31200 = exp(r31199);
        double r31201 = im;
        double r31202 = sin(r31201);
        double r31203 = r31200 * r31202;
        return r31203;
}
↓
double f(double re, double im) {
        double r31204 = re;
        double r31205 = exp(r31204);
        double r31206 = im;
        double r31207 = sin(r31206);
        double r31208 = r31205 * r31207;
        return r31208;
}

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