OpenStudy (anonymous):

Consider the grid NxN of pairs of integers. Suppose that one starts at the origin A=(0,0) and moves to the point B=(-2,10) in 10 steps. Each step is composed of either an "Up" movement ((i,j) --> (i+1,j+1)) or an "Down" movement ((i,j) --> (i-1,j+1)). The total number of distinct paths that pass through the point C=(0,6) and are composed of "Up" and "Down" movements is....

5 years ago
OpenStudy (turingtest):

please do not double-post thanks

5 years ago
OpenStudy (anonymous):

its a different question -.-

5 years ago
OpenStudy (turingtest):

right, my mistake

5 years ago
Similar Questions: