Average Error: 0.0 → 0.0
Time: 19.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 r52850 = re;
        double r52851 = exp(r52850);
        double r52852 = im;
        double r52853 = sin(r52852);
        double r52854 = r52851 * r52853;
        return r52854;
}
↓
double f(double re, double im) {
        double r52855 = re;
        double r52856 = exp(r52855);
        double r52857 = im;
        double r52858 = sin(r52857);
        double r52859 = r52856 * r52858;
        return r52859;
}

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