Average Error: 0.0 → 0.0
Time: 4.1s
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 r112958 = re;
        double r112959 = exp(r112958);
        double r112960 = im;
        double r112961 = sin(r112960);
        double r112962 = r112959 * r112961;
        return r112962;
}
↓
double f(double re, double im) {
        double r112963 = re;
        double r112964 = exp(r112963);
        double r112965 = im;
        double r112966 = sin(r112965);
        double r112967 = r112964 * r112966;
        return r112967;
}

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