All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Prove or verify (Posted on 2021-11-18) Difficulty: 3 of 5
English gifted mathematician Philip Hall proved a certain theorem regarding matching between members of two distinct sets a.k.a. as Hall’s marriage theorem.

The following statement is a practical example supporting his theorem: If you shuffle a standard deck of 52 cards and then create a row of 13 piles each of 4 cards it will be always possible to pick up a card from each pile to assemble a set of all denominations i.e. 1,2,3…Q,K (different suits, of course).

a. Provide a formal proof.
OR
b. Faute de mieux - a simulation program with 10,000 successful results and no failures will be welcomed.

No Solution Yet Submitted by Ady TZIDON    
Rating: 4.0000 (1 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
simulation programCharlie2021-11-18 16:24:59
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2021 by Animus Pactum Consulting. All rights reserved. Privacy Information