anonymous
  • anonymous
Prove that for any set of integers, there is a subset of them whose sum is divisible by n.
Mathematics
chestercat
  • chestercat
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this
and thousands of other questions

JamesJ
  • JamesJ
Is n an arbitrary integer?
anonymous
  • anonymous
yes, 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
  • JamesJ
As 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.

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

Looking for something else?

Not the answer you are looking for? Search for more explanations.