Consider a rectangle whose length is m and whose height is n. A path from bottom left corner to top right corner is called valid, if in each step, it either goes one unit to the right or one unit upwards. if m = 5 and n = 3, how many valid paths are there?
This rectangle is basically a table with 15 cells(3 vertical x 5 horizontal). I need to find the total number of paths that I can take from bottom left corner to top right corner. I get the answer 16 paths. Can anyone verify this?