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 r47146 = re;
        double r47147 = exp(r47146);
        double r47148 = im;
        double r47149 = sin(r47148);
        double r47150 = r47147 * r47149;
        return r47150;
}
↓
double f(double re, double im) {
        double r47151 = re;
        double r47152 = exp(r47151);
        double r47153 = im;
        double r47154 = sin(r47153);
        double r47155 = r47152 * r47154;
        return r47155;
}

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