Average Error: 0.0 → 0.0
Time: 2.8s
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 r36969 = re;
        double r36970 = exp(r36969);
        double r36971 = im;
        double r36972 = sin(r36971);
        double r36973 = r36970 * r36972;
        return r36973;
}
↓
double f(double re, double im) {
        double r36974 = re;
        double r36975 = exp(r36974);
        double r36976 = im;
        double r36977 = sin(r36976);
        double r36978 = r36975 * r36977;
        return r36978;
}

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