Average Error: 0.0 → 0.0
Time: 2.1s
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 r93483 = re;
        double r93484 = exp(r93483);
        double r93485 = im;
        double r93486 = sin(r93485);
        double r93487 = r93484 * r93486;
        return r93487;
}
↓
double f(double re, double im) {
        double r93488 = re;
        double r93489 = exp(r93488);
        double r93490 = im;
        double r93491 = sin(r93490);
        double r93492 = r93489 * r93491;
        return r93492;
}

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