Average Error: 0.0 → 0.0
Time: 3.7s
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 r50300 = re;
        double r50301 = exp(r50300);
        double r50302 = im;
        double r50303 = sin(r50302);
        double r50304 = r50301 * r50303;
        return r50304;
}
↓
double f(double re, double im) {
        double r50305 = re;
        double r50306 = exp(r50305);
        double r50307 = im;
        double r50308 = sin(r50307);
        double r50309 = r50306 * r50308;
        return r50309;
}

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