〈 Berger | Dillon 〉

Is there something special about the Fibonacci numbers, or does it work for, say, any function that grows exponentially?

If it works for 2^n, I'll eat my hat.

Oh! Hahaha, yeah, that wouldn't work at all.

What I'm reminded of is this: the probability of two large integers being relatively prime is 6/pi^2: https://en.wikipedia.org/wiki/Coprime_integers#Probability_of_coprimality … You have to define what you mean here, of course.