Average Error: 0.0 → 0.0
Time: 3.2s
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 r91007 = re;
        double r91008 = exp(r91007);
        double r91009 = im;
        double r91010 = sin(r91009);
        double r91011 = r91008 * r91010;
        return r91011;
}
↓
double f(double re, double im) {
        double r91012 = re;
        double r91013 = exp(r91012);
        double r91014 = im;
        double r91015 = sin(r91014);
        double r91016 = r91013 * r91015;
        return r91016;
}

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