document.write( "Question 830222: what is the least number of square pieces into which a cardboard,13 ft long and 8 ft wide,can be cut? \n" ); document.write( "
Algebra.Com's Answer #500433 by Edwin McCravy(20056)![]() ![]() You can put this solution on YOUR website! \r\n" ); document.write( "Let the side of each square be x, where x is not necessarily a \r\n" ); document.write( "positive integer. However there must be a positive integer N such that\r\n" ); document.write( "Nx = 13. And there must be another positive integer M such that Mx=8\r\n" ); document.write( "\r\n" ); document.write( "And we want these positive integers N and M to be as small as possible.\r\n" ); document.write( "\r\n" ); document.write( "So we have\r\n" ); document.write( "\r\n" ); document.write( "Nx = 13\r\n" ); document.write( "Mx = 8\r\n" ); document.write( "\r\n" ); document.write( "Dividing equals by equals:\r\n" ); document.write( "\r\n" ); document.write( "\n" ); document.write( " |