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 p1, ...,pk, and for fixed integers m1, ...,mk, with pi mi, the numbers (ep1 (n), ..., epk (n)) are uniformly distributed modulo (m1, ..., mk), where ep(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 Ei ∈ {0,1}, i≤f(x), there exists n