Subscribe to the weekly news from TrueShelf

0

Legendre's Theorem

Prove the following Legendre's Theorem :

Legendre's Theorem : The number \(n!\) contains the prime factor \(p\) exactly \(\sum_{k \geq 1}{\lfloor \frac{n}{p^k} \rfloor}\) times.

Source: folklore

Related Content