I need some help with combinatorics. I have to count all the 10 bit words that contain at least 3 '1' and 3 '0', so I guess that the words would be something like this:
$$111 000 xxx x$$
The problem is that I don't really know how to determine which formula I need to use. Are these permutations with repetition, or are they variations? Becase the order is important I think that they most certainly are not combinations.
Also, I know that there are $2^n$ different 10-bit words, so there can not be more than $2^n$ such words.