Average Error: 0.0 → 0.0
Time: 4.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 r43022 = re;
        double r43023 = exp(r43022);
        double r43024 = im;
        double r43025 = sin(r43024);
        double r43026 = r43023 * r43025;
        return r43026;
}
↓
double f(double re, double im) {
        double r43027 = re;
        double r43028 = exp(r43027);
        double r43029 = im;
        double r43030 = sin(r43029);
        double r43031 = r43028 * r43030;
        return r43031;
}

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