A community for students.
Here's the question you clicked on:
← 55 members online
 0 viewing
anonymous
 4 years ago
Prove that for any set of integers, there is a subset of them whose sum is divisible by n.
anonymous
 4 years ago
Prove that for any set of integers, there is a subset of them whose sum is divisible by n.

This Question is Closed

JamesJ
 4 years ago
Best ResponseYou've already chosen the best response.0Is n an arbitrary integer?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0yes, i can be... but I think I figure it out... I know the Pigeonhole Principle can be applied here... after I'm finish i'll write the answer (to see if I am correct).

JamesJ
 4 years ago
Best ResponseYou've already chosen the best response.0As you've written it, the result is false. For example A = {17} is a set of integers. The only n for which a sum of members of A is divisible by n is 1 and 17.
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.