UPSC Prelims 2023 CSAT Q49 · Numeracy
Year2023
PaperCSAT
QuestionQ49
SubjectNumeracy
If today is Sunday, then which day is it exactly on 10^10 th day ?
- aWednesday
- bThursday
- cFriday
- dSaturday
Show answer & explanationHide answer
Correct answer(a) Wednesday
The 10^10-th day starting from today (Day 1, Sunday) means adding (10^10 - 1) days to Sunday, which leaves a remainder of 3 when divided by 7, giving Wednesday.
Statement-by-statement analysis
✓ Option (a)
- If today (Sunday) is Day 1, then the 10^10-th day occurs exactly (10^10 - 1) days after today.
- Using modular arithmetic, 10 ≡ 3 (mod 7), so 10^10 ≡ 3^10 = (3^3)^3 × 3 ≡ (-1)^3 × 3 = -3 ≡ 4 (mod 7).
- Thus, (10^10 - 1) ≡ 4 - 1 = 3 (mod 7), and adding 3 days to Sunday gives Wednesday.
✗ Option (b)
- This option (Thursday) is obtained if one incorrectly calculates 10^10 mod 7 = 4 and directly adds 4 days to Sunday.
- That calculation finds the day 10^10 days AFTER today, rather than the 10^10-th day itself.
✗ Option (c)
- Friday corresponds to adding 5 odd days to Sunday, requiring a remainder of 5 modulo 7.
- The remainder of (10^10 - 1) divided by 7 is 3, not 5.
✗ Option (d)
- Saturday corresponds to adding 6 odd days to Sunday, requiring a remainder of 6 modulo 7.
- The mathematical working yields a remainder of 3, ruling out Saturday.
Concept to know
- Calendar problems operate on a 7-day cycle, making remainder arithmetic modulo 7 the standard method for finding odd days.
- The distinction between N days after today and on the N-th day is vital: if today is Day 1, the N-th day is N minus 1 days after today.
- To find 10^10 mod 7, simplify the base 10 mod 7 to 3, transforming the problem to finding 3^10 mod 7.
- Using algebraic expansion, 3^3 = 27 = 28 - 1 ≡ -1 mod 7, so 3^10 = (3^3)^3 × 3 ≡ (-1)^3 × 3 = -3 ≡ 4 mod 7.
- Subtracting 1 to account for ordinal counting gives an effective remainder of 3 odd days to add to Sunday.
Related facts for revision
- Fermat's Little Theorem states that a^(p-1) ≡ 1 mod p for any prime p not dividing a, which simplifies 3^6 ≡ 1 mod 7.
- Cyclicity of remainders for powers of numbers when divided by 7 repeats in cycles of at most 6.
- Ordinary years contribute 1 odd day while leap years contribute 2 odd days in standard calendar questions.
How UPSC tests this
Modular arithmetic, binomial expansion of large powers, and precise ordinal counting logic.
Trap: Directly calculating 10^10 mod 7 = 4 and selecting Thursday by forgetting that the N-th day requires adding N - 1 days to today.
← Previous · Q48What is the number of selections of 10 consecutive things out of 12 things in…Next · Q50 →There are three traffic signals. Each signal changes colour from green to red…
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.