Average Error: 0.0 → 0.0
Time: 7.8s
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 r39064 = re;
        double r39065 = exp(r39064);
        double r39066 = im;
        double r39067 = sin(r39066);
        double r39068 = r39065 * r39067;
        return r39068;
}
↓
double f(double re, double im) {
        double r39069 = re;
        double r39070 = exp(r39069);
        double r39071 = im;
        double r39072 = sin(r39071);
        double r39073 = r39070 * r39072;
        return r39073;
}

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