Average Error: 0.0 → 0.0
Time: 2.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 r110119 = re;
        double r110120 = exp(r110119);
        double r110121 = im;
        double r110122 = sin(r110121);
        double r110123 = r110120 * r110122;
        return r110123;
}
↓
double f(double re, double im) {
        double r110124 = re;
        double r110125 = exp(r110124);
        double r110126 = im;
        double r110127 = sin(r110126);
        double r110128 = r110125 * r110127;
        return r110128;
}

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