Combinations and Permutations of Cards

AI Thread Summary
The discussion focuses on calculating the number of ways to divide a deck of 52 cards into piles of three, with the stipulation that zero cards cannot be in any pile. The initial approach involves selecting a number for the first pile and determining the remaining cards for the other two piles, leading to a summation formula. When zero is not allowed, the calculation simplifies to summing the ways to distribute the remaining cards, resulting in the formula (50x51)/2. Participants clarify the process of counting valid distributions without including empty piles. The conversation emphasizes the importance of understanding the combinatorial principles involved in the problem.
Baron
Messages
4
Reaction score
0
Hey guys,
I have a problem relating to combinations and permutations.In how many ways can I divide a deck of 52 cards into piles of 3 with each pile containing any number?
for example 50,1,1 or 45,6,1
Thanks in advance
 
Physics news on Phys.org
Is 0 allowed for one of the piles? If you look at in two steps it is fairly straightforward.
Step 1, choose a number (k) for the first pile. There are now 52-k left for the other two piles. Assuming 0 is allowed, there are 52-k ways to split up these cards. Now just add them up for k ranging from 0 to 52. It will sum to 52x53/2.

If 0 is not allowed, the procedure is the same, just omit the cases where any pile has 0.
 
Thanks,0 is not allowed
 
Can you explain this."Now just add them up for k ranging from 0 to 52".I'm a little lost.(not a math expert)
 
Since 0 is not allowed. Put 50 in the first pile, then there is exactly 1 way of sorting the other two piles. Put 49 in the first pile and there are 2 ways of sorting the other 2 piles, ..., put 1 in the first pile and there are 50 ways of sorting into the other two piles. Net result 1+2+3+...+50 = (50x51)/2.
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top