Average Error: 0.0 → 0.0
Time: 3.7s
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 r95310 = re;
        double r95311 = exp(r95310);
        double r95312 = im;
        double r95313 = sin(r95312);
        double r95314 = r95311 * r95313;
        return r95314;
}
↓
double f(double re, double im) {
        double r95315 = re;
        double r95316 = exp(r95315);
        double r95317 = im;
        double r95318 = sin(r95317);
        double r95319 = r95316 * r95318;
        return r95319;
}

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