Analyzing the Setup
Welcome, future IITians! Today, we are standing before a mathematical mountain. Look at the expression 4282024.
If you were to try and calculate this directly, even the most powerful supercomputer would start to sweat. But in the world of JEE Advanced, we do not use brute force; we use elegance. We use the power of modular arithmetic to tame the beast.
Shrinking the Giant
Our first step is to simplify the base. We are looking for the remainder of 4282024 when divided by 21.
In modular arithmetic, we only care about the remainder. So, let us divide 428 by 21. We find that:
This tells us that 428≡8(mod21). Now, thanks to the beautiful property of modular arithmetic which states that if a≡b(modn), then ak≡bk(modn), we can replace our massive base of 428 with the much friendlier 8.
Our problem has now transformed into finding the remainder of 82024(mod21). Much better, right?
The Hunt for the Cycle
Even 82024 is still too large to calculate. We need to find a pattern, a cycle that repeats. Let us map the powers of 8 modulo 21:
Now, let us look at 82. We calculate:
If we divide 64 by 21, we get 64=21×3+1. This is the breakthrough! We have found that 82≡1(mod21).
This is the 'holy grail' of modular arithmetic. Once you hit a remainder of 1, you have found the cycle. Any power of 8 that is a multiple of 2 will now result in a remainder of 1.
The Final Victory
Now, we just need to bridge the gap to our original exponent, 2024. Since we know 82≡1(mod21), we can rewrite 82024 using the laws of exponents:
Substituting our identity, we get (1)1012(mod21). And as we all know, 1 raised to any power is simply 1.
The remainder is 1. Just like that, the mountain has been climbed. We did not need to calculate the massive number; we only needed to understand its structure. Keep this mindset, and no problem in the JEE exam will ever be too big for you.