Average Error: 0.0 → 0.0
Time: 17.6s
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 r42833 = re;
        double r42834 = exp(r42833);
        double r42835 = im;
        double r42836 = sin(r42835);
        double r42837 = r42834 * r42836;
        return r42837;
}
↓
double f(double re, double im) {
        double r42838 = re;
        double r42839 = exp(r42838);
        double r42840 = im;
        double r42841 = sin(r42840);
        double r42842 = r42839 * r42841;
        return r42842;
}

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