Probability of rolling at least 2 sixes 
Okay I do know the answer is
$$ \frac{6^5 - 5^5}{6^5} $$ which gives you the probability of at least one six. 
But then how can you find the probability of at least "Two" sixes?
I think this should be related to choosing from a set? I'm not sure but I'd like to find out.
 A: One approach is to consider the complementary event.
If you compute the probability of exactly zero 6's and exactly one 6, you can then take the complement of the probability to get "two or more".
If $X$ is the number of 6's observed
$$P(X\geq 2) = 1 - P(X=0) - P(X=1)$$
So with this approach - a very common one with probability problems - you reduce the problem to two equality events, each of which you should find easier to deal with.
However, if you already did some work, and have $P(X\geq 1)$ you can save yourself some calculation, since that's already $1 - P(X=0)$.
More generally, such problems are treated by using the binomial distribution.
If you have a set of independent trials (such as die rolls) with a constant probability of one event of interest (such as a 6), and you count the number of events of interest (each event of interest is traditionally called "a success") in $n$ such trials, then the number of successes is a binomially distributed random variable.
If $X$ is the number of successes in $n$ independent trials with constant probability of success, $p$, we're interested in $P(X=k)$ for some integer $k$ in ${0, 1, ..., n}$
First, two simpler problems: if we had $k$ trials all succeed, that would have probability $p^k$. If we had $m$ trials all fail, that would have probability $(1-p)^m$. I presume you can already see how to do those.
Now, we have $k$ trials of $n$ succeed and $n-k$ fail. If it was the first $k$ that succeeded, then that would have probability $p^k (1-p)^{n-k}$. But the successes can come in any of the $n$ positions, so we have to count all the different ways we can get $k$ successes in $n$ trials, which is the same as the number of arrangements of $k$ "$S$" symbols and $n-k$ "$F$" symbols. This is just ${n}\choose{k}$.
A: if X ist the random variable for the amount of sixes, then $P(X\geq1)$ means, that at least one 6 has to be thrown. With the converse probability it is $P(X\geq1)=1-P(X=0)$
For P(X=k) you can use the binomial Distribution $n \choose k $$ \cdot  p^k \cdot (1-p)^{n-k} $
And $P(X \geq 2)=1-P(X=0)-P(X=1)$
greetings,
calculus
