Average Error: 0.0 → 0.0
Time: 2.3s
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 r34030 = re;
        double r34031 = exp(r34030);
        double r34032 = im;
        double r34033 = sin(r34032);
        double r34034 = r34031 * r34033;
        return r34034;
}
↓
double f(double re, double im) {
        double r34035 = re;
        double r34036 = exp(r34035);
        double r34037 = im;
        double r34038 = sin(r34037);
        double r34039 = r34036 * r34038;
        return r34039;
}

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