RankRizz
JEE MAIN 2017 · 08 APR ONLINE+4 / −1EASYTRANSCRIBED

JEE Main 2017 Mathematics question — Divisibility and remainder problems

If (27)999(27)^{999} is divided by 7, then the remainder is:

SOLUTION

We have to find the remainder obtained when the very large power 2799927^{999} is divided by 77. In other words, we must evaluate 27999(mod7).27^{999}\pmod 7. Working entirely in modular arithmetic keeps the numbers small and the calculations manageable.

First, reduce the base modulo 77:

27=7×3+6  ⟹  27≡6(mod7).27 = 7\times 3 + 6 \; \Longrightarrow \; 27 \equiv 6 \pmod 7.

So the original expression can be rewritten as

27999≡6999(mod7).27^{999} \equiv 6^{999}\pmod 7.

Now, instead of tackling the exponent 999999 directly, let us examine the powers of 66 modulo 77 to see whether they follow a simple repeating pattern.

Compute the first few powers:

61≡6(mod7),6^1 \equiv 6 \pmod 7,

62=36≡36−35=1(mod7),6^2 = 36 \equiv 36 - 35 = 1 \pmod 7,

63=62⋅6≡1⋅6=6(mod7),6^3 = 6^2\cdot 6 \equiv 1\cdot 6 = 6 \pmod 7,

64=(62)2≡12=1(mod7).6^4 = (6^2)^2 \equiv 1^2 = 1 \pmod 7.

From these results we observe the clear two-term cycle

6, 1, 6, 1, …6,\,1,\,6,\,1,\,\dots

In particular,

(61)≡6,(62)≡1,\bigl(6^1\bigr)\equiv 6,\qquad \bigl(6^2\bigr)\equiv 1,

and therefore

6odd exponent≡6,6even exponent≡1(mod7).6^{\text{odd exponent}}\equiv 6,\qquad 6^{\text{even exponent}}\equiv 1 \pmod 7.

The exponent we need is 999999, which is odd. Hence

6999≡6(mod7).6^{999}\equiv 6 \pmod 7.

But 66 is already less than 7,7, so it is itself the remainder.

Therefore, when 2799927^{999} is divided by 7,7, the remainder is 66.

Hence, the correct answer is Option C.

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

TopicDivisibility and remainder problems
TypeMultiple choice