Average Error: 0.0 → 0.0
Time: 3.7s
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 r114487 = re;
        double r114488 = exp(r114487);
        double r114489 = im;
        double r114490 = sin(r114489);
        double r114491 = r114488 * r114490;
        return r114491;
}
↓
double f(double re, double im) {
        double r114492 = re;
        double r114493 = exp(r114492);
        double r114494 = im;
        double r114495 = sin(r114494);
        double r114496 = r114493 * r114495;
        return r114496;
}

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