Average Error: 0.0 → 0.0
Time: 13.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 r31063 = re;
        double r31064 = exp(r31063);
        double r31065 = im;
        double r31066 = sin(r31065);
        double r31067 = r31064 * r31066;
        return r31067;
}
↓
double f(double re, double im) {
        double r31068 = re;
        double r31069 = exp(r31068);
        double r31070 = im;
        double r31071 = sin(r31070);
        double r31072 = r31069 * r31071;
        return r31072;
}

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