document.write( "Question 946288: Given a 6x4 grid.
\n" ); document.write( "How many ways could Charley travel from home to school if he can only travel east or south?\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( " \n" ); document.write( "
Algebra.Com's Answer #577314 by Edwin McCravy(20060)\"\" \"About 
You can put this solution on YOUR website!
\r\n" );
document.write( "I think what you want is how many ways you can get from A to B, on the 6x4 grid\r\n" );
document.write( "below, if you can only go right or down along the lines of the grid.   I don't\r\n" );
document.write( "think the numbers in Pascal's triangle have anything to do with it.  Correct me\r\n" );
document.write( "in the thank-you note if I am interpreting that wrong.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "The number of rightward moves must add up to 6.\r\n" );
document.write( "The number of downward moves must add up to 4.\r\n" );
document.write( "\r\n" );
document.write( "The number of partitions of a number n is the number of ordered\r\n" );
document.write( "aequences of positive integers whose sum is n. \r\n" );
document.write( "\r\n" );
document.write( "The number of partitions of n is given by the formula C(2n-1,n-1)\r\n" );
document.write( "\r\n" );
document.write( "The number of possible rightward moves is the number of partitions of 6,\r\n" );
document.write( "which is C(2*6-1,6-1) = C(11,5) = 462\r\n" );
document.write( "The number of possible downward moves is C(2*4-1,4-1) = C(7,3) = 35\r\n" );
document.write( "\r\n" );
document.write( "Answer 462x35 = 16170 ways.   \r\n" );
document.write( "\r\n" );
document.write( "Edwin
\n" ); document.write( "
\n" );