Solve belove question base on Pigeonhole Principle.

A set M=(1,2,......100) is divided into seven subsets with no number in 2 or more subsets. Show that at least one subset either contains four numbers a,b,c, and d such that a+b = c+d or three number p,q and r such that p+q=2r
Solve this problem use Pigeonhole Principle

2 answers

I want to know how to solve base on the Pigeonhole Principle. Thanks beforehand.
I don't know, but you can use google.

Copy this text in google:

math.stackexchange questions 2865068 any partition of 1 to 100 into seven subsets

When you see list of results you can start from that.
Similar Questions
  1. How many sets are subsets of set B?List the subsets of set B. Which are proper subsets? B= {1,2,3,4,5} would it be 5 subsets (1
    1. answers icon 1 answer
  2. Question 1Question 2 Question 3 A) Which principle of ethical journalism states that a journalist should write about an event in
    1. answers icon 1 answer
  3. Question 1Question 2 Question 3 A) Which principle of ethical journalism states that a journalist should write about an event in
    1. answers icon 1 answer
  4. How many subsets of a set with 100 elements have more than one element?The answer to your question is the number of all of the
    1. answers icon 0 answers
more similar questions