Kummer's theorem

From HandWiki
Short description: Describes the highest power of primes dividing a binomial coefficient

In mathematics, Kummer's theorem is a formula for the exponent of the highest power of a prime number p that divides a given binomial coefficient. In other words, it gives the p-adic valuation of a binomial coefficient. The theorem is named after Ernst Kummer, who proved it in a paper, (Kummer 1852).

Statement

Kummer's theorem states that for given integers n ≥ m ≥ 0 and a prime number p, the p-adic valuation νp((nm)) of the binomial coefficient (nm) is equal to the number of carries when m is added to n − m in base p.

An equivalent formation of the theorem is as follows:

Write the base-p expansion of the integer n as n=n0+n1p+n2p2++nrpr, and define Sp(n):=n0+n1++nr to be the sum of the base-p digits. Then

νp((nm))=Sp(m)+Sp(nm)Sp(n)p1.

The theorem can be proved by writing (nm) as n!m!(nm)! and using Legendre's formula.[1]

Examples

To compute the largest power of 2 dividing the binomial coefficient (103) write m = 3 and nm = 7 in base p = 2 as 3 = 112 and 7 = 1112. Carrying out the addition 112 + 1112 = 10102 in base 2 requires three carries:

  1 1 1    
      1 1 2
+   1 1 1 2
  1 0 1 0 2

Therefore the largest power of 2 that divides (103)=120=2315 is 3.

Alternatively, the form involving sums of digits can be used. The sums of digits of 3, 7, and 10 in base 2 are S2(3)=1+1=2, S2(7)=1+1+1=3, and S2(10)=1+0+1+0=2 respectively. Then

ν2((103))=S2(3)+S2(7)S2(10)21=2+3221=3.

Multinomial coefficient generalization

Kummer's theorem can be generalized to multinomial coefficients (nm1,,mk)=n!m1!mk! as follows:

νp((nm1,,mk))=1p1((i=1kSp(mi))Sp(n)).

See also

References