On the prime power factorization of n!

[摘要] In this paper, we prove two results. The first theorem uses a paper of Kim (J. Number Theory 74 (1999) 307) to show that for fixed primes P-1,...,P-k, and for fixed integers m(1),...,m(k), with p(i) inverted iota m(i), the numbers (e(p1) (n),..., e(Pk) (n)) are uniformly distributed modulo (m(1),...,m(k)), where e(p)(n) is the order of the prime p in the factorization of n!. That implies one of Sander's conjectures from Sander (J. Number Theory 90 (2001) 316) for any set of odd primes. Berend (J. Number Theory 64 (1997) 13) asks to find the fastest growing function f (x) so that for large x and any given finite sequence epsiloni is an element of {0, 1}, i less than or equal to f(x), there exists n < x such that the congruences e(Pi) (n) equivalent to epsilon(i) (mod 2) hold for all i less than or equal to f (x). Here, p(i) is the ith prime number. In our second result, we are able to show that f(x) can be taken to be at least c(1) (log x/(log log x)(6))(1/9), with some absolute constant c(1), provided that only the first odd prime numbers are involved. (C) 2003 Elsevier Inc. All rights reserved.

[发布日期] 2003-10-01