Average Error: 0.0 → 0.0
Time: 2.5s
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 r37804 = re;
        double r37805 = exp(r37804);
        double r37806 = im;
        double r37807 = sin(r37806);
        double r37808 = r37805 * r37807;
        return r37808;
}
↓
double f(double re, double im) {
        double r37809 = re;
        double r37810 = exp(r37809);
        double r37811 = im;
        double r37812 = sin(r37811);
        double r37813 = r37810 * r37812;
        return r37813;
}

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