Question

Suppose you have to distribute the numbers {1,2,3,..,2n−1,2n} over n buckets. Show that there will always be at least one bucket with its sum is ≥2n+1.

Answer 1

put on hold as off-topic by Cameron Williams, user26857, Arnaud Mortier, John Omielan, verret Oct 30 at 0:22

This question appears to be off-topic. The users who voted to close gave this specific reason:

"This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – Cameron Williams, user26857, Arnaud Mortier, John Omielan, verret

If this question can be reworded to fit the rules in the help center, please edit the question.