Analyzing the Setup
Imagine you are sitting in the examination hall, and you see the expression 72022+32022 divided by 5. Your first instinct might be panic, but you are not meant to calculate the gargantuan number itself.
In the realm of JEE Advanced, we look for the essence and behavior of the expression. We will strip away the complexity and find the remainder using the elegant language of modulo arithmetic.
The Philosophy of Modulo Arithmetic
When we divide by 5, we are essentially asking: "Where does this number land on a clock with 5 hours?" We do not care about how many full rotations the number makes; we only care about the final position.
This is why we use the notation a≡b(modn). It tells us that a and b are essentially the same when viewed through the lens of the divisor n. Our goal is to simplify the bases 7 and 3 until they are easy to handle.
The Hunt for the Magical −1
We want to express our bases as 5k±1. This is because 1 and −1 are the most powerful numbers in exponentiation; 1 raised to any power is 1, and −1 raised to an even power is 1, while −1 raised to an odd power is −1.
For the base
7, we observe:
72=49≡−1(mod5)
Similarly, for the base
3, we observe:
32=9≡−1(mod5)
We have found our key to neutralizing the massive exponent 2022.
The Binomial Bridge
Now we rewrite our original expression by utilizing the properties of exponents. We can express
72022 as:
(72)1011=(49)1011≡(−1)1011(mod5)
Since
1011 is an odd number, we find:
(−1)1011=−1
We apply the exact same logic to
32022:
(32)1011=(9)1011≡(−1)1011(mod5)=−1
The Final Tally
We are left with the sum of our two results:
−1+(−1)=−2
In the world of remainders, we prefer positive integers. If you are 2 steps behind a multiple of 5, you are exactly 3 steps ahead of the previous multiple.
Mathematically, we add the divisor to normalize the result:
−2+5=3
The remainder is 3. You have just tamed a monster of an expression using nothing but logic and the power of −1.