Re: [math-fun] Least prime divisor probabilities (or, The Lurch of the SubGenius)

On Wed, 12 Dec 2007, Dan Asimov wrote:

So: suppose each prime 2,3,5,7,...,p_k < sqrt(n) does not divide n while there remain primes p_r in the range p_k < p_r <= sqrt(n).

The greater such k, the greater the chance that such p_r | n.

Isn't that backward? 2 divides 1/2 the integers, 3 divides 1/3 the integers, etc. The lowest primes are the most likely to divide any given int. -J