Math 2.0

statement lemma

Lifting-the-exponent lemma

Statement

Let pp be an odd prime, let xx and yy be integers with p∤xp \nmid x, p∤yp \nmid y and p∣x−yp \mid x - y, and let nn be a positive integer. Then νp(xn−yn)=νp(x−y)+νp(n)\nu_p(x^n - y^n) = \nu_p(x - y) + \nu_p(n), where νp\nu_p is the p-adic valuation.

Remarks

For p=2p = 2 the formula needs a stronger hypothesis. If xx and yy are odd and 4∣x−y4 \mid x - y, then ν2(xn−yn)=ν2(x−y)+ν2(n)\nu_2(x^n - y^n) = \nu_2(x - y) + \nu_2(n). For p=2p = 2, odd xx and yy, and even nn, the general formula is ν2(xn−yn)=ν2(x−y)+ν2(x+y)+ν2(n)−1\nu_2(x^n - y^n) = \nu_2(x - y) + \nu_2(x + y) + \nu_2(n) - 1. For example, ν3(109−1)=ν3(9)+ν3(9)=4\nu_3(10^9 - 1) = \nu_3(9) + \nu_3(9) = 4, and indeed 109−1=34⋅37⋅33366710^9 - 1 = 3^4 \cdot 37 \cdot 333667.

History

Édouard Lucas had some of the ideas by 1878. Mihai Manea published the modern form in 2006.

Explanations

L1 human

When pp divides x−yx - y, the lemma tells you exactly how many factors pp are in xn−ynx^n - y^n. You add the factors pp of x−yx - y and the factors pp of nn. Olympiad problems often use the lemma.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (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. Lifting-the-exponent lemma statement

Sources

  1. Web https://en.wikipedia.org/wiki/Lifting-the-exponent_lemma, Statements