Average Error: 0.0 → 0.0
Time: 6.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 r30275 = re;
        double r30276 = exp(r30275);
        double r30277 = im;
        double r30278 = sin(r30277);
        double r30279 = r30276 * r30278;
        return r30279;
}
↓
double f(double re, double im) {
        double r30280 = re;
        double r30281 = exp(r30280);
        double r30282 = im;
        double r30283 = sin(r30282);
        double r30284 = r30281 * r30283;
        return r30284;
}

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