Average Error: 0.0 → 0.0
Time: 12.8s
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 r44973 = re;
        double r44974 = exp(r44973);
        double r44975 = im;
        double r44976 = sin(r44975);
        double r44977 = r44974 * r44976;
        return r44977;
}
↓
double f(double re, double im) {
        double r44978 = re;
        double r44979 = exp(r44978);
        double r44980 = im;
        double r44981 = sin(r44980);
        double r44982 = r44979 * r44981;
        return r44982;
}

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