On Feb 24, 1:09 pm, Lie <[EMAIL PROTECTED]> wrote: > And this limit is much lower than n!. I think it's sum(primes(n)), but > I've got no proof for this one yet.
It's the least common multiple of the integers 1 through n, or equivalently the product over all primes p <= n of the highest power of p not exceeding n. So for n = 100, it's: 64 * 81 * 25 * 49 * 11 * 13 * 17 * ... rest of primes up to 100. For general n, this number is of roughly the same order of magnitude as e**n. See http://www.research.att.com/~njas/sequences/A003418 for more. Mark -- http://mail.python.org/mailman/listinfo/python-list
