Average Error: 0.0 → 0.0
Time: 9.5s
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 r32791 = re;
        double r32792 = exp(r32791);
        double r32793 = im;
        double r32794 = sin(r32793);
        double r32795 = r32792 * r32794;
        return r32795;
}
↓
double f(double re, double im) {
        double r32796 = re;
        double r32797 = exp(r32796);
        double r32798 = im;
        double r32799 = sin(r32798);
        double r32800 = r32797 * r32799;
        return r32800;
}

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