Bijection Difficult

Problem - 4355

Let $n$ be a positive integer. Find the number of paths from $(0,0)$ to $(n,n)$ on a $n\times n$ grid using only unit up and right steps so that the path stays in the region $x\ge y$.


The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error