Average Error: 0.0 → 0.0
Time: 3.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 r43131 = re;
        double r43132 = exp(r43131);
        double r43133 = im;
        double r43134 = sin(r43133);
        double r43135 = r43132 * r43134;
        return r43135;
}
↓
double f(double re, double im) {
        double r43136 = re;
        double r43137 = exp(r43136);
        double r43138 = im;
        double r43139 = sin(r43138);
        double r43140 = r43137 * r43139;
        return r43140;
}

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