document.write( "Question 883788: how many numbers between 600 and 200 are divisible by 4,5,6?
\n" ); document.write( " \n" ); document.write( "
Algebra.Com's Answer #533779 by Edwin McCravy(20065)\"\" \"About 
You can put this solution on YOUR website!
\r\n" );
document.write( "To be divisible by 4,5, and 6, a number must be a\r\n" );
document.write( "multiple of their least common multiple.  So we\r\n" );
document.write( "find the least common multiple, LCM:\r\n" );
document.write( "\r\n" );
document.write( "  4 = 2·2\r\n" );
document.write( "  5 =       5\r\n" );
document.write( "  6 =   2·3\r\n" );
document.write( "------------------\r\n" );
document.write( "LCM = 2·2·3·5 = 60\r\n" );
document.write( "\r\n" );
document.write( "So each nmust be a multiple of\r\n" );
document.write( "\r\n" );
document.write( "To find the first multiple of 60 greater than 200,\r\n" );
document.write( "divide 200 by 60\r\n" );
document.write( "\r\n" );
document.write( "     3 1/3\r\n" );
document.write( "60)200\r\n" );
document.write( "   180\r\n" );
document.write( "    20\r\n" );
document.write( "\r\n" );
document.write( "The next integer greater than \"3%261%2F3\" is 4, so\r\n" );
document.write( "multiply 60×4 = 240, which is the first one, then\r\n" );
document.write( "add 60 successively until you get the largest one\r\n" );
document.write( "not exceeding 600: \r\n" );
document.write( "\r\n" );
document.write( "1. 240\r\n" );
document.write( "2. 300\r\n" );
document.write( "3. 360\r\n" );
document.write( "4. 420\r\n" );
document.write( "5. 480\r\n" );
document.write( "6. 540\r\n" );
document.write( "7. 600 ?\r\n" );
document.write( "\r\n" );
document.write( "Note: You'll have ask your teacher whether to include\r\n" );
document.write( "600 or not.  The word \"inclusive\" or \"exclusive\" to\r\n" );
document.write( "tell whether 600 is considered \"between 200 and 600\" or not,\r\n" );
document.write( "should have been given in the problem.\r\n" );
document.write( "\r\n" );
document.write( "Edwin
\n" ); document.write( "
\n" );