diff --git a/src/algebra/factorial-divisors.md b/src/algebra/factorial-divisors.md index bdb61e4a2..6b0317201 100644 --- a/src/algebra/factorial-divisors.md +++ b/src/algebra/factorial-divisors.md @@ -24,6 +24,7 @@ The final answer is $$\Bigl\lfloor\dfrac{n}{k}\Bigr\rfloor + \Bigl\lfloor\dfrac{n}{k^2}\Bigr\rfloor + \ldots + \Bigl\lfloor\dfrac{n}{k^i}\Bigr\rfloor + \ldots$$ +This result is also known as [Legendre's formula](https://en.wikipedia.org/wiki/Legendre%27s_formula). The sum is of course finite, since only approximately the first $\log_k n$ elements are not zeros. Thus, the runtime of this algorithm is $O(\log_k n)$. ### Implementation pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.

Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy