Average Error: 0.0 → 0.0
Time: 9.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 r26517 = re;
        double r26518 = exp(r26517);
        double r26519 = im;
        double r26520 = sin(r26519);
        double r26521 = r26518 * r26520;
        return r26521;
}
↓
double f(double re, double im) {
        double r26522 = re;
        double r26523 = exp(r26522);
        double r26524 = im;
        double r26525 = sin(r26524);
        double r26526 = r26523 * r26525;
        return r26526;
}

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