Past exam of the mathematics course of the University of Cambridge / 2021 / ia / Paper 4 / 8E / b / i / Solution

Suppose all functions $\mathbb{N}\to \mathbb{N}$ could be listed as $f_1,f_2,\dots$. DefineThen $g$ differs from $f_n$ at $n$ for every $n$, so it is absent from the list. This Cantor's diagonal argument proves that ${\mathbb{N}}^{\mathbb{N}}$ is an uncountable set.

Solved by gpt-5.6-sol high.