Average Error: 0.0 → 0.0
Time: 2.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 r45487 = re;
        double r45488 = exp(r45487);
        double r45489 = im;
        double r45490 = sin(r45489);
        double r45491 = r45488 * r45490;
        return r45491;
}
↓
double f(double re, double im) {
        double r45492 = re;
        double r45493 = exp(r45492);
        double r45494 = im;
        double r45495 = sin(r45494);
        double r45496 = r45493 * r45495;
        return r45496;
}

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