A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 3 years ago
"Let S be a set of n pairwise distinct positive integers. Prove that there exists a subset T in S, such that the sum of elements in T is divisible by n."
For example, suppose we have 5 numbers:
3,6,11,8,7
Then we have 7+3=10 which is divisible by 5
anonymous
 3 years ago
"Let S be a set of n pairwise distinct positive integers. Prove that there exists a subset T in S, such that the sum of elements in T is divisible by n." For example, suppose we have 5 numbers: 3,6,11,8,7 Then we have 7+3=10 which is divisible by 5

This Question is Closed

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Actually this question is of @Traxter

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Is MY solution correct?

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0If it is wrong PLZ tell me as I will work on it again..... Since @Traxter is not online for a long time I want u guys to check it.

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0@sauravshakya what is pair wise distinct positive numbers, heard that for the first time

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0I guess it means no integer is repeated...... all elements of the set are unique.

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0I'm not quite sure of this, but I'll show you my solution: Let's try and create a set S with \(n\) elements such that subset T as described doesn't exist. For the first element, we can choose \(a_{1}\) as long as \(a_{1}\not=0modn \). So there is one choice mod n we are not allowed to take. Set so far: \(S=(a_{1})\) For the second element, we can choose \(a_{2}\) as long as \(a_{2}\not= 0modn\) and \(a_{2}\not= (a_{1})modn\), since otherwise \((a_{1}+a_{2})modn=0modn\). So there are 2 choices mod n we are not allowed to take. Set so far: \(S=(a_{1}, a_{2})\) For the third element, we can choose \(a_{3}\) as long as: \(a_{3}\not= 0modn\) \(a_{3}\not= (a_{1})modn\) \(a_{3}\not= (a_{2})modn\) \(a_{3}\not= (a_{1}+a_{2})modn\) So there are 4 choices mod n we aren't allowed to take. As we continue, we are not allowed to take elements which are equal to the additive inverse of subsets of the set we have so far. So when picking the k'th element, where \( 0\le k \le n\), we will have: \[n2^k\] choices of elements to choose from which would not lead to the formation of a subset T as described in the question. We can keep choosing elements as long as: \[n2^k>0\] But will run out of choices as soon as: \[n2^k\le0\] So we will run out of choices on the k'th turn when k satisfies: \(n \le 2^k \) This will be satisfied for some \( 0\le k \le n\), thus it is impossible to create such a set S.
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.