Average Error: 0.0 → 0.0
Time: 3.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 r35085 = re;
        double r35086 = exp(r35085);
        double r35087 = im;
        double r35088 = sin(r35087);
        double r35089 = r35086 * r35088;
        return r35089;
}
↓
double f(double re, double im) {
        double r35090 = re;
        double r35091 = exp(r35090);
        double r35092 = im;
        double r35093 = sin(r35092);
        double r35094 = r35091 * r35093;
        return r35094;
}

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