Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Anyone know how to answer/attempt this question?

There are $n \geq 2 $ sets each containing 10 elements each. Any 2 sets contain 1 element in common and each 2 elements are only in the same set once.

Prove all elements occur in the same number of distinct sets.

To clarify, "each 2 elements are only in the same set once" means that if we pick any two elements, they will only be found together in the same set once, although each element separately could occur in multiple sets.

share|cite
    
"2 elements are only in the same set once". Can you be more clear here? – астон вілла олоф мэллбэрг 7 mins ago
    
I guess it means $\{x,y\}\subset A$ then $A$ is unique. – P Vanchinathan 5 mins ago
1  
@астонвіллаолофмэллбэрг If we pick any two elements, they will only be found together in the same set once, although each element separately could occur in multiple sets. – Herstein 5 mins ago
    
Thank you @Herstein – астон вілла олоф мэллбэрг 4 mins ago
    
@Herstein Is it possible for two elements to never occur together in any set? – 6005 58 secs ago

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.