UPSC Prelims 2023 CSAT Q27 · Numeracy
Year2023
PaperCSAT
QuestionQ27
SubjectNumeracy
A number N is formed by writing 9 for 99 times. What is the remainder if N is divided by 13 ?
- a11
- b9
- c7
- d1
Show answer & explanationHide answer
Correct answer(a) 11
A block of six 9s (999999) is completely divisible by 13, leaving only 3 nines (999) which gives a remainder of 11 when divided by 13.
Statement-by-statement analysis
✓ Option (a)
- Group the 99 nines into blocks of 6 nines each.
- 99 divided by 6 gives 16 complete blocks of 6 nines with a remainder of 3 nines left at the end.
- Since 999999 is divisible by 13, all 16 blocks leave a remainder of 0.
- The remaining number is 999, and 999 = 13 × 76 + 11, giving a remainder of 11.
✗ Option (b)
- Remainder 9 would be obtained if there was only 1 nine remaining after forming complete blocks of six nines.
- Here, 3 nines remain, so the remainder cannot be 9.
✗ Option (c)
- Remainder 7 is obtained when 99999 is divided by 13.
- Since the remaining number of digits is 3 (999), this option is incorrect.
✗ Option (d)
- Remainder 1 is obtained when 10^6 is divided by 13 according to Fermat's Little Theorem.
- It is not the remainder for the given repunit number N.
Concept to know
- Fermat Little Theorem states that if p is prime and gcd(a, p) = 1, then a^(p-1) leaves a remainder of 1 when divided by p.
- For a divisor of 13, 10^6 leaves a remainder of 1 modulo 13, which implies 10^6 - 1 = 999999 is divisible by 13.
- Any single digit repeated 6 times (like 999999 or 111111) is always divisible by 7, 11, and 13.
- To find the remainder of a large repunit number, divide the total count of repeated digits by the cyclicity period length.
- The remainder of the original number equals the remainder of the leftover digits divided by the target divisor.
Related facts for revision
- Divisibility rule of 7, 11, and 13 using the core product 7 × 11 × 13 = 1001.
- Repunit number properties where 111111 = 7 × 11 × 13 × 37.
- Finding remainders using modular arithmetic and negative remainders.
- Cyclicity of powers of 10 under different prime moduli.
How UPSC tests this
Understanding modular arithmetic, cyclicity of prime divisors, and divisibility patterns of repeated digit numbers.
Trap: Attempting full manual long division or miscalculating the block size as 12 instead of 6.
← Previous · Q26If p, q, r and s are distinct single digit positive numbers, then what is the…Next · Q28 →Each digit of a 9-digit number is 1. It is multiplied by itself. What is the…
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.