Asked by Donna
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
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
Answers
Answered by
Donna
I want to know how to solve base on the Pigeonhole Principle. Thanks beforehand.
Answered by
Bosnian
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.
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.
There are no AI answers yet. The ability to request AI answers is coming soon!
Submit Your Answer
We prioritize human answers over AI answers.
If you are human, and you can answer this question, please submit your answer.