Academia.eduAcademia.edu

Determining Day of Given Date Mathematically

2020, Mathematics and Statistics

https://doi.org/10.13189/ms.2020.080514

Computation of day of a week from given date belonging to any century has been a great quest among astronomers and mathematicians for long time. In recent centuries, thanks to efforts of some great mathematicians we now know methods of accomplishing this task. In doing so, people have developed various methods, some of them very concise and compact but not much explanation which is accessible are provided. The chief purpose of this paper is to address this issue. Also, almost all known calculations involve either usage of tables or some predetermined codes usually assigned for months, years or centuries. In this paper, I had established the mathematical proof of determining the day of any given date which is applicable for any number of years even to the time of BCE. I had provided the detailed mathematical derivation of month codes which were key factors in determining the day of any given date. Though the procedures for determining the day of given date are quite well known, the way in which they arrived is not so well known. This paper will throw great detail in that aspect. To be precise, I had explained the formula obtained by German Mathematician Zeller in detail and tried to simplify it further which will reduce its complexity and at the same time, would be as effective as the original formula. The explanations for Leap Years and other astronomical facts were clearly presented in this paper to aid the derivation of the compact form of Zeller's Formula. Some special cases and illustrations are provided wherever necessary to clarify the computations for better understanding of the concepts.

Mathematics and Statistics 8(5): 590-595, 2020 DOI: 10.13189/ms.2020.080514 http://www.hrpub.org Determining Day of Given Date Mathematically R. Sivaraman National Awardee for Popularizing Mathematics among Masses, D G Vaishnav College, India Received July 14, 2020; Revised August 20, 2020; Accepted September 17, 2020 Cite This Paper in the following Citation Styles (a): [1] R. Sivaraman , "Determining Day of Given Date Mathematically," Mathematics and Statistics, Vol. 8, No. 5, pp. 590 - 595, 2020. DOI: 10.13189/ms.2020.080514. (b): R. Sivaraman (2020). Determining Day of Given Date Mathematically. Mathematics and Statistics, 8(5), 590 - 595. DOI: 10.13189/ms.2020.080514. Copyright©2020 by authors, all rights reserved. Authors agree that this article remains permanently open access under the terms of the Creative Commons Attribution License 4.0 International License Abstract Computation of day of a week from given date belonging to any century has been a great quest among astronomers and mathematicians for long time. In recent centuries, thanks to efforts of some great mathematicians we now know methods of accomplishing this task. In doing so, people have developed various methods, some of them very concise and compact but not much explanation which is accessible are provided. The chief purpose of this paper is to address this issue. Also, almost all known calculations involve either usage of tables or some pre-determined codes usually assigned for months, years or centuries. In this paper, I had established the mathematical proof of determining the day of any given date which is applicable for any number of years even to the time of BCE. I had provided the detailed mathematical derivation of month codes which were key factors in determining the day of any given date. Though the procedures for determining the day of given date are quite well known, the way in which they arrived is not so well known. This paper will throw great detail in that aspect. To be precise, I had explained the formula obtained by German Mathematician Zeller in detail and tried to simplify it further which will reduce its complexity and at the same time, would be as effective as the original formula. The explanations for Leap Years and other astronomical facts were clearly presented in this paper to aid the derivation of the compact form of Zeller’s Formula. Some special cases and illustrations are provided wherever necessary to clarify the computations for better understanding of the concepts. Keywords Leap Years, Congruence, Modulo Arithmetic, Ceiling Function, Floor Function, Centurial Years, Month Codes 1. Introduction Ever since humans came to understand the functioning of universe for various reasons, various forms of calendars have been put in to use. Different civilizations used different calendars. Since October 1582, when Pope Gregory XIII introduced a new calendar as a correction to then existing Julian Calendar, various parts of the globe at different times, adopted the new calendar. At present, the calendar introduced by Pope Gregory XIII was followed throughout the globe and it was named in his honour as “Gregorian Calendar”. Before we start our actual mathematical investigation, we glance through the basic structure of Gregorian calendar system. The Gregorian calendar is a solar calendar with 12 months of 28–31 days each. A regular Gregorian year consists of 365 days, but in certain years known as leap years, a leap day is added to February. Gregorian years are identified by consecutive year numbers. Various countries had their own beginning of the year until in recent centuries everyone had accepted the fact that January 1 as the beginning of a New Year. Thus, the present Gregorian calendar consider one year from 1st January to 31st December of any year containing 12 months and 365/366 days. In ancient times, astronomers knew only about seven planets. Probably this might be the reason for fixing seven days for a week. Hence, all the calendar calculations regarding determination of day of a given date were based on the number 7. Thanks to various mathematicians and astronomers we now have a global calendar satisfying our needs. Mathematics and Statistics 8(5): 590-595, 2020 591 2. Leap Years calendars for the years 1487, 1887, 2287, 2687. ... are identical. In the Gregorian calendar, the orbital period of the Earth Note that when we apply Cyclic Property rule for years around the Sun is not 365 days, but closer to 365.2425 days. occurring in BCE time, we should add 1 to 400 and make it To account for this longer period, every four years, we add 401, since there is no year 0 between 1 BCE and 1 CE. an extra day (since 0.25 × 4 = 1) in February, to make 366 Thus, the calendar for the year 44 BCE in which Julius days. Ceasar was assassinated would be same as – 44 + 401 = But observe that 365.25 – 365.2425 = 0.0075. So adding 357 CE which would be same as for the years 757, 1157, 1 day in February for every 4 years will produce an over 1557, 1957, 2357, . . . estimate of 0.0075 × 4 = 3 days. To bring down these 3 days, it is suggested that the years like 1600, 1700, 1800, 1900, 2000, 2100, . . . (called centurial years) which are 4. Known Formula for Determining divisible by 4, would be considered as leap years if they are Day of Given Date not only divisible by 4 but also by 400. This arrangement ensures us to count only 1 leap year and leaves 3 years Exactly 300 years after Gregorian calendar got among any consecutive 400 years period like 1301 – 1600, introduced; the problem of finding day of a given date in 1601 – 2000, 2001 – 2400, etc. compact computable form was studied by German Thus, among the period of 400 years from 1601 – 2000, mathematician Julius Christian Johannes Zeller, who the years 1700, 1800, 1900 were not leap years though they published an elegant algorithm for the same in 1882. Now are divisible by 4 but not by 400, whereas, 2000 is a leap this algorithm was named after him as “Zeller’s year since it is divisible by both 4 and 400. In this Congruence”. viewpoint, we present the following rule for a year being a According to Zeller’s Congruence rule, the day of any Leap Year (which will be crucial for our task of finding day date of the form d/m/Y (d – date, m – month, Y – Year) is of given date): given by “Every year that is exactly divisible by 4 is a leap year,  13(m  1)  Y   Y   Y   Y       except for years that are exactly divisible by 100, but these d   (mod 7)  (1)  5    4  100   400    centurial years are leap years if they are exactly divisible by 400.” Here,  x  is called the Floor Function or Greatest As a consequence of the above rule, we see that, in the century from 1601 – 1700, there are 24 leap years (as 1700 Integer Function of x . is not a leap year). Similarly, the centuries 1701 – 1800,  x  is defined to be greatest integer  x . As a 1801 – 1900 each contain 24 leap years (since 1800, 1900 are not leap years) but the century 1901 – 2000 contain 25 consequence of this definition, we find that if x  0 such x  a  d1d2 d3d4  then a  d1d2 d3d4   a . leap years as 2000 is a leap year. Hence in every period of that four consecutive centurial years, there will be (24×3) + 25 Similarly, if x  0 such that a  0 and if = 97 Leap years for every 400 years in Gregorian calendar. x   a  d1d2 d3d4  then a  d1d2 d3d4   a 1 . 3. Cyclic Property of Gregorian Calendar In a period of every 400 years like say 1701 – 2000 or 2001 – 2400, ... we will find the total number of days. As there are 97 leap years in every 400 years the total number of days would be given by (365 × 303) + (366 × 97) = 110595 + 35502 = 146097. Since 146097  20871 , the total number of days in every 7 400 years namely 146097 is exactly divisible by 7, it follows that there are exactly 20871 weeks in a period of every 400 years. Hence the whole system of Gregorian calendar years repeats for every 400 years. This phenomenon can be termed as “Cyclic Property” of Gregorian calendar. Due to this, we see that the calendar for the year 1582 (in which modern Gregorian calendar) was introduced will be same as the years 1982, 2382, 2782, ... Similarly, the For example,  2  1,     0,      2 .  4   2    Similarly, (mod 7) denote the remainder when the whole term inside the bracket is divided upon by 7. 5. Explanation of Zeller’s Congruence Rule Let us first rewrite the Zeller’s Congruence Formula and try to understand it in a better perspective.  13(m  1)  Y   Y   Y   Y       d   (mod 7)  (1)  5    4  100   400    3  m  14 For a given date of the form d/m/Y, where d, m, Y represents the date, month and year respectively, we note that Zeller’s Formula in (1) contain 6 terms inside the bracket. The first and third terms d and Y are included as it 592 Determining Day of Given Date Mathematically is for computation. Using the Leap year rule mentioned in 2., we get the fourth, fifth and sixth terms given by Y   Y   Y   4   100    400  The second term regarding month m need little explanation. When making these calculations, Zeller made a novel approach by beginning the year with the month of March (instead of January) and ending with February of next subsequent year. With this assumption, the twelve months of a year in formula (1), is considered from m = 3,4,5,...,14 where m = 3 corresponding to March, m = 4 for April and so on until m = 12 for December, m = 13 for January and m = 14 for February but Zeller took Y – 1 instead of Y for the months January and February. Thus for example, for calculating day corresponding to any date of January 2020, according to Zeller’s formula we should consider m = 13 and Y = 2019 (As beginning with March of 2019, January 2020 is viewed as 13th month of 2019). Similarly, for finding any date corresponding to February 2020, we should consider m = 14 since this is considered as 14th and last month of the year 2019. This explains the reason for the term m = 3,4,5,...,14 associated with the formula (1). Considering the shift of year beginning from January to March, the number of days in each month is as follows: {31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28/29} corresponding to the number of days from months March to February. Since any week contain seven days we shall modulo 7 (that is, divide each number by 7 and take the remainders) giving {3, 2, 3, 2, 3, 3, 2, 3, 2, 3, 3, 0}. If we now cumulative sum of five consecutive numbers from the above list we get 3 + 2 + 3 + 2 + 3 = 13, 2 + 3 + 2 + 3 + 3 = 13, 3 + 2 + 3 + 3 + 2 = 13, and so on. In general, any set of five consecutive numbers from the above modulo list of numbers will constitute three 3’s and two 2’s always giving a sum of 13. So for every 5 numbers we get a sum of 13. This explains the reason for the term 13/5 in the second term of formula (1). Since any week day should be one of seven days, we finally divide the answer obtained through 6 terms of the formula by 7 and take out the remainder explaining the term (mod 7) in the formula. We know that when any integer is divided by 7, the possible remainders are 0, 1, 2, 3, 4, 5, 6. Now depending upon the remainder, we shall consider the following assignment of days corresponding to these remainders to decide the day of a given date. 0 – Saturday, 1 – Sunday, 2 – Monday, 3 – Tuesday, 4 – Wednesday, 5 – Thursday, 6 – Friday. 6. Sample Computations (i) Let us determine the day of 1/1/1 the first day of Common Era denoted by CE. By cyclic property of Gregorian calendar, we can find the day for 1/1/401 instead of 1/1/1. Here d = 1, m = 13, Y = 400 (Since it is January) Zeller’s Congruence yields the following value: 400 400 13 × (13 + 1) ⌋ + 400 + ⌊ ⌋−⌊ ⌋ (1 + ⌊ 4 100 5 400 +⌊ ⌋) (𝑚𝑜𝑑 7) 400 = (1 + 36 + 400 + 100 − 4 + 1)(𝑚𝑜𝑑 7) = 2 Since 2 correspond to Monday, it follows that the first day of Common Era (CE) is a Monday. (ii) Let us now find on what day does the most famous physicist of 20th Century Albert Einstein was born? It is known that he was born on 14th March (Incidentally, it was now celebrated as world Pi Day) of 1879. Thus we have d = 14, m = 3, Y = 1879. Using Zeller’s formula we get: 1879 1879 13 × (3 + 1) ⌋ + 1879 + ⌊ ⌋−⌊ ⌋ (14 + ⌊ 4 100 5 1879 +⌊ ⌋) (𝑚𝑜𝑑 7) = 6 400 Since 6 correspond to Friday, we know that Albert Einstein was born on Friday. Similar to these calculations, it is possible for us to determine the day of any given date. Note that if the date correspond to BCE, then add 401 and convert it in to CE, then proceed in the same way as presented above. Now that I have explained the formation and application of the Zeller’s Congruence Formula, I will present ways to reduce the complexity of the formula presented above and also derive the month codes which will be used for several centuries at the same time thanks to Cyclic property of Gregorian calendar. 7. Rewriting Zeller’s Formula We see that if the year number Y is quite large as in the case for Einstein date, it is usually difficult to perform the calculation in our mind. We can reduce the size of Y suitably and make Zeller’s original formula in much more compact way. In this part, I provide mathematical proofs for doing that. If Y = 100c + y, where c denote the first two digits of Y and y denote the last two digits of Y. Note here that y varies from 0 to 99 (both 0 and 99 inclusive). With this assumption, we will calculate the third, fourth, fifth and sixth terms involved in Zeller’s Formula. (i) Reduction of Third Term: Y (mod 7)  (100c  y) (mod 7)  (2c  y) (mod 7) Mathematics and Statistics 8(5): 590-595, 2020 593 13(m  1)  13(4  1)  (April) m 4   (mod 7)   5  (mod 7)  6 5  (ii) Reduction of Fourth Term 𝑌 100𝑐 + 𝑦 ⌊ ⌋ (𝑚𝑜𝑑 7) = ⌊ ⌋ (𝑚𝑜𝑑 7) 4 4 𝑦 = ⌊25𝑐 + ⌋ (𝑚𝑜𝑑 7) 4 𝑦 ≡ (4𝑐 + ⌊ ⌋) (𝑚𝑜𝑑 7) 4 13(m  1)  13(5  1)  m 5  (mod 7)   (mod 7) 1  5    5  (May) 13(m  1)  13(6  1)  m6  (mod 7)   (mod 7)  4  5    5  (June) (iii) Reduction of Fifth Term 100𝑐 + 𝑦 𝑌 ⌋ (𝑚𝑜𝑑 7) = ⌊ ⌋ (𝑚𝑜𝑑 7) ⌊ 100 100 𝑦 = ⌊𝑐 + ⌋ (𝑚𝑜𝑑 7) 100 ≡ (𝑐 + 0)(𝑚𝑜𝑑 7) = 𝑐(𝑚𝑜𝑑 7) 13(m  1)  13(7  1)  m7  (mod 7)     (mod 7)  6 5 5    (July) (iv) Reduction of Sixth Term 100𝑐 + 𝑦 𝑌 ⌋ (𝑚𝑜𝑑 7) = ⌊ ⌋ (𝑚𝑜𝑑 7) ⌊ 400 400 𝑦 𝑐 𝑐 ⌋ (𝑚𝑜𝑑 7) ≡ ⌊ ⌋ (𝑚𝑜𝑑 7) =⌊ + 4 4 100 Substituting these in the original Zeller’s formula we get 𝑌 𝑌 𝑌 (𝑌 + ⌊ ⌋ − ⌊ ⌋+⌊ ⌋) (𝑚𝑜𝑑 7) 4 100 400 𝑦 = ((2𝑐 + 𝑦) + 4𝑐 + ⌊ ⌋ − 𝑐 4 𝑐 + ⌊ ⌋) (𝑚𝑜𝑑 7) 4 𝑐 𝑦 = (𝑦 + ⌊ ⌋ + ⌊ ⌋ + 5𝑐) (𝑚𝑜𝑑 7) 4 4 𝑦 𝑐 ≡ (𝑦 + ⌊ ⌋ + ⌊ ⌋ − 2𝑐) (𝑚𝑜𝑑 7) 4 4 Thus the original Zeller’s formula now becomes   13(m  1)   y c   y        2c  (mod 7)  (2)  d   5 4 4         Equation (2) is a concise formula to find the day of any given date compared to the calculation involved through Equation (1). Moreover, Equation (2) is the usual reference of Zeller’s formula in many sources for which we have obtained a mathematical derivation. We shall call Equation (2) as modified Zeller’s Formula. 13(m  1)  13(8  1)  m 8   (mod 7)   5  (mod 7)  2 5  (August) 13(m  1)  13(9  1)  m9   (mod 7)   5  (mod 7)  5 5  (September) 13(m  1)  13(10  1)  m 10   (mod 7)     (mod 7)  0 5 5    (October) 13(m  1)  13(11  1)  (mod 7)   m 11    (mod 7)  3 5 5    (November) 13(m  1)  13(12  1)  m 12   (mod 7)     (mod 7)  5 5 5    (December) Since January and February months are considered for the previous year, we have to subtract 1 from the original second term to get correct codes for these months. Thus, we obtain 13(m  1)  13(14  1)  m 13    1 (mod 7)    1 (mod 7)  0 5 5     (January) 13(m  1)  13(14  1)  m 14    1 (mod 7)    1 (mod 7)  3 5 5     (February) 8. Derivation of Month Codes In 7., we saw the reduction of Year number Y considerably with lesser numbers c, y. Here we use Equation (2) to derive month codes which will further reduce our calculation of finding day of any given date. First, let us substitute each value of m from 3 to 14 (from March to February) successively in the second term ofZeller’s formula which contains the information about months. 13(m  1)  13(3  1)  m  3  (mod 7)   (mod 7)  3  5    5  (March) Thus the month codes beginning from January to December would be the following numbers respectively: 0,3,3, 6,1, 4, 6, 2,5, 0,3, 5  (3) Now, keeping the Cyclic Property in mind, we first segregate the centuries for every 400 years in to four classes as Class I: (1 – 100, 401 – 500, 801 – 900, 1201 – 1300, 1601 – 1700, 2001 – 2100, 2401 – 2500, 2801 – 2900, ...) Class II: (101 – 200, 501 – 600, 901 – 1000, 1301 – 1400, 1701 – 1800, 2101 – 2200, 2501 – 2600, 2901 – 3000, . . . ) Class III: (201 – 300, 601 – 700, 1001 – 1100, 1401 – 594 Determining Day of Given Date Mathematically 1500, 1801 – 1900, 2201 – 2300, 2601 – 2700, 3001 – 3100, . . . ) Class IV: (301 – 400, 701 – 800, 1101 – 1200, 1501 – 1600, 1901 – 2000, 2301 – 2400, 2701 – 2800, 3101 – 3200, . . . ) Note that according to the cyclic property, the days of each century in the corresponding class would be same. Hence, I try to derive the month codes each for the above four classes which will eventually cover all centuries. Now considering current century years which is from 2001 to 2100 beginning to Class I of our segregation, we find that c = 20. With this value of c, we try to compute fifth and sixth terms of the modified Zeller’s formula given in Equation (2).  c  20      c   4   2c  (mod 7)       20   4   2  20  (mod 7)  0  (Class I). Similarly considering the century from 1701 – 1800 belonging to Class II, we get c = 17. Doing as above, we obtain  c 17      c   4   2c  (mod 7)      17   4   2 17  (mod 7)  5  (Class II) Similarly considering 1801 – 1900 corresponding to Class III and 1901 – 2000 of Class IV we obtain  c    18   c 18      2c  (mod 7)      2 18  (mod 7)  3 4 4         (Class III)  c    19   c 19      2c  (mod 7)      2 19  (mod 7) 1  4   4   (Class IV) quick reference. Class I : 0, 3, 3, 6, 1, 4, 6, 2, 5, 0, 3, 5. Class II : 5, 1, 1, 4, 6, 2, 4, 0, 3, 5, 1, 3 (Class I codes + 5) (mod 7) Class III : 3, 6, 6, 5, 4, 0, 2, 5, 3, 3, 6, 1 (Class I codes + 3) (mod 7) Class IV : 1, 4, 4, 0, 2, 5, 0, 3, 6, 1, 4, 6 (Class I codes + 1) (mod 7) Remarks: Note that upon applying these month codes to find day of a given date, we should follow the three rules given below: (i) Subtract 1 from the month codes corresponding to January/February of normal leap years which are divisible by 4 except the centurial leap years like 400, 800, 1200, 1600, 2000, 2400,. . . (ii) Subtract 2 from the month codes corresponding to any month for all centurial non – leap years like 100, 200, 300, 500, 600, 700, 900, 1000, 1100, 1300, . . . (iii) Subtract 1 for all months from March to December and 2 for January/February for centurial leap years like 400, 800, 1200, 1600, 2000, . . . 9. Simplification of Actual Formula Using these month codes, we can greatly simplify the modified Zeller’s Formulas given in Equation (2). If we do so, we get the following compact formula:   y whereM is the month  d  M  y   4   (mod 7)  (4)     code for the century belonging to one of the four classes mentioned above. The formula described in Equation (4) is usually presented in many books and online sources for determining day of a given date. I have just provided the mathematical proof for arriving that result. We now consider three illustrations to justify the formula described by Equation (4). (i) Let us consider SrinivasaRamanujan’s Birthdate which is on 22/12/1887. First we notice that the year 1887 lies in Class III. Hence M = 1 (the month code for December in Class III). Also d = 22, y = 87. Hence by Equation (4) we have The final answers namely 0, 5, 3, 1 for centuries belonging to corresponding classes will fix the month codes required for easy computation of the day of a given date. Since for Class I, the answer is 0, the month codes for any century belonging to Class I are given by precisely Equation (3) namely: 0, 3, 3, 6, 1, 4, 6, 2, 5, 0, 3, 5. Now since the answer for Class II is 5, the month codes for any century belonging to Class II are obtained by just adding (modulo 7) to each of the month codes of Class I given above.   87   . Since5 correspond to  22 1  87   4   (mod 7)  5 Thus the month codes for Class II centuries are: 5, 1, 1, 4,    6, 2, 4, 0, 3, 5, 1, 3. Thursday, we can conclude that one of the greatest In similar fashion, by adding 3 and 1 respectively to mathematicians of India, Srinivasa Ramanujan was month codes of Class I, we get month codes of each born on Thursday. century belonging to Class III and Class IV. (ii) Let us consider the Birthdate of another famous living The month codes for Class III centuries are: 3, 6, 6, 5, 4, great Indian mathematician C.S. Seshadri who was 0, 2, 5, 3, 3, 6, 1 born on 29/2/1932. We notice that 1932 correspond to The month codes for Class IV centuries are: 1, 4, 4, 0, 2, Class IV and 1932 is a normal leap year. Hence, M = 4 5, 0, 3, 6, 1, 4, 6 – 1 = 3 (month code of February – 1) according to rule (i) presented in the Remarks presented above. Also, d We thus summarize the month codes of each Class for Mathematics and Statistics 8(5): 590-595, 2020 = 29, y = 32. Hence by Equation (4), we have   32   29  3  32  (mod 7)  2 . Since, 2 correspond to    4    595 subtract 1 from the actual to get M = 6 – 1 = 5. Using these values of M, we can determine the days for the required four dates as follows: 31/12 /1700  3  3 (mod 7)  6 which is on Friday. Monday, we know that C.S. Seshadri was born on Monday, but unfortunately he could celebrate his is on 31/12 /1800  3 1 (mod 7)  4 which birthday once in four years only. (iii) Let us now consider the date 18/8/1900 the Birthdate Wednesday 31/12 /1900  3  6  (mod 7)  2 which is on Monday of Smt. Vijayalakshmi Pandit, sister of Jawaharlal Nehru, the first Prime Minister of India. Note that 31/12 / 2000  3  5 (mod 7) 1 which is on Sunday 1900 is a centurial year and it belongs to 8th month of Thus by cyclic property of every 400 years in Gregorian Class III. Hence M  5  2  3 (month code of calendar, we see that the end of a century cannot occur on August – 2). Here, d = 18, y = 0. Hence by Equation (4) Tuesday or Thursday or Saturday. we have 18  3  0  0  (mod 7)  0 . Since, 0 correspond to Saturday, we can conclude that Smt. Vijayalakshmi Pandit was born on Saturday. Thus depending on a normal year, normal leap year or centurial year knowing the class in which the given date belong, we can immediately compute the day quite easily without using any tools. 11. Conclusions The aspects of making Gregorian calendar and process of arriving the formulas and month codes were explained mathematically in this paper. With little practice, one can easily determine the day of any given date without having to seek any source from electronic equipments. 10. Proving an Important Fact Using Equation (4) along with the rules presented in Remarks, we can prove the following interesting but important calendar fact mathematically. Theorem: “The last day of a century cannot be a Tuesday, Thursday or Saturday” Proof: Because of the cyclic property, it is enough to consider the dates 31/12/1700, 31/12/1800, 31/12/1900 and 31/12/2000 as these dates correspond to date of end of 17th, 18th, 19th and 20th centuries. Since y = 0 for all these four dates, the third and fourth terms in Equation (4) namely   y   becomes 0. We also note that d = 31 for all these  y4    four dates. Since 31  3(mod 7) , from Equation (4), we see that the day corresponding to these four dates would be of the form  3  M  (mod 7) , where M is the month code corresponding to December month of respective centuries. We know that the years 1700, 1800, 1900 and 2000 correspond to classes I, II, III and IV respectively. Now for the three centurial non – leap years 1700, 1800, 1900 we need to subtract 2 from the actual month codes given by their respective classes. In doing so, we get M = 5 – 2 = 3 (for 1700), M = 3 – 2 = 1 (for 1800), M 1 2  1  6(mod 7) (for 1900). For the centurial leap year 2000, according to rule (iii) in Remarks of 8, since the month is a December, we should REFERENCES [1] Zeller, Christian, "Die Grundaufgaben der Kalenderrechnung auf neue und vereinfachte Weise gelöst". WürttembergischeVierteljahrsheftefürLandesgeschichte (in German), Issue V, pp. 313–314, 1882. [2] Zeller, Christian, "Kalender-Formeln". Mathematisch-natur wissenschaftlicheMitteilungendes mathematisch-naturwiss enschaftlichenVereins in Württemberg (in German). Volume 1 (1): pp. 54–58, 1885. [3] V. F. Rickey, “Mathematics of the Gregorian calendar”, Math. Intelligencer, Volume 7, pp. 53-56, 1985. [4] J. Dutka, “On the Gregorian revision of the Julian calendar”, Math. Intelligencer, Volume 10, pp. 56-64, 1988. [5] G. Moyer, “The Gregorian calendar’, Sci. Amer., Vol. 246, Issue 5, pp. 144-152, May 1982. [6] W. M. Feldman, “Rabbinical Mathematics and Astronomy”, M. L. Cailingold, London, 1931; 3rd corrected ed., Sepher-Hermon, New York, 1978. [7] E. M.’Reingold, J. Nievergelt and N. Deo, “Combinatorial Algorithms: Theory and Practice”, Prentice-Hall, Englewood Cliffs, NJ, 1977. [8] J. V. Uspensky and M. A. Heaslet, “Elementary Number Theory”, McGraw-Hill, New York, 1939. [9] Black Paul E., NIST document, “Zeller’s Congruence”, Dictionary of Algorithms and Data Structures, Webpage. [10] Webpage of Data Genetics blog, Zeller’s Congurence” at http://datagenetics.com/blog/november12019/index.html