Unformatted text preview: by 7! 4! · 3! = 35 . Problem 22 (paths on a grid through a speciFc point) One can think of the problem of going through a speciFc point (say P ) as counting the number of paths from the start A to P and then counting the number of paths from P to the end B . To go from A to P (where P occupies the (2 , 2) position in our grid) we are looking for the number of possible unique arraignments of two “U”’s and two “R”’s, which is given by 4! 2! · 2! = 6 , possible paths. The number of paths from the point P to the point B is equivalent to the number of di²erent arraignments of two “R”’s and one “U” which is given by 3! 2! · 1! = 3 ....
View
Full Document
 Winter '08
 G.JOGESHBABU
 Counting, Probability, French Revolution, Natural number, Leftwing politics, Arraignment

Click to edit the document details