Page "Cantor's diagonal argument" Paragraph 16

It is possible to build a sequence s < sub > 0 </ sub > in such a way that its first element is different from the first element of the first sequence in the list, its second element is different from the second element of the second sequence in the list, and, in general, its n < sup > th </ sup > element is different from the n < sup > th </ sup > element of the n < sup > th </ sup > sequence in the list.

That is to say, if s < sub > n, n </ sub > is 1, then s < sub > 0, n </ sub > is 0, otherwise s < sub > 0, n </ sub > is 1.

For instance: