Here's the question you clicked on:
AdisA
I have some problems with Problem Set 2, actualy with the problem 2, where we asked to explain why theorem is true. I have been trying it to solve for two hours and I can't get it. Any kind of help is helpful.
well you have 50-55 correct? 50 with package sizes 20 - 9 - 6 6 what is the simplest manner to get 56? hopefully the answer jumps out at you, if not I'm sure someone will spell it out in more detail then you want to know
I understood what were you trying to tell me, but I didn't understand what it has with the proof. I appreciate your help.
I don't think the original intent of of the problem was to have the students actually prove the theorem. In simple words I think the instructor was looking for something like: "If you have at least a sequence of solutions as long as the size of the smallest container, it is possible to get to the next sequence of solutions of the same size by adding one more of the smallest container to each. This can be repeated indefinitely, therefore there exist solutions to positive infinity" Or, something like that--nothing mathmatically formal.
ewsmith, after period of thinking about proof, I agree wtih you. Thank you.
ewsmith, i think that is the proof, its not incredibally formal, but it logic that can not be refuted