Average Error: 0.0 → 0.0
Time: 2.8s
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 r78507 = re;
        double r78508 = exp(r78507);
        double r78509 = im;
        double r78510 = sin(r78509);
        double r78511 = r78508 * r78510;
        return r78511;
}
↓
double f(double re, double im) {
        double r78512 = re;
        double r78513 = exp(r78512);
        double r78514 = im;
        double r78515 = sin(r78514);
        double r78516 = r78513 * r78515;
        return r78516;
}

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