perplexus.info :: Just Math : Almost disjoint union

Almost disjoint union (Posted on 2016-08-23)

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.)

Please log in:

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

Chatterbox:


perplexus dot info