Overview
The Lifting the Exponent Lemma, often abbreviated as LTE, is a powerful tool in olympiad number theory.
It helps determine how many times a prime divides expressions such as
or
In other words, LTE is useful when we want to compute the exponent of a prime inside a number.
For example, instead of just asking whether divides , we can ask:
What is the largest power of that divides ?
LTE gives a fast and systematic way to answer questions like this.
Motivation
Consider
We can factor it as
or even further using difference of powers. However if we only care about powers of , expanding or fully factoring the expression is inefficient.
Instead notice that
so divides .
LTE tells us that under suitable conditions,
Since
and
we get
So divides , but does not.
This kind of computation appears frequently in olympiad divisibility problems.
Prime Valuation
Before stating LTE, we need one piece of notation.
For a prime and a positive integer , define
to be the exponent of in the prime factorisation of .
In other words, is the largest integer such that
Examples
Since
we have
and
Also,
because does not divide .
This notation allows us to discuss divisibility by prime powers far more simply.
Main Statement: Difference Form
The most common version of LTE is the difference form.
Lifting the Exponent Lemma
Let be an odd prime. Suppose that and . Then for every positive integer ,
This is the version used most often in olympiad problems.
Why the Conditions Matter
The assumptions are important.
- We require to be an odd prime.
- We require .
- We require .
The condition means that
The condition means that neither nor is divisible by . This prevents degenerate cases where both powers contain extra factors of for unrelated reasons.
Intuition Behind LTE
The expression
always factors as
So is always a factor.
LTE says something more significant. If an odd prime divides , then the additional powers of that appear in come from the exponent .
That is why the formula is
The first term comes from the base difference , and the second term comes from the exponent .
Proof Sketch
We can outline the idea behind the proof for odd primes.
Write
where .
Then
Using the binomial theorem,
The first term is
Since , the -adic contribution of this term is essentially
The later terms contain higher powers of , so they are more divisible by . Under the hypotheses of LTE, these later terms do not change the final valuation.
Since
this gives
This proof sketch explains why the formula has the shape it does. A fully rigorous proof requires checking that the later binomial terms have large enough -adic valuation.
Worked Examples
Example 1
Find the largest power of dividing .
We use LTE with
Since
and
the conditions are satisfied.
Therefore,
Now
and
Thus
So the largest power of dividing is .
Part 2: Check the part 2 for continuation
Module Progress:
Join the Discord Community!
Stuck on a problem, or don't understand a module? Join the Discord and get help with your doubts while making more math friends.
