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

Home > Just Math
A set of subsets (Posted on 2018-01-17) Difficulty: 4 of 5
Create a collection of ten distinct subsets of S = {1, 2, 3, 4, 5, 6} such that:

1. each subset contains three elements,
2. each element of S appears in five subsets, and
3. each pair of elements from S appears in exactly two subsets.

Please explain how you did it.

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

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Solutioncomputer solutionCharlie2018-01-17 11:37:00
SolutionSolutionMath Man2018-01-17 08:19:50
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

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