Average Error: 0.0 → 0.0
Time: 21.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 r48497 = re;
        double r48498 = exp(r48497);
        double r48499 = im;
        double r48500 = sin(r48499);
        double r48501 = r48498 * r48500;
        return r48501;
}
↓
double f(double re, double im) {
        double r48502 = re;
        double r48503 = exp(r48502);
        double r48504 = im;
        double r48505 = sin(r48504);
        double r48506 = r48503 * r48505;
        return r48506;
}

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