Let http://www.cramster.com/Answer-Board...6185762832.gif with n>1, and let p be a prime number. If http://www.cramster.com/Answer-Board...7486624507.gifhttp://www.cramster.com/answer-board...b34e757044.jpg n!, prove that the exponent of p in the prime factorization of n! is [n/p] + [n/p^2] + [n/p^3] +......(Note that this sum is finite, since [n/p^m]=0 if p^m>n