UPSC Prelims 2023 CSAT Q74 · Numeracy
Year2023
PaperCSAT
QuestionQ74
SubjectNumeracy
What is the remainder if 2^192 is divided by 6?
- a0
- b1
- c2
- d4
Show answer & explanationHide answer
Correct answer(d) 4
Powers of 2 divided by 6 yield a repeating remainder pattern where every even power leaves a remainder of 4, and since 192 is an even exponent, 2^192 divided by 6 leaves a remainder of 4.
Statement-by-statement analysis
✗ Option (a)
- A remainder of 0 implies complete divisibility by 6.
- Since 2^192 has no prime factor of 3, it cannot be divisible by 6.
- Therefore 0 is incorrect.
✗ Option (b)
- Dividing any even integer by an even divisor like 6 must always yield an even remainder.
- An odd remainder like 1 is mathematically impossible.
- Therefore 1 is incorrect.
✗ Option (c)
- A remainder of 2 is obtained only when 2 is raised to an odd power such as 2^1, 2^3, or 2^5.
- The exponent given in the question is 192, which is an even integer.
- Therefore 2 is incorrect.
✓ Option (d)
- Calculating initial remainders gives 2^1 mod 6 = 2, 2^2 mod 6 = 4, 2^3 mod 6 = 2, and 2^4 mod 6 = 4.
- This shows a repeating cycle of 2 for odd powers and 4 for even powers.
- Since 192 is an even power, 2^192 mod 6 = 4.
Concept to know
- Pattern recognition and cyclicity in modular arithmetic allow quick evaluation of remainders for large exponents.
- When evaluating remainders of 2^n divided by 6, testing small values reveals a repeating pattern of 2 and 4.
- General rule for base 2 divided by 6 states that 2^n mod 6 equals 2 when n is odd, and 4 when n is even.
- Alternative simplification shows 2^192 = (2^2)^96 = 4^96, and 4 raised to any positive integer power divided by 6 always leaves remainder 4.
- Parity check confirms that an even number divided by 6 can only yield even remainders 0, 2, or 4.
Related facts for revision
- Remainders of 4^n divided by 6 are always 4 for any positive integer exponent n.
- Cyclicity of unit digits where powers of numbers repeat unit digits in fixed cycles of length 1, 2, or 4.
- Binomial theorem method for remainders by expressing dividend in the form of (a + b)^n.
- Fermat's Little Theorem which applies specifically when the divisor is a prime number.
How UPSC tests this
Ability to identify pattern cyclicity in modular arithmetic to solve high-exponent division problems rapidly.
Trap: Candidates often confuse odd and even power outputs or attempt long division methods instead of testing initial powers to spot the pattern.
← Previous · Q73"The last end of the state is not to dominate men, nor to restrain them by…Next · Q75 →Consider the sequence ABC__ABC_ DABBCD_ ABCD that follows a certain pattern.…
More Numeracy PYQs
How many words can one form by shuffling the letters of the word QUEUE, if Q is always followed by U? The words thus formed need not necessarily have any meaning.
See the answer & explanation →
X, Y and Z jump forward 4', 6' and 5', respectively. At 8 AM, they all land on mark 199'. How many times will they all land on the same mark (need not be at the same moment) between mark 195' and 1000', if all of them cross mark…
See the answer & explanation →
A toy T jumps forward or backward. In each forward jump, it moves 5' forward whereas in each backward jump, it moves 2' backward. If in 31 jumps, T moves exactly 15' forward, then what is the difference of the number of forward…
See the answer & explanation →
If 10^m × 1000 × n = 75^25 × 25^32 × 32^75, where n is not divisible by 10, then the value of m is
See the answer & explanation →Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.