Math 2.0

statement theorem

Legendre's formula

Statement

Let pp be a prime number and let nn be a natural number. Let νp\nu_p be the p-adic valuation. Then νp(n!)=∑i=1∞⌊npi⌋.\nu_p(n!) = \sum_{i=1}^{\infty} \left\lfloor \frac{n}{p^i} \right\rfloor. The sum is finite, because ⌊n/pi⌋=0\lfloor n / p^i \rfloor = 0 when pi>np^i > n.

Remarks

An equivalent form: νp(n!)=n−sp(n)p−1\nu_p(n!) = \dfrac{n - s_p(n)}{p - 1}, where sp(n)s_p(n) is the sum of the digits of nn in base pp. For example, ν2(10!)=5+2+1=8\nu_2(10!) = 5 + 2 + 1 = 8, and ν5(100!)=20+4=24\nu_5(100!) = 20 + 4 = 24. So 100!100! ends with 2424 zeros. The proof counts, for each ii, the multiples of pip^i among 1,…,n1, \dots, n.

Explanations

L1 human

To count the factors pp in n!n!, count the multiples of pp up to nn. Then add the multiples of p2p^2, which give a second factor, and so on. For 10!10! and p=3p = 3: there are 33 multiples of 33 and 11 multiple of 99, so 343^4 is the largest power of 33 that divides 10!10!.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 4 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Divisibility definition
  2. Prime number definition
  3. P-adic valuation definition
  4. Legendre's formula statement

Sources

  1. Web https://en.wikipedia.org/wiki/Legendre%27s_formula, Statement