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!

I hope you learned something new! If you did, consider following the footsteps of the readers who bought me a slice of pizza 🍕. Your small contribution helps me produce this content for free and without spamming you with annoying ads.

Previous Post

Blog Comments powered by Disqus.