Pretend you're playing a carnival game and you've won the lottery, sort of. You have the opportunity to select five bills from a money bag, while blindfolded. The bill values are $1, $2, $5, $10, $20, $50, and $100. How many different possible ways can you choose the five bills? (Order doesn't matter, and there are at least five of each type of bill.) A. 56 B. 120 C. 288 D. 462

Respuesta :

Answer: 462

Step-by-step explanation:

The general theorem of combination says that there are [tex]C(n+r-1, r)[/tex], with r-combinations from a set having n elements when repetition of elements is allowed.

Here the number of denomination: [tex]n = 7[/tex] , r =5

Also order doesn't matters.

Then the number of different possible ways can you choose the five bills is given by :-[tex]C(7+5-1, 5)= C(11,5)\\\\=\dfrac{11!}{5!(11-5)!}\\\\=462[/tex]

Hence, the number of different possible ways can you choose the five bills is  462.