EdiShorts

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 ?

  1. aWednesday
  2. bThursday
  3. cFriday
  4. 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.

More Numeracy PYQs

All Numeracy questions →

Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.