To install click the Add extension button. That's it.
The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.
How to transfigure the Wikipedia
Would you like Wikipedia to always look as professional and up-to-date? We have created a browser extension. It will enhance any encyclopedic page you visit with the magic of the WIKI 2 technology.
Try it — you can delete it anytime.
Install in 5 seconds
Yep, but later
4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
In mathematics, Legendre's formula gives an expression for the exponent of the largest power of a primep that divides the factorialn!. It is named after Adrien-Marie Legendre. It is also sometimes known as de Polignac's formula, after Alphonse de Polignac.
YouTube Encyclopedic
1/5
Views:
2 437
1 308
6 313
86 808
136 751
Legendre's Formula | De-polignac formula
Legendre's Formula | Number Theory
Legendre's Formula Proof
28. Legendre Function | Legendre's Differential Equation | Complete Concept
Solving ODEs by Series Solutions: Legendre's ODE
Transcription
Statement
For any prime number p and any positive integer n, let be the exponent of the largest power of p that divides n (that is, the p-adic valuation of n). Then
where is the floor function. While the sum on the right side is an infinite sum, for any particular values of n and p it has only finitely many nonzero terms: for every i large enough that , one has . This reduces the infinite sum above to
where .
Example
For n = 6, one has . The exponents and can be computed by Legendre's formula as follows:
Proof
Since is the product of the integers 1 through n, we obtain at least one factor of p in for each multiple of p in , of which there are . Each multiple of contributes an additional factor of p, each multiple of contributes yet another factor of p, etc. Adding up the number of these factors gives the infinite sum for .
Alternate form
One may also reformulate Legendre's formula in terms of the base-p expansion of n. Let denote the sum of the digits in the base-p expansion of n; then
For example, writing n = 6 in binary as 610 = 1102, we have that and so
Similarly, writing 6 in ternary as 610 = 203, we have that and so
Proof
Write in base p. Then , and therefore
Applications
Legendre's formula can be used to prove Kummer's theorem. As one special case, it can be used to prove that if n is a positive integer then 4 divides if and only if n is not a power of 2.