Average Error: 0.0 → 0.0
Time: 9.3s
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 r54011 = re;
        double r54012 = exp(r54011);
        double r54013 = im;
        double r54014 = sin(r54013);
        double r54015 = r54012 * r54014;
        return r54015;
}
↓
double f(double re, double im) {
        double r54016 = re;
        double r54017 = exp(r54016);
        double r54018 = im;
        double r54019 = sin(r54018);
        double r54020 = r54017 * r54019;
        return r54020;
}

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