document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=388549>Question 388549</A>: <I><SPAN STYLE=\"word-break: break-all;\">  our class planned a holiday party for disadvantaged kids. Some of us baked cookies for the party. On the day of the party,we found we could divide the cookies into packets of two,three,four,five,or,six and have just one cookie left over in each case. If we divided them into packets of seven, there would be no cookies left over. What is the the least number of cookies the class could have baked?\r<BR>\n" );
document.write( "\n" );
document.write( " </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #274898 by </B><A HREF=/tutors/aboutme.mpl?userid=robertb><B>robertb(5830)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=robertb><IMG SRC=http://www.algebra.com/images/aboutme-small.gif BORDER=0 alt=\"About Me\" VALIGN=MIDDLE></A>&nbsp;<IMG SRC=http://www.algebra.com/cgi-bin/show-face.mpl?user=robertb><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=274898\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> The LCM of 2,3,4,5,6 is 60.  What we want then is to find positive integers m and n such that 60m + 1 = 7n, or we have to find the smallest positive m that would make 60m + 1 divisible by 7. Positive integers of the form 60m+ 1 are 61, 121, 181, 241, 301, 361, etc...  301 is the least positive value of this form divisible by 7. </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );