Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

6. Let S be a k-element subset of {1,...,n}. Prove that, if () >n-1, then there exists a, b, X, Y ES such that a

image text in transcribed

6. Let S be a k-element subset of {1,...,n}. Prove that, if () >n-1, then there exists a, b, X, Y ES such that a + b, {a,b} + {x,y} and b - a=y- 2. (Note that it may be the case that b= x or a = y.) 7. Let S be a k-element subset of {1,...,n}. Prove that, if [k/2] [k/2] > n - 1, then there exists a 4-element subset {a,b, x, y} CS such that a b = x - y. (Unlike the previous question, a, b, x, y must be 4 distinct elements.)

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access with AI-Powered Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Students also viewed these Databases questions