document.write( "Question 1201865: The following 7 × 22 grid is divided into squares that are 1 unit by 1 unit.
\n" ); document.write( "WebAssign PlotThe shortest possible path on this grid from A to B is 29 units long. One such path is shown in the figure. Let X be the set of all 29-unit-long paths from A to B.\r
\n" ); document.write( "\n" ); document.write( "Compute |X|, the number of 29-unit-long paths from A to B.
\n" ); document.write( "|X| =
\n" ); document.write( "

Algebra.Com's Answer #836407 by greenestamps(13200)\"\" \"About 
You can put this solution on YOUR website!


\n" ); document.write( "The figure is described as a 7x22 grid of unit squares, so we don't need to see the figure....

\n" ); document.write( "Assuming this is a problem where A and B are opposite corners of the grid, the number of paths of length 29 from A to B is

\n" ); document.write( "\"29%21%2F%28%2822%21%29%287%21%29%29\"

\n" ); document.write( "To understand the reason for that answer, let B be 22 units to the right of A and 7 units above A. Then any path from A to B of length 29 has to move 22 \"steps\" to the right (\"R\") and 7 steps up (\"U\").

\n" ); document.write( "So each path of length 29 from A to B consists of some arrangement of the symbols

\n" ); document.write( "RRRRRRRRRRRRRRRRRRRRRRUUUUUUU

\n" ); document.write( "By a well-known counting principle, the number of ways to do that is the number shown above.

\n" ); document.write( "ANSWER: \"29%21%2F%28%2822%21%29%287%21%29%29\"

\n" ); document.write( "
\n" ); document.write( "
\n" );