<t>reaverprog,i dont think you mean vertices, e.g., when n=1, there are only 2 steps, there would be no path for t=1, because the last step always ends at 0, one has P(2,2)=P(1,2)=1/2 and P(0,2)=0.the question would make sense if one considers instead the number of steps on the positive side (2t) an...