Calendar problems form a recurring sub-topic in the general-ability and quantitative-aptitude papers of competitive civil-service examinations, requiring a candidate to determine the day of the week corresponding to a specified date, the number of days between two dates, or the recurrence of identical calendars across years. The mathematical foundation rests on the concept of odd days — the remainder days left after dividing a span of days by seven, since the week is a seven-day cycle. The Gregorian calendar, promulgated by Pope Gregory XIII in 1582 and adopted in British India through the Calendar (New Style) Act, governs the leap-year rule: a year is a leap year if divisible by 4, except centurial years, which must be divisible by 400. Thus 1600 and 2000 were leap years, while 1700, 1800, and 1900 were not.
The working method assigns each day a numeric value (0 = Sunday through 6 = Saturday) and computes odd days for the elapsed period. An ordinary year of 365 days yields 1 odd day (365 = 52 × 7 + 1) and a leap year yields 2 odd days. Over a century the odd-day counts are fixed: 100 years contain 5 odd days, 200 years 3, 300 years 1, and 400 years 0 — a cycle that repeats every 400 years, after which the entire Gregorian calendar recurs identically. Month codes (January–December) and the standard count of days per month allow a candidate to sum odd days from a known reference date and reduce modulo 7 to identify the target day. Doomsday-type algorithms, such as John Conway's Doomsday rule, offer a faster mental shortcut for the same computation.
In practice, an aspirant might be asked "What day of the week was 15 August 1947?" or "On what dates does the year 2024 calendar repeat?" The first is solved by summing odd days from a base year; the second exploits the rule that a leap-year calendar repeats after a 28-year span subject to centurial adjustments, while an ordinary calendar may repeat after 6 or 11 years. India's Independence Day, 15 August 1947, fell on a Friday — a stock textbook instance. Questions also test the distinction between Julian and Gregorian reckoning and, in Islamic-studies contexts, contrast the solar Gregorian year with the lunar Hijri calendar of approximately 354 days, whose months shift relative to the seasons.
For the exam, calendar problems appear chiefly in the aptitude and reasoning sections — CSAT Paper II in UPSC, the quantitative segments of CSS and BCS, and logical-reasoning portions of administrative tests. The typical question angle demands speed: candidates must apply the odd-days method without resorting to laborious counting, recall that the calendar repeats every 400 years, and handle leap-year exceptions for centurial years correctly. Mastery of month codes and the 100-200-300-400 odd-day sequence converts these from time-consuming puzzles into rapid mental computations, making them reliable scoring opportunities under timed conditions.
Example
In 2023, UPSC CSAT aspirants were drilled to verify that 15 August 1947 fell on a Friday using the odd-days method as a standard calendar-problem benchmark.
Frequently asked questions
Odd days are the days remaining after dividing a total span by seven, since the week repeats every seven days. An ordinary year leaves 1 odd day and a leap year 2 odd days, and these counts are summed and reduced modulo 7 to find the target day.