Analyzing the Setup
Imagine you are standing before a colossal number: 32022. Your task is to find the remainder when this titan is divided by 5.
If you try to calculate this directly, you will be lost in a sea of digits. In the realm of mathematics, we do not fight brute force with brute force; we fight it with elegance.
The Golden Link
The first step in our journey is to observe the base, 3, and the divisor, 5. Let us look at the powers of 3:
31=3
32=9
Look at 9. It is tantalizingly close to 10, and 10 is a multiple of 5. This is our golden link.
We can rewrite our massive expression 32022 by using the exponent rule amn=(am)n. Since 2022=2×1011, we can write:
Now, instead of dealing with 32022, we are dealing with 91011.
The Binomial Bridge
We use the Binomial Theorem as our magnifying glass. We rewrite 9 as (10−1). Our expression becomes (10−1)1011.
When we expand this using the binomial expansion, we get:
(10−1)1011=(01011)101011−(11011)101010+⋯+(−1)1011(10111011)11011
Every single term in this expansion, except for the very last one, contains a power of 10. Since 10 is a multiple of 5, every one of those terms is also a multiple of 5.
We can group all these terms together and call them 5m, where m is some integer. Our expression has now collapsed into 5m+(−1)1011.
The Final Adjustment
We are almost at the finish line. We have (−1)1011. Since 1011 is an odd number, a negative base raised to an odd power remains negative.
Thus, (−1)1011=−1. Our expression is now 5m−1.
In the world of remainders, we must have a positive value between 0 and 4. A remainder of −1 is equivalent to being one step behind the finish line.
To get to the positive remainder, we simply add the divisor, 5:
This is in the form 5k+4, where k=m−1. Therefore, the remainder is 4.