Average Error: 0.0 → 0.0
Time: 2.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 r60661 = re;
        double r60662 = exp(r60661);
        double r60663 = im;
        double r60664 = sin(r60663);
        double r60665 = r60662 * r60664;
        return r60665;
}
↓
double f(double re, double im) {
        double r60666 = re;
        double r60667 = exp(r60666);
        double r60668 = im;
        double r60669 = sin(r60668);
        double r60670 = r60667 * r60669;
        return r60670;
}

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