Quote:
Originally Posted by wblipp
How about building on the Dickmande Bruijn function by defining a series
is the asymptotic probability that x has exactly k prime divisors greater than x^(1/n).
is the standard Dickmande Bruijn function.
The higher k's can (I think) be defined easily in terms of an integral of (k1) functions.
I'd hope that this heuristic gives a probability density for the number of large primes, with "large" defined by the choice of n. You could use the knowledge of prior factoring effort to choose interesting definitions of "large," and apply Bayes' theorem to modify the density to account for the prior effort.

Wrong approach. What needs to be computed is the
conditional
probability that a large integer N has k prime factors
given that
it has no factors less than (say) N^1/a, for given a.