Average Error: 0.0 → 0.0
Time: 13.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 r54425 = re;
        double r54426 = exp(r54425);
        double r54427 = im;
        double r54428 = sin(r54427);
        double r54429 = r54426 * r54428;
        return r54429;
}
↓
double f(double re, double im) {
        double r54430 = re;
        double r54431 = exp(r54430);
        double r54432 = im;
        double r54433 = sin(r54432);
        double r54434 = r54431 * r54433;
        return r54434;
}

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