Average Error: 0.0 → 0.0
Time: 3.9s
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 r43265 = re;
        double r43266 = exp(r43265);
        double r43267 = im;
        double r43268 = sin(r43267);
        double r43269 = r43266 * r43268;
        return r43269;
}
↓
double f(double re, double im) {
        double r43270 = re;
        double r43271 = exp(r43270);
        double r43272 = im;
        double r43273 = sin(r43272);
        double r43274 = r43271 * r43273;
        return r43274;
}

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