Let $n\geq2$ be an integer. $n$ is a prime if it is only divisible by $1$ and $n$. Prove that there are infinitely many prime numbers.
Source: Kosovo MO 2009 Grade 11, Problem 3
Tags: algebra
Let $n\geq2$ be an integer. $n$ is a prime if it is only divisible by $1$ and $n$. Prove that there are infinitely many prime numbers.