Prove that is irrational for all prime
Woah! What the hell happened to me, I’m all serif and academic ! … huh.
Well anyway, today I thought it’d be fun to share this little proof, plus try to pull off the TeX look just for the hell of it! :p
I’m going to slow this off using proof by contradiction, by the way.
Proof
Assume that is rational - that is , where and are coprime integers.
Author’s note: coprime means that they do not share any common factors.
It is a sensible part of the definition of rational, as it enforces that rational numbers should be given in their simplest form, which should be simple-ish to do for all true rational numbers.
No rational number must necessarily have coprime numerator and denominator.
If divides by :
is of the form
For this to be true, must divide by , must divide by .
This would mean that , share factor , so are not coprime! ↯
If does not divide by :
is of the form does not divide by .
does not divide by does not divide by .
is not an integer, is not an integer, is not an integer! ↯
Conclusion
cannot divide by , but also cannot not divide by .
This is impossible, so cannot be rational!
is irrational for all prime
So, uh, back to normal!
That was a proof that I managed to find earlier after a lot of playing, and I was very pleasantly surprised with how the second half pretty much just fell into place once I had the first half sorted.
This was very fun to think about and devise, hopefully its not too dense / different to what people were maybe expecting me to post about!
Seems I’m drifting from tech and stuff towards math…
Anywho, hope to cya back here soon!
— Yellowsink