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 r56259 = re;
        double r56260 = exp(r56259);
        double r56261 = im;
        double r56262 = sin(r56261);
        double r56263 = r56260 * r56262;
        return r56263;
}
↓
double f(double re, double im) {
        double r56264 = re;
        double r56265 = exp(r56264);
        double r56266 = im;
        double r56267 = sin(r56266);
        double r56268 = r56265 * r56267;
        return r56268;
}

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