Solving the Stamp Problem: Finding the Greatest Amount for Perfect Change

  • Thread starter Thread starter armolinasf
  • Start date Start date
AI Thread Summary
The problem involves determining the greatest amount that cannot be formed using only 5 and 7 cent stamps. The proposed solution suggests that 23 cents is the highest unattainable amount. To prove this, two steps are necessary: first, demonstrate that 23 cannot be created using any combination of the stamps, and second, show that every amount greater than 23 can be formed. A hint indicates that only five specific amounts greater than 23 need verification to confirm the claim for all larger amounts. The discussion focuses on the mathematical proof required to validate the proposed solution.
armolinasf
Messages
195
Reaction score
0

Homework Statement



If you have only 5 and 7 cent stamps you can make perfect change of a 5,7,10,15,17, etc. cent letter. You cannot mail a 1,2,3,4,6,8,9,11,etc. cent letter. What is the greatest amount that you cannot make perfect change for?

2.Attempt at a Solution

I'm pretty confident that the answer is 23 cents, however I want to be able to prove that that is in fact the absolute greatest amount for all possible combinations. Thanks for the help
 
Physics news on Phys.org
There are two steps to proving it:
A. Prove that 23 cannot be made up of 5 and 7 cent stamps.
B. Prove that every number > 23 can be made up of 5 and 7 cent stamps.

A hint for the second part, only 5 numbers > 23 need to be checked to be sure it is true for all numbers > 23.
 
I picked up this problem from the Schaum's series book titled "College Mathematics" by Ayres/Schmidt. It is a solved problem in the book. But what surprised me was that the solution to this problem was given in one line without any explanation. I could, therefore, not understand how the given one-line solution was reached. The one-line solution in the book says: The equation is ##x \cos{\omega} +y \sin{\omega} - 5 = 0##, ##\omega## being the parameter. From my side, the only thing I could...
Back
Top