2 ms·
While this fact about gcds is true, your link goes to a proof (incidentally, happens to be mine) that does not use this fact. :-)
by svat 4y ago
While this fact about gcds is true, your link goes to a proof (incidentally, happens to be mine) that does not use this fact. :-)
- Jun8 4y agoGreat to see you here and you're absolutely right: I got carried away with a comment (which, I now see, is yours, too :-) about Fibonacci numbers being a "strong divisibility sequence", this was the first time I've heard of this concept.
- svat 4y ago:-) Here's something else, almost entirely unrelated, that I like: we can prove that any two Fermat numbers 2^(2^n)+1 have gcd 1; this gives a proof (different from Euclid's) that there are infinitely many prime numbers: https://en.wikipedia.org/w/index.php?title=Fermat_number&oldid=1116879652#Basic_properties https://en.wikipedia.org/w/index.php?title=Fermat_number&old...