In article <firstname.lastname@example.org>, email@example.com wrote:
> Do you know an n such that b_n is infinite? Certainly not. > If you have a list of finite entries like > 1 > 11 > 111 > ... > then the diagonal cannot be longer than all entries because each of its > digits is restricted to a finite index.
Does WM claim that there is any one row as long as any one column in the competed diagram?
Unless he does, there can be a string of 1's in a column or diagnal that is longer than any string of 1's in any row.
And if he does, he must tell us which row and which column. --