Getting Nowhere: Proving an Impossible Math Problem

[EvLer]

I am in a really badly taught and administered summer course
We never get solutions to exams or explanations of our mistakes. So, here is this problem that bothers me, still don't know how to do it:

Prove that in sequence of 15 positive integers (not including zero) that are not necessarily consequitive and not necessarily unique which sum up to 24 there is a sequence of numbers summing up to 5.

I am not even sure if I understood the question right, but is it THAT trivial? I mean, you can have all itegers = 1 and there is a sequence of 5 one's, but that even does not add up to 24.
Anyway... someone help, please

 

[0rthodontist]

Well, if they are all positive you can split them into those that equal 1, and those that do not equal one. Your job is to show that there are at least five numbers in the sequence that equal one.

 

[Data]

well it is pretty trivial to see that it is true:

if the sum is 24 and you need 15 positive numbers, consider what happens when all of them are \leq 2. Then you can have at most 12 2's: if you have more than 12 2's, then the sum of those will be > 24. So you have \leq 12 2's. But in fact you can't have any more than 9 2's: if you have 12 2's then their sum is 24 so you can't add any other numbers, if you have 11 2's then their sum is 22 so you get at most 13 numbers, and if you have 10 2's then their sum is 20 so you get at most 14 numbers. On the other hand, 9 2's and 6 1's gives a sum of 24 with 15 numbers.

See if you can finish the rest on your own

 

[siifuthun]

Think about the type of 15 numbers you can use to add up to 24. If you wanted to use the lowest numbers possible for all 15 numbers, how many times would the number one have to be used?