Average Error: 0.0 → 0.0
Time: 3.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 r57973 = re;
        double r57974 = exp(r57973);
        double r57975 = im;
        double r57976 = sin(r57975);
        double r57977 = r57974 * r57976;
        return r57977;
}
↓
double f(double re, double im) {
        double r57978 = re;
        double r57979 = exp(r57978);
        double r57980 = im;
        double r57981 = sin(r57980);
        double r57982 = r57979 * r57981;
        return r57982;
}

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