Average Error: 0.0 → 0.0
Time: 11.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 r64874 = re;
        double r64875 = exp(r64874);
        double r64876 = im;
        double r64877 = sin(r64876);
        double r64878 = r64875 * r64877;
        return r64878;
}
↓
double f(double re, double im) {
        double r64879 = re;
        double r64880 = exp(r64879);
        double r64881 = im;
        double r64882 = sin(r64881);
        double r64883 = r64880 * r64882;
        return r64883;
}

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