Average Error: 0.0 → 0.0
Time: 2.4s
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 r50550 = re;
        double r50551 = exp(r50550);
        double r50552 = im;
        double r50553 = sin(r50552);
        double r50554 = r50551 * r50553;
        return r50554;
}
↓
double f(double re, double im) {
        double r50555 = re;
        double r50556 = exp(r50555);
        double r50557 = im;
        double r50558 = sin(r50557);
        double r50559 = r50556 * r50558;
        return r50559;
}

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