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 r60435 = re;
        double r60436 = exp(r60435);
        double r60437 = im;
        double r60438 = sin(r60437);
        double r60439 = r60436 * r60438;
        return r60439;
}
↓
double f(double re, double im) {
        double r60440 = re;
        double r60441 = exp(r60440);
        double r60442 = im;
        double r60443 = sin(r60442);
        double r60444 = r60441 * r60443;
        return r60444;
}

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