You are at a point (a,b) and you need to reach another point (c,d). Both points are below the line x=y and have integer coordinates. You can move in steps of length 1, either upwards of to the right, but you may not move to a point on the line x=y. How many different paths are there? combinatorics unsolvedcombinatorics