Math is fun! Post anything math-related, fun proofs, jokes, youtube vids and the likes
I will start by proving that there can't be one biggest prime number[1]. It's a pretty simple and fun proof
Let's assume that there
is a biggest prime number. Now, if this assumption leads us to a contradiction, then it means that
the assumption itself is impossible, in other words, that there can't be a biggest prime number
So, assuming there is a biggest prime number, it means that prime numbers are finite (They are at most as many as the biggest prime number)
Now, if we take ALL the prime numbers and multiply them together, we get a number which is divisible by them all.
So now, let's add 1 to it. The result is not divisible by any prime number [2] so it's prime, and is also clearly bigger than the "biggest" number we had before. Contradiction!
[1] A prime number is a natural number that is only divisible by itself and one (except 1 itself, which is usually not considered prime). So, 2 is prime, 17 is prime, 15 isn't (it's divisible by 3 and 5)
[2] if A is divisible by B, then A+1 isn't (except for B=1, but that's not our case because 1 isn't prime)
Here's something more complicated but better shown and explained:
https://www.youtube.com/watch?v=wO61D9x6lNYTune in next time for a (broken) proof that 1 + 1 doesn't = 2. You'll be able to check your skills to see if you can find the error!