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 r46479 = re;
        double r46480 = exp(r46479);
        double r46481 = im;
        double r46482 = sin(r46481);
        double r46483 = r46480 * r46482;
        return r46483;
}
↓
double f(double re, double im) {
        double r46484 = re;
        double r46485 = exp(r46484);
        double r46486 = im;
        double r46487 = sin(r46486);
        double r46488 = r46485 * r46487;
        return r46488;
}

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