Average Error: 0.0 → 0.0
Time: 16.7s
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 r29231 = re;
        double r29232 = exp(r29231);
        double r29233 = im;
        double r29234 = sin(r29233);
        double r29235 = r29232 * r29234;
        return r29235;
}
↓
double f(double re, double im) {
        double r29236 = re;
        double r29237 = exp(r29236);
        double r29238 = im;
        double r29239 = sin(r29238);
        double r29240 = r29237 * r29239;
        return r29240;
}

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