Trouble Identifying Counting Problem Formula? Would this be the correct formula for the counting problem
Partition with Identical Items
$$
        \begin{pmatrix}
        n \\
        r  \\ 
        \end{pmatrix}=  \begin{pmatrix}
        n-1 \\
        r  \\ 
        \end{pmatrix} + \begin{pmatrix}
        n-1 \\
        r-1  \\ 
        \end{pmatrix}  \
$$
Moreover would anyone know a good example that might demonstrate a partition with Identical items? 

I am a member of a group of $n$ people in a room, of whom $r \le n$ will be awarded
one of $r$ identical prizes. Number of ways: ${n \choose r}.$
But I am interested in whether I will get a prize. There are two
cases:  
I do not win a one of the prizes: Number of ways: ${n-1 \choose r}.$
Send me out of the room. Award the $r$ prizes among the $n-1$ people remaining.
I win one of the prizes: Number of ways: ${n-1 \choose r-1}.$
Start by giving me my prize. There are $n-1$ remaining people and $r-1$
remaining prizes.
Add the number of ways for the two cases to get the number of ways overall.
Note: This identity is the basis of 'Pascal's triangle'. (With no
disrespect to Pascal, there are reports of Indian, Arab, and Chinese manuscripts
showing this triangular configuration of numbers from many hundreds of
years before Pascal, some with no obvious indication of purpose.)    
