Average Error: 0.0 → 0.0
Time: 2.9s
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 r88562 = re;
        double r88563 = exp(r88562);
        double r88564 = im;
        double r88565 = sin(r88564);
        double r88566 = r88563 * r88565;
        return r88566;
}
↓
double f(double re, double im) {
        double r88567 = re;
        double r88568 = exp(r88567);
        double r88569 = im;
        double r88570 = sin(r88569);
        double r88571 = r88568 * r88570;
        return r88571;
}

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