Let's prove that if \(k\) is an integer, then \(\gcd(k, k+1) = 1\). That is, any two consecutive integers are coprime.

Follow me on Twitter, where I write about Python, APL, and maths.

Two consecutive integers are coprime

Twitter proof

Do you have an idea for a twitter proof? Let me know in the comments below!

Thanks for reading this far! If you would like to show your appreciation for my work and would like to contribute to the development of this project, consider buying me a slice of pizza 🍕.

Previous Post

Blog Comments powered by Disqus.