Solution
= Solution
Summing the <probability mass function> of the <binomial distribution> up to the largest permitted integer gives
$$
\boxed{\sum_{0\leq k\leq\alpha n}\binom nkp^k(1-p)^{n-k}
=\mathbb P(S_n\leq\lfloor\alpha n\rfloor)
=\mathbb P(S_n/n\leq\alpha).}
$$
The floor is implicit in the original integer-indexed sum.