I'm trying to represent the number of ways to arrange n blue and 4 red balls whose colors are indistinguishable
I've come up with, $${{n+4} \choose 4}$$
but I'm not sure how it works... How come I choose 4 but not n, and how come i am not permuting anything, since I'm dealing with arrangements?