We examine the remainders of powers of 3 when divided by 11:
The remainders repeat every 5 terms.
We find the remainder when 333 is divided by 5: \(333 = 5 \times 66 + 3\).
Therefore,
\[ 3^{3333} \equiv 3^3 \equiv 27 \equiv 5 \pmod{11} \]
The remainder when \(3^{3333}\) is divided by 11 is 5.
Directions: In Question Numbers 19 and 20, a statement of Assertion (A) is followed by a statement of Reason (R).
Choose the correct option from the following:
(A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A).
(B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A).
(C) Assertion (A) is true, but Reason (R) is false.
(D) Assertion (A) is false, but Reason (R) is true.
Assertion (A): For any two prime numbers $p$ and $q$, their HCF is 1 and LCM is $p + q$.
Reason (R): For any two natural numbers, HCF × LCM = product of numbers.