All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > General
Match The Years (Posted on 2006-01-22) Difficulty: 2 of 5
The days of the week (d.o.w) which are Sunday, Monday, Tuesday,Wednesday,Thursday,Friday and Saturday (in that order) are respectively denoted by the numbers 0,1,2,3,4,5 and 6 . Any given year commencing with a particular d.o.w is assigned that value corresponding to that d.o.w. For example, the value ‘0’ would be assigned to a year commencing with a Sunday.

# A year is defined as ‘Matched’ if the remainder obtained, when the year is divided by 7, corresponds precisely with the value assigned to that particular year. For example, 2003 A.D. is NOT A Matched year since 2003 leaves a remainder of 1 upon division by 7 but January 1,2003 occurred on a Wednesday which is denoted by 3.

Determine the total number of ‘Matched’ years between 1960 A.D. and 2560 A.D.(both years inclusive) in accordance with the Western (Gregorian) Calendar System.

See The Solution Submitted by K Sengupta    
Rating: 2.7500 (4 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
computer solution achieved (not posted here) | Comment 1 of 16
I have solved this, using Python, but before I post it, I would like to see how other people go about the problem. I am also assuming that all of the rules for leap years hold. That is, if it is divisible by 100, but not 400, then it's not a leap year.
  Posted by Justin on 2006-01-22 10:58:33
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information