Analyzing the Setup
The problem asks us to find the remainder when the sum S=1+3+32+33+⋯+32021 is divided by 50.
This expression is a Geometric Progression (G.P.) where the first term a=1 and the common ratio r=3.
To determine the number of terms
n, we observe the exponents range from
0 to
2021. Thus, the total number of terms is:
n=2021−0+1=2022
The Master Equation
Using the sum formula for a G.P.,
Sn=r−1a(rn−1), we substitute our known values:
S=3−11(32022−1)=232022−1
We now need to evaluate S(mod50). To facilitate this, we manipulate the base 3 to relate it to the divisor 50.
We note that
32=9, which can be written as
(10−1). Thus, we rewrite the expression as:
S=2(32)1011−1=2(10−1)1011−1
The Binomial Bridge
We apply the
Binomial Theorem to expand
(10−1)1011:
(10−1)1011=(01011)101011−⋯+(10101011)101(−1)1010+(10111011)(−1)1011
All terms containing 10k where k≥2 are multiples of 100. We can group these as 100λ for some integer λ.
The remaining terms are:
(10101011)⋅10⋅1+(−1)=1011⋅10−1=10110−1
Final Calculation
Substituting this expansion back into our expression for
S:
S=2100λ+10110−1−1
S=2100λ+10108
Simplifying the fraction, we obtain:
S=50λ+5054
To find the remainder when
S is divided by
50, we look at
5054(mod50):
5054=5000+50+4
Since 5000 and 50 are both divisible by 50, the remainder is 4.
The final remainder is 4.