Average Error: 0.0 → 0.0
Time: 1.6s
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 r42944 = re;
        double r42945 = exp(r42944);
        double r42946 = im;
        double r42947 = sin(r42946);
        double r42948 = r42945 * r42947;
        return r42948;
}
↓
double f(double re, double im) {
        double r42949 = re;
        double r42950 = exp(r42949);
        double r42951 = im;
        double r42952 = sin(r42951);
        double r42953 = r42950 * r42952;
        return r42953;
}

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