RankRizz
JEE MAIN 2023 · 25 JAN S2+4 / −1MEDIUMTRANSCRIBED

JEE Main 2023 Mathematics question — Divisibility and remainder problems

The remainder when (2023)2023(2023)^{2023} is divided by 35 is

SOLUTION

We need to find the remainder when (2023)2023(2023)^{2023} is divided by 3535.

Since 35=5×735 = 5 \times 7 and gcd⁡(5,7)=1\gcd(5, 7) = 1, we use the Chinese Remainder Theorem.

Find (2023)2023(mod5)(2023)^{2023} \pmod{5}.

2023=404×5+32023 = 404 \times 5 + 3, so 2023≡3(mod5)2023 \equiv 3 \pmod{5}.

By Fermat's Little Theorem, 34≡1(mod5)3^4 \equiv 1 \pmod{5}.

2023=4×505+32023 = 4 \times 505 + 3, so 2023≡3(mod4)2023 \equiv 3 \pmod{4}.

Therefore: 32023≡33=27≡2(mod5)3^{2023} \equiv 3^3 = 27 \equiv 2 \pmod{5}.

Find (2023)2023(mod7)(2023)^{2023} \pmod{7}.

2023=289×72023 = 289 \times 7, so 2023≡0(mod7)2023 \equiv 0 \pmod{7}.

Therefore: (2023)2023≡0(mod7)(2023)^{2023} \equiv 0 \pmod{7}.

Apply the Chinese Remainder Theorem.

We need xx such that:

x≡2(mod5)x \equiv 2 \pmod{5} and x≡0(mod7)x \equiv 0 \pmod{7}.

From the second condition, x=7kx = 7k for some integer kk.

Substituting: 7k≡2(mod5)  ⟹  2k≡2(mod5)  ⟹  k≡1(mod5)7k \equiv 2 \pmod{5} \implies 2k \equiv 2 \pmod{5} \implies k \equiv 1 \pmod{5}.

So k=5m+1k = 5m + 1 and x=7(5m+1)=35m+7x = 7(5m + 1) = 35m + 7.

The remainder when (2023)2023(2023)^{2023} is divided by 3535 is 7\boxed{7}.

Tagged Divisibility and remainder problems. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicDivisibility and remainder problems
TypeNumerical answer