SOLUTION: If I have 6 objects labeled A-F and I need to know how many different combinations that can be made but each combination MUST include object A, how would I figure this out? And the

Question 560066: If I have 6 objects labeled A-F and I need to know how many different combinations that can be made but each combination MUST include object A, how would I figure this out? And the combinations aren't limited to having to have 6 letters...for example, A by itself is a combination. AB, AC,AD, and DA,EA,FA are all combinations. Any help?
Answer by sudhanshu_kmr(1152) (Show Source): You can put this solution on YOUR website!

Number of combinations having only one object = 1C1 = 1 i.e A
because every combination must include object A.

number of combinations having two objects = 5C1 = 5
as we have to choose another 1 out of other 5 objects, A has been chosen already.

similarly,
number of combinations having three objects = 5C2 = 10

total number of possible combinations = 1 +5C1 + 5C2 + 5C3 +5C4 +5C5

if any doubt, feel free to ask....

RELATED QUESTIONS
im learning about combinations and permutations and i dont seem to understand how to do... (answered by richard1234)

I am learning combinations and permutations but I don't no how to get this problem. If... (answered by stanbon)

Hi can someone help me solve this please? I got the first answer right on figuring out... (answered by ikleyn)

How many different three-digit combinations can be made by using the numbers 1,3,5,7, and (answered by robertb)

How many different 6-digit license plates can be made if the first digit must not be 0... (answered by solver91311,scott8148)

If I offer advertisers the choice of using one of 3 colors in their listing, how many... (answered by rothauserc)

ok so this isn't homework, this is a work related thing that I just cant get my head... (answered by Theo)

Rework problem 9 from section 2.3 of your text. Assume that you have 6 dimes and 5... (answered by ewatrrr)

i need help with these two problems can someone help me.thanks Problem #1 A group of... (answered by stanbon)