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

Home > Just Math
Almost disjoint union (Posted on 2016-08-23) Difficulty: 3 of 5
Set S has 1600 members.
Sb is a collection of 16000 subsets of S, each having 80 members.

Prove (or disprove) that there must be at least two members of Sb containing 3 or less members in common.

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Alternative problem?JLo2020-01-24 09:18:59
SolutionNot so hardJLo2020-01-24 09:13:54
Please log in:
Remember me:
Sign up! | Forgot password

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

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