document.write( "Question 136217This question is from textbook
\n" ); document.write( ": Dear sir/madam,\r
\n" ); document.write( "\n" ); document.write( "I am stucked with the following problems and hope that you could guide me. \r
\n" ); document.write( "\n" ); document.write( "1. (a) Given c>0, prove that lcm(ac,bc)= clcm(a,b)
\n" ); document.write( " (b) Prove that one of any m consecutive integers must be divisible by m.\r
\n" ); document.write( "\n" ); document.write( "Thank you very much. \r
\n" ); document.write( "\n" ); document.write( "Best wishes,
\n" ); document.write( "Mr Tan Guodong
\n" ); document.write( "

Algebra.Com's Answer #99797 by solver91311(24713)\"\" \"About 
You can put this solution on YOUR website!
I'm not at all sure how to even approach the first one. Perhaps someone else can help you.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "But here is a rather intuitive discussion of the second problem:\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "If some integer p is divided by another integer m, \"p%3E=m\", using integer division, then there are exactly \"m-1\" possible non-zero remainders. If given m consectutive integers, dividing each by m will result in m different remainders. Since there are only \"m-1\" non-zero remainders available, one of the m remainders must be 0, hence one of the m integers is evenly divisible by m.
\n" ); document.write( "
\n" );