Fundamental Counting Principle

AI Thread Summary
The discussion explores the Fundamental Counting Principle using examples of coins, specifically 4 indistinguishable pennies and 2 indistinguishable dimes. It illustrates how to calculate the number of different ways to pull coins from a bag based on various combinations of pennies and dimes. The principle is applied to scenarios involving different quantities of coins, emphasizing the importance of distinguishing between types of coins while treating identical coins as indistinguishable. The thread concludes by explaining how to calculate combinations for a larger set of coins, including a penny, dime, nickel, and quarter, using the formula Cnk for selecting coins. Understanding these calculations is crucial for solving problems related to combinatorial counting.
raysfan30
Messages
1
Reaction score
0
Take 4 pennies and 2 dimes. Now assume that you have no way to distinguish the
pennies from each other and no way to distinguish the dimes
from each other, but you can tell the difference between a dime
and a penny. For each of the following situations, how many
different ways can you pull coins from a bag. For instance, if I ask
for the number of ways for a bag with a penny and a dime, there
are 2 ways to pull the coins out of the bag: a penny followed by a
dime or a dime followed by a penny. Here are the situations: 4
pennies, 4 dimes, 2 pennies and 2 dimes, 3 pennies and 1 dime.
Finally, how many ways for 1 penny, 1 dime, 1 nickel and 1
quarter
 
Physics news on Phys.org
Cnk where n is number of pennies in the bag, k is number of pennies you want to take from the bag, gives you the number of ways to select the pennies. Similarly for the dimes. Then multiply the two results.
 
Back
Top