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 r39096 = re;
        double r39097 = exp(r39096);
        double r39098 = im;
        double r39099 = sin(r39098);
        double r39100 = r39097 * r39099;
        return r39100;
}
↓
double f(double re, double im) {
        double r39101 = re;
        double r39102 = exp(r39101);
        double r39103 = im;
        double r39104 = sin(r39103);
        double r39105 = r39102 * r39104;
        return r39105;
}

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