Average Error: 0.0 → 0.0
Time: 17.2s
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 r29242 = re;
        double r29243 = exp(r29242);
        double r29244 = im;
        double r29245 = sin(r29244);
        double r29246 = r29243 * r29245;
        return r29246;
}
↓
double f(double re, double im) {
        double r29247 = re;
        double r29248 = exp(r29247);
        double r29249 = im;
        double r29250 = sin(r29249);
        double r29251 = r29248 * r29250;
        return r29251;
}

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)))