The Python 🐍 problem-solving bootcamp πŸš€ is starting soon. Join the second cohort now!

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

The Python 🐍 problem-solving bootcamp is starting soon. Join the second cohort now!

Two consecutive integers are coprime

Twitter proof

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

Take your Python 🐍 skills to the next level πŸš€

I write about Python every week. Join +16.000 others who are taking their Python 🐍 skills to the next level πŸš€, one email at a time.

Previous Post Next Post

Blog Comments powered by Disqus.