Quote:
Originally Posted by wblipp
How about building on the Dickman-de Bruijn function by defining a series
) is the asymptotic probability that x has exactly k prime divisors greater than x^(1/n). |
Hmm. I think I could do this, but it would be a real bear to compute. I wrote code to compute, or at least closely estimate, that function a few years back and it wasn't easy. It seems like this version would suffer from all the problems of the original, but worse.
But at the ranges that I've tested it the Dickman function already does a fairly poor job; not sure how these would fare, better or worse.
Quote:
Originally Posted by wblipp
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.
|
Sounds reasonable.