Average Error: 0.0 → 0.0
Time: 11.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 r59963 = re;
        double r59964 = exp(r59963);
        double r59965 = im;
        double r59966 = sin(r59965);
        double r59967 = r59964 * r59966;
        return r59967;
}
↓
double f(double re, double im) {
        double r59968 = re;
        double r59969 = exp(r59968);
        double r59970 = im;
        double r59971 = sin(r59970);
        double r59972 = r59969 * r59971;
        return r59972;
}

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