Question: how to prove nxn is countable?
Answer: Two sets A and B are called equinumerous, written A ∼ B, if there is a bijection f : X → Y . A set A is called countably infinite if A ∼ N. We say that A is countable if A ∼ N or A is finite.