Average Error: 0.0 → 0.0
Time: 3.2s
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 r42861 = re;
        double r42862 = exp(r42861);
        double r42863 = im;
        double r42864 = sin(r42863);
        double r42865 = r42862 * r42864;
        return r42865;
}
↓
double f(double re, double im) {
        double r42866 = re;
        double r42867 = exp(r42866);
        double r42868 = im;
        double r42869 = sin(r42868);
        double r42870 = r42867 * r42869;
        return r42870;
}

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