Average Error: 0.0 → 0.0
Time: 6.0s
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 r41978 = re;
        double r41979 = exp(r41978);
        double r41980 = im;
        double r41981 = sin(r41980);
        double r41982 = r41979 * r41981;
        return r41982;
}
↓
double f(double re, double im) {
        double r41983 = re;
        double r41984 = exp(r41983);
        double r41985 = im;
        double r41986 = sin(r41985);
        double r41987 = r41984 * r41986;
        return r41987;
}

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