Sudent Name: Chan Hin Ieong Student Number: DC226696

1, Let N be the set of positive integers. Decide if NxN is countable or not, and prove your result.

One way to create such a bijection is by using the Cantor Pairing Function:

- Given an ordered pair (a, b) from NxN, compute the unique integer value associated with it as
follows:

N(a, b) = 2^(a-1) * 3^(b-1)

- This function maps each pair of positive integers to a unique positive integer.

Since you can establish this bijection between NxN and N, NxN is countable.

2. Consider the set of all infinite sequences over {0,1} (e.g., 000000…., 010101…, 110110… are
elements of the set). Decide if the set is countable or not, and prove your result.

Assume, for the sake of contradiction, that you can list all infinite sequences over {0,1} and label
them as S1, S2, S3, and so on.

Now, construct a new sequence D as follows:

- For each digit in the nth sequence Sn, flip its value (change 0 to 1 and 1 to 0). So, D will be a
new infinite sequence.

Now, let's analyze D:

- D differs from each sequence Sn at least at the nth position, where n is the position of Sn in
the list.

- D is clearly an infinite sequence over {0,1} as well.

However, D cannot be any of the sequences in the list because it differs from each of them in
at least one position. This contradicts the assumption that we could list all infinite sequences.

Therefore, the set of all infinite sequences over {0,1} is uncountable.