In math olympiads around the world, number theory problems have many recurring themes. One such theme is the 'LTE' or lifting the exponent.
We define a function callled Selective Logarithm (SL) which works on all integers (positive, negative or zero). Suppose N is any integer and p be a prime then where k is the highest power of p in that is a factor of N. In other words divides N but does not.
(Highest power of prime 3 in the prime factorization of each of them)
The SL function works like logarithm in some sense. For example we may easily prove and verify the following formulas:
We call this function 'selective logarithm' because it focuses on one prime factor and disregards all others. For example ; as 17 does not have any 5 in it's prime factorization the SL function completely disregards thr magnitude of 17 and gives 0 as output.
If p does not divides x and y and p divides . Additionally n has to be odd when we are working with
We immediately see why the theorem gets it's name. The exponent n is lifted from x and y and we are able to treat them separately.
Before we work on the proof of this theorem, some illustration problems and generalizations let us reiterate two familiar factorizations:
1. (n is odd)
Both of these factorizations, together with binomial theorem will be instrumental in the proof of Lifting the Exponent Theorem. In the next article of this series we will examine the proof and discuss some relevant problems.