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 r59104 = re;
        double r59105 = exp(r59104);
        double r59106 = im;
        double r59107 = sin(r59106);
        double r59108 = r59105 * r59107;
        return r59108;
}
↓
double f(double re, double im) {
        double r59109 = re;
        double r59110 = exp(r59109);
        double r59111 = im;
        double r59112 = sin(r59111);
        double r59113 = r59110 * r59112;
        return r59113;
}

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