A beautiful proof: There have infinite primes
A long long time ago, we found natural numbers can be useful in our life, and some of them seem special. These numbers' multiplication can be a unique identifier for a certain number. We called them: prime. A prime has two factors: \(1\) and itself(notice that we limit the scope in \(\N\)). A question comes: Does there have infinite primes?
Suppose that \(p_1 < p_2 < ... < p_n\) are all the primes. Let \(P = p_1 \times p_2 \times ... \times p_n + 1\) and let \(p\) be a prime dividing \(P\); then \(p\) can't be any of \(p_1, p_2, ..., p_n\), otherwise \(p\) would divide the difference \(P - p_1 \times p_2 \times ... \times p_n = 1\), which is impossible. Therefore, this prime p is not in \(p_1, p_2, ..., p_n\), and \(p_1, p_2, ..., p_n\) would not be all the primes.
For a problem related to infinite, this proof is crazy simple delightful. The proof by Euclid at 300 BC, an amazing beautiful proof, but this version definitely not what ancient Greeks would write out since they view numbers in a more concrete way! XD! Here is an English version of Euclid origin words. I hope you enjoy the proof and have a nice day!