# discrete prob

Assuming that the value of n is fixed and $0 \le k \le n$, then you are counting the number of bit-strings of length n that have the sum of their enters great than or equal to k. The bit-strings with k ones and (n-k) zeros fit that description. How may of those are there?
Do it for each j, $k \le j \le n.$