Asked by Lolita Sams
a. Show that in any set of n integers, there is a subset whose sum is divisible by n.
b. Show that for any integer n, there is an integer whos digits (in decimal representation) consist of only 0 and 1.
I don't think the first can be proved. However, in a set of 2n-1 integers, it can be proved that there is a subset whose sum is divisible by n.
2. This makes no sense to me. Something is missing.
b. Show that for any integer n, there is an integer whos digits (in decimal representation) consist of only 0 and 1.
I don't think the first can be proved. However, in a set of 2n-1 integers, it can be proved that there is a subset whose sum is divisible by n.
2. This makes no sense to me. Something is missing.
Answers
There are no human answers yet.
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.