Y by
Prove that among n integers we can always choose some of them whose sum is a multiple on n.
I do have a solution to this, but could someone write a more descriptive one, please? Something like the logic behind it...
I do have a solution to this, but could someone write a more descriptive one, please? Something like the logic behind it...