Average Error: 0.0 → 0.0
Time: 6.3s
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 r29852 = re;
        double r29853 = exp(r29852);
        double r29854 = im;
        double r29855 = sin(r29854);
        double r29856 = r29853 * r29855;
        return r29856;
}
↓
double f(double re, double im) {
        double r29857 = re;
        double r29858 = exp(r29857);
        double r29859 = im;
        double r29860 = sin(r29859);
        double r29861 = r29858 * r29860;
        return r29861;
}

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