A piece is placed at the point (0,0), and at each step, we are allowed to replace a piece at position (i,j) with two pieces at positions (i+1,j) and (i,j+1), provided that there is not already a piece there. Show that there will always be a piece with coordinates (a,b) such that a+b≤3.
Sign in to check your answer and unlock the solution.