Average Error: 0.0 → 0.0
Time: 2.7s
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 r86831 = re;
        double r86832 = exp(r86831);
        double r86833 = im;
        double r86834 = sin(r86833);
        double r86835 = r86832 * r86834;
        return r86835;
}
↓
double f(double re, double im) {
        double r86836 = re;
        double r86837 = exp(r86836);
        double r86838 = im;
        double r86839 = sin(r86838);
        double r86840 = r86837 * r86839;
        return r86840;
}

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