Average Error: 0.0 → 0.0
Time: 1.4s
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 r30441 = re;
        double r30442 = exp(r30441);
        double r30443 = im;
        double r30444 = sin(r30443);
        double r30445 = r30442 * r30444;
        return r30445;
}
↓
double f(double re, double im) {
        double r30446 = re;
        double r30447 = exp(r30446);
        double r30448 = im;
        double r30449 = sin(r30448);
        double r30450 = r30447 * r30449;
        return r30450;
}

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