arrow_back The pattern is to take each natural number k in turn and list the k pairs (m,n) for which m+n=k, starting with m=1 and running up to m=k. Then go on to the next value of k, and so forth.

Although the strings that are stuck together are getting longer and longer as we proceed with this process, they are always of finite length, so there is always a point at which we can patch on the next string.

We can visualize the procedure employed, with the following picture: