SOLUTION: jason can arrange his stamps by 9,12 or 16 on a page without any leftover.What is the smallest number of stamps for which he can do this?
Algebra.Com
Question 889445: jason can arrange his stamps by 9,12 or 16 on a page without any leftover.What is the smallest number of stamps for which he can do this?
Answer by Fombitz(32388) (Show Source): You can put this solution on YOUR website!
Look at the factors.
Find the LCD of 9,12, and 6.
RELATED QUESTIONS
Lala can arrange her stamps 3, 5, or 8 to a page without any stamps left over. If she... (answered by ikleyn)
Larry has 4-cent stamps and 9-cent stamps, which he can combine to produce various... (answered by stanbon)
A man bought a number of 12p stamps and also sufficient 16p stamps to make his total... (answered by ikleyn)
A collection of stamps consist of 3¢ stamps, 7¢ stamps, and 12 ¢ stamps. The number of 3... (answered by stanbon,josmiceli,ikleyn,MathTherapy)
Nigel has a stack of 4 pence stamps and 5 pence stamps. What is the largest number of... (answered by CubeyThePenguin)
How do I solve: a man has 10 dallors to buy stamps. He wants to buy twice as many 22 cent (answered by ankor@dixie-net.com)
Let T(n) denote the number of distinct ways that a postage of n
cents, where n ≥ 4 and (answered by greenestamps)
An account executive bought 330 stamps for $79.50. The purchase included $.15 stamps,... (answered by ankor@dixie-net.com)
I need an algebraic expression or formula for solving the following.
" A stamp... (answered by mangopeeler07)