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 r100308 = re;
        double r100309 = exp(r100308);
        double r100310 = im;
        double r100311 = sin(r100310);
        double r100312 = r100309 * r100311;
        return r100312;
}
↓
double f(double re, double im) {
        double r100313 = re;
        double r100314 = exp(r100313);
        double r100315 = im;
        double r100316 = sin(r100315);
        double r100317 = r100314 * r100316;
        return r100317;
}

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