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 r36962 = re;
        double r36963 = exp(r36962);
        double r36964 = im;
        double r36965 = sin(r36964);
        double r36966 = r36963 * r36965;
        return r36966;
}
↓
double f(double re, double im) {
        double r36967 = re;
        double r36968 = exp(r36967);
        double r36969 = im;
        double r36970 = sin(r36969);
        double r36971 = r36968 * r36970;
        return r36971;
}

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)))