If is divided by 7, then the remainder is:
We have to find the remainder obtained when the very large power is divided by . In other words, we must evaluate Working entirely in modular arithmetic keeps the numbers small and the calculations manageable.
First, reduce the base modulo :
So the original expression can be rewritten as
Now, instead of tackling the exponent directly, let us examine the powers of modulo to see whether they follow a simple repeating pattern.
Compute the first few powers:
From these results we observe the clear two-term cycle
In particular,
and therefore
The exponent we need is , which is odd. Hence
But is already less than so it is itself the remainder.
Therefore, when is divided by the remainder is .
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.