Average Error: 0.0 → 0.0
Time: 3.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 r49978 = re;
        double r49979 = exp(r49978);
        double r49980 = im;
        double r49981 = sin(r49980);
        double r49982 = r49979 * r49981;
        return r49982;
}
↓
double f(double re, double im) {
        double r49983 = re;
        double r49984 = exp(r49983);
        double r49985 = im;
        double r49986 = sin(r49985);
        double r49987 = r49984 * r49986;
        return r49987;
}

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