(Untitled)

[gchpaco]

From Talk is talk, kill is kill: Knuth, 4.5.2, theorem D: If u and v are integers chosen at random, the probability that gcd(u,v)=1 is 6/pi^2
So if you give someone an infinite amount of random integers, they can use those to calculate pi by checking how many of those are prime to one another.
Yet another demonstration of the unreasonable

Comments

[natetg]

This is what EMUPA uses to calculate pi, in fact.

You can also use the fact that the prime density function is asymptotic to x/ln(x) to calculate e.