document.write( "Question 1032533: The number of lollies in a jar was divided into 4 lots. The first lot when divided by 9, the second lot when divided by 7, the third lot when divided by 3 and the fourth lot when divide by 5 resulted in the same whole number. What is the least number of lollies that could have been in the jar? \n" ); document.write( "
Algebra.Com's Answer #647193 by robertb(5830)![]() ![]() You can put this solution on YOUR website! \r \n" ); document.write( "\n" ); document.write( "Let w = # of lollies in the 1st lot, \n" ); document.write( " x = # of lollies in the 2nd lot, \n" ); document.write( " y = # of lollies in the 3rd lot, \n" ); document.write( " z = # of lollies in the 4th lot.\r \n" ); document.write( "\n" ); document.write( "The problem is to minimize w + x + y + z.\r \n" ); document.write( "\n" ); document.write( "From the second sentence in the problem, we are given that \r \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "\n" ); document.write( "where k is a whole number.\r \n" ); document.write( "\n" ); document.write( "==> w = 9k, x = 7k, y = 3k, and z = 5k. \n" ); document.write( "==> w + x + y + z = 9k + 7k + 3k + 5k = 24k.\r \n" ); document.write( "\n" ); document.write( "Since the minimum value for k is 1, it follows that the least number of lollies that could have been in the jar is \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |