Average Error: 0.0 → 0.0
Time: 2.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 r46629 = re;
        double r46630 = exp(r46629);
        double r46631 = im;
        double r46632 = sin(r46631);
        double r46633 = r46630 * r46632;
        return r46633;
}
↓
double f(double re, double im) {
        double r46634 = re;
        double r46635 = exp(r46634);
        double r46636 = im;
        double r46637 = sin(r46636);
        double r46638 = r46635 * r46637;
        return r46638;
}

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