Average Error: 0.0 → 0.0
Time: 2.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 r89637 = re;
        double r89638 = exp(r89637);
        double r89639 = im;
        double r89640 = sin(r89639);
        double r89641 = r89638 * r89640;
        return r89641;
}
↓
double f(double re, double im) {
        double r89642 = re;
        double r89643 = exp(r89642);
        double r89644 = im;
        double r89645 = sin(r89644);
        double r89646 = r89643 * r89645;
        return r89646;
}

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