document.write( "Question 1183760: A modern town is laid out in square blocks. By how many different routes can we go from the corner of East 1st Street and North 1st Avenue
\n" );
document.write( "to the corner of East 7th Street and North 5th avenue, each route being of the smallest possible length, that is, 10 blocks?\r
\n" );
document.write( "
\n" );
document.write( "\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #814218 by greenestamps(13200)![]() ![]() You can put this solution on YOUR website! \n" ); document.write( "We need to go 6 blocks east and 4 blocks north, in any order. The number of ways we can do that is the number of ways we can arrange the letters EEEEEENNNN. \n" ); document.write( "By a well-known counting principle, the number of ways we can do that is \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " |