Question

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....

Answer 1

please do not double-post
thanks

Answer 2

its a different question -.-

Answer 3

right, my mistake