Average Error: 0.0 → 0.0
Time: 3.1s
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 r107513 = re;
        double r107514 = exp(r107513);
        double r107515 = im;
        double r107516 = sin(r107515);
        double r107517 = r107514 * r107516;
        return r107517;
}
↓
double f(double re, double im) {
        double r107518 = re;
        double r107519 = exp(r107518);
        double r107520 = im;
        double r107521 = sin(r107520);
        double r107522 = r107519 * r107521;
        return r107522;
}

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