Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2017/ia/paper-4/6d/a/solution

A set is a countable set if there exists an injective function , with . Equivalently, it is a finite set or has a bijection with . An infinite countable set is called a countably infinite set.
The empty set is included: the empty function into is injective. This convention distinguishes “countable” from “countably infinite” and will also cover the finite threshold sets in the last part.

New to topics? Read the docs here!