Average Error: 0.0 → 0.0
Time: 2.9s
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 r36260 = re;
        double r36261 = exp(r36260);
        double r36262 = im;
        double r36263 = sin(r36262);
        double r36264 = r36261 * r36263;
        return r36264;
}
↓
double f(double re, double im) {
        double r36265 = re;
        double r36266 = exp(r36265);
        double r36267 = im;
        double r36268 = sin(r36267);
        double r36269 = r36266 * r36268;
        return r36269;
}

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