LinkBack URL
About LinkBacksIfis a real number define
to be greatest integer less than or equal to
If
is a prime, show that the power of
is given by
![\Bigl[\frac{n}{p}\Bigr] + \Bigl[\frac{n}{p^2}\Bigr]+ \cdots + \Bigl[\frac{n}{p^k}\Bigr]+ \cdots](http://latex.codecogs.com/png.latex?\Bigl[\frac{n}{p}\Bigr] + \Bigl[\frac{n}{p^2}\Bigr]+ \cdots + \Bigl[\frac{n}{p^k}\Bigr]+ \cdots)
Originally Posted by Chandru1
If
Supposep\,,\,k\in\mathbb{N})
the number of times p enters ONCE in
the number of times p divides n!
Supposep^2\,,\,m\in\mathbb{N})
the number of times p^2 enters TWICE in
the number of times
divides n!
Etc....
Tonio
  |
