- Interpret the expression:
The sum is
1+3+32+33+⋯+32021.
We need the remainder when this sum is divided by 50.
- Write it as a geometric series:
S=1+3+32+⋯+32021.
Using the geometric series formula,
S=3−132022−1=232022−1.
But working directly modulo 50 with division by 2 is inconvenient, so instead we find the sum modulo 50 using powers of 3 modulo 50.
- Find the pattern of 3n(mod50):
Compute a few powers:
31=3,
32=9,
33=27,
34=81≡31(mod50),
35=93≡43(mod50),
36=129≡29(mod50),
37=87≡37(mod50),
38=111≡11(mod50),
39=33(mod50),
310=99≡49(mod50),
311=147≡47(mod50),
312=141≡41(mod50),
313=123≡23(mod50),
314=69≡19(mod50),
315=57≡7(mod50),
316=21(mod50),
317=63≡13(mod50),
318=39(mod50),
319=117≡17(mod50),
320=51≡1(mod50).
So the powers repeat with period 20.
- Sum one full cycle:
We need
1+3+32+⋯+319(mod50).
Since
1+3+32+⋯+319=3−1320−1=2320−1.
Now,
320≡1(mod50),
but better compute modulo 100 so division by 2 is valid:
Using powers modulo 100,
320≡1(mod100)
(since 320=3486784401, ending in 01).
Thus,
320−1≡0(mod100),
so
2320−1≡0(mod50).
Hence,
1+3+32+⋯+319≡0(mod50).
- Break the full sum into complete cycles:
There are terms from exponent 0 to 2021, i.e. 2022 terms.
Since the period is 20,
2022=20⋅101+2.
So,
S=(1+3+32+⋯+319)+⋯+(101 such full blocks)+32020+32021.
Each full block contributes remainder 0 modulo 50.
Thus,
S≡32020+32021(mod50).
Since 2020≡0(mod20) and 2021≡1(mod20),
32020≡1,32021≡3(mod50).
Therefore,
S≡1+3=4(mod50).
- Final answer:
The remainder is
4.