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 ->  Customizable Word Problem Solvers  -> Coins -> 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?       Log On

Ad: Over 600 Algebra Word Problems at edhelper.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) About Me  (Show Source):
You can put this solution on YOUR website!
Look at the factors.
9=3%5E2
12=2%5E2%2A3
6=2%2A3
Find the LCD of 9,12, and 6.
N=2%5E2%2A3%5E2=4%2A9
highlight%28N=36%29