Average Error: 0.0 → 0.0
Time: 17.2s
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 r30729 = re;
        double r30730 = exp(r30729);
        double r30731 = im;
        double r30732 = sin(r30731);
        double r30733 = r30730 * r30732;
        return r30733;
}
↓
double f(double re, double im) {
        double r30734 = re;
        double r30735 = exp(r30734);
        double r30736 = im;
        double r30737 = sin(r30736);
        double r30738 = r30735 * r30737;
        return r30738;
}

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