You have a club that meets the fourth Thursday of each month, and another one that meets the last Thursday of each month. Usually you have to choose to attend one meeting or the other as the fourth Thursday of the month is usually the last Thursday of the month. However, some months have five Thursdays. In those months you can attend both meetings.

Develop an algorithm to find all the fifth Thursdays of those months that have them, and set it to calculate them for ten years. You are given subroutines that convert Gregorian calendar dates to and from JD numbers, which are the number of days a given date is past a certain fixed date in the distant past (more than 6000 years ago). You also have a 2003 calendar available that tells you Jan. 2, 2003 was a Thursday.

develop the routine a stage further to convert dates into so many weeks and so many days since the base date. All the Thursdays will have the same day remainder.

Posted by nellie on 2003-10-12 13:23:10