Average Error: 0.0 → 0.0
Time: 18.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 r52292 = re;
        double r52293 = exp(r52292);
        double r52294 = im;
        double r52295 = sin(r52294);
        double r52296 = r52293 * r52295;
        return r52296;
}
↓
double f(double re, double im) {
        double r52297 = re;
        double r52298 = exp(r52297);
        double r52299 = im;
        double r52300 = sin(r52299);
        double r52301 = r52298 * r52300;
        return r52301;
}

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