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 r36852 = re;
        double r36853 = exp(r36852);
        double r36854 = im;
        double r36855 = sin(r36854);
        double r36856 = r36853 * r36855;
        return r36856;
}
↓
double f(double re, double im) {
        double r36857 = re;
        double r36858 = exp(r36857);
        double r36859 = im;
        double r36860 = sin(r36859);
        double r36861 = r36858 * r36860;
        return r36861;
}

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