AMC 10 Step by Step

2000 AMC 10 Problem 25

P21-25~6 minPrint

In year NN , the 300th300^{\text{th}} day of the year is a Tuesday. In year N+1N+1 , the 200th200^{\text{th}} day is also a Tuesday. On what day of the week did the 100100 th day of year N−1N-1 occur?

Log in to save your progress.
Show solution without answering

Key insight

Two Tuesdays are a whole number of weeks apart. The gap is 265 days, or 266 if year N is a leap year, and only 266 divides by 7.

Solution

1. Key fact. Two dates on the same day of the week are a whole number of weeks apart, so the number of days between them divides evenly by 77.
2. Is year NN a leap year? Count from day 300300 of year NN to day 200200 of year N+1N+1.
- If year NN has 365365 days: 6565 days are left in year NN, then 200200 more, for 265265 days.
- If year NN has 366366 days: 66+200=26666 + 200 = 266 days.

Both dates are Tuesdays, so the gap must divide by 77. Now 266=7⋅38266 = 7 \cdot 38, but 265265 leaves remainder 66. So year NN is a leap year.
3. Year N−1N-1. Leap years are 44 years apart, so the year right before a leap year is not one. Year N−1N-1 has 365365 days.
4. Count from day 100100 of year N−1N-1 to day 300300 of year NN. There are 365−100=265365 - 100 = 265 days to the end of year N−1N-1, then 300300 more:
265+300=565 days.265 + 300 = 565 \text{ days}.
5. Divide by 77. 565=7⋅80+5565 = 7 \cdot 80 + 5. So after 8080 full weeks there are 55 extra days.
6. Go backward. Day 100100 of year N−1N-1 comes before the Tuesday, so count 55 days back from Tuesday: Monday, Sunday, Saturday, Friday, Thursday.

The answer is (A) Thursday\boxed{\textbf{(A)}\ \text{Thursday}}.

Why this works

Day-of-the-week problems are about remainders after dividing by 77. The only tricky part is how long each year is, and the problem gives just enough information to decide that: two Tuesdays must be a whole number of weeks apart. Decide which years are leap years first, then count, and be careful to count backward when the date you want comes earlier.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

From day 300300 of year NN to day 200200 of year N+1N+1 is (LN−300)+200=LN−100(L_N - 300) + 200 = L_N - 100 days, where LNL_N is the length of year NN: 265265 days if LN=365L_N = 365, or 266266 if year NN is a leap year. Both dates are Tuesdays, so the gap must be a multiple of 77. Since 266=7⋅38266 = 7 \cdot 38 and 265265 is not divisible by 77, year NN is a leap year.

Consecutive years are never both leap years, so year N−1N-1 has 365365 days. From day 100100 of year N−1N-1 to day 300300 of year NN is (365−100)+300=565(365 - 100) + 300 = 565 days, and 565=7⋅80+5565 = 7 \cdot 80 + 5. The earlier date is therefore 55 weekdays before Tuesday: Monday, Sunday, Saturday, Friday, Thursday.

The answer is (A) Thursday\boxed{\textbf{(A)}\ \text{Thursday}}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site. Also appeared as 2000 12 #18.