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 r96004 = re;
        double r96005 = exp(r96004);
        double r96006 = im;
        double r96007 = sin(r96006);
        double r96008 = r96005 * r96007;
        return r96008;
}
↓
double f(double re, double im) {
        double r96009 = re;
        double r96010 = exp(r96009);
        double r96011 = im;
        double r96012 = sin(r96011);
        double r96013 = r96010 * r96012;
        return r96013;
}

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