To determine the day of the week from numerical operations, Sunday through Saturday are represented as numbers which may, corresponding to Sunday being the first day of the week, be 1 to 7 (or 0, rejecting whole sevens) respectively, which is equivalent to ISO 8601's alternative usage of 1 = Monday to 7 = Sunday). This is achieved with arithmetic modulo 7. Modulo 7 is an operation that calculates the remainder of a number being divided by 7. Thus the number 7 is treated as 0, 8 as 1, 9 as 2, 18 as 4 and so on; the interpretation of this being that if Sunday is signified as day 1, then 7 days later (i.e. day 8) is also a Sunday, and day 18 will be the same as day 4, which is a Wednesday since this falls three days after Sunday.

The basic approach of nearly all of the methods to calculate the day of the week begins by starting from an ‘anchor date’: a known pair (such as January 1, 1800 as a Wednesday), determining the number of days between the known day and the day that you are trying to determine, and using arithmetic modulo 7 to find a new numerical day of the week.

One standard approach is to look up (or calculate, using a known rule) the value of the first day of the week of a given century, look up (or calculate, using a method of congruence) an adjustment for the month, calculate the number of leap years since the start of the century, and then add these together along with the number of years since the start of the century, and the day number of the month. Eventually, one ends up with a day-count to which one applies modulo 7 to determine the day of the week of the date.

Some methods do all the additions first and then cast out sevens, whereas others cast them out at each step, as in Lewis Carroll's method. Either way is quite viable: the former is easier for calculators and computer programs; the latter for mental calculation (it is quite possible to do all the calculations in one's head with a little practice). None of the methods given here perform range checks, so unreasonable dates will produce erroneous results.

"Corresponding months" are those months within the calendar year that start on the same day. For example, September and December correspond, because September 1 falls on the same day as December 1. Months can only correspond if the number of days between their first days is divisible by 7, or in other words, if their first days are a whole number of weeks apart. For example, February of a year which is not a leap year corresponds to March because February has 28 days, a number divisible by 7, 28 days being exactly four weeks. In a leap year, January and February correspond to different months than in a common year, since adding February 29 means each subsequent month starts a day later.

The months correspond thus:

For common years:

January and October.
February, March and November.
April and July.
No month corresponds to August.
For leap years:

January, April and July.
February and August.
March and November.
No month corresponds to October.
For all years:

September and December.
No month corresponds to May and June.
In the months table below, corresponding months have the same number, a fact which follows directly from the definition.

There are seven possible days that a year can start on, and leap years will alter the day of the week after February 29. This means that there are 14 configurations that a year can have. All the configurations can be referenced by a Dominical letter, but as February 29 has no letter allocated to it a leap year has two dominical letters, one for January and February and the other (one step back in the alphabetical sequence) for March to December. For example, 2017 is a common year starting on Sunday, meaning that 2017 corresponds to the 2006 calendar year and with the first 2 months corresponds to the 2012 calendar year. 2018, on the other hand, is a common year starting on Monday, meaning that 2018 corresponds to the 2007 calendar year and with the last 10 months corresponds to the 2012 calendar year.

This method is valid for both the Gregorian calendar and the Julian calendar. Britain and its colonies started using the Gregorian calendar on Thursday, September 14, 1752; the previous day was Wednesday, September 2, 1752 (old style). The areas now forming the United States adopted the calendar at different times depending on the colonial power: Spain and France had been using it since 1582, while Russia was still using the Julian calendar when Alaska was purchased from it in 1867.

The formula is
(
d
+
m
+
y
+
⌊
y
4
⌋
+
c
)
mod
7
, where:

d is the day of the month,
m is the month's number as computed by Kraitchik (see "Kraitchik's variation" below) and given in the "Complete table: Julian and Gregorian calendars" below
y is the last two digits of the year, and
c is the century's number, found in the same manner as the "month's number" above.
If the result is 0, the date was a Saturday; if 1 it was a Sunday, and so on through the week until 6 = Friday.

For the Gregorian date of January 1, 2000 (a leap year):

The day of the month: 1
January in the months table: 6
Last two digits of year: 0
Last two digits of year divided by 4: 0
Century number: 0
The result is 7, leaving a remainder of 0 when divided by 7, so January 1, 2000 was a Saturday.

For the Julian date of October 13, 1307:

The day of the month: 13
October in the months table: 0
Last two digits of year: 7
Last two digits of year divided by 4: 1
Century number: 6
The result is 27, leaving a remainder of 6 when divided by 7, so October 13, 1307 was a Friday.

For Julian dates before 1300 and after 1999 the year in the table which differs by an exact multiple of 700 years should be used. For Gregorian dates after 2299, the year in the table which differs by an exact multiple of 400 years should be used. The values "r0" through "r6" indicate the remainder when the Hundreds value is divided by 7 and 4 respectively, indicating how the series extend in either direction. Both Julian and Gregorian values are shown 1500–1999 for convenience. Bold figures (e.g., **04**) denote leap year. If a year ends in 00 and its hundreds are in bold it is a leap year. Thus 19 indicates that 1900 is not a Gregorian leap year, (but **19** in the Julian column indicates that it *is* a Julian leap year, as are all Julian *x*00 years). **20** indicates that 2000 is a leap year. Use **Jan** and **Feb** only in leap years.

For determination of the day of the week (1 January 2000, Saturday)

the day of the month: 1 ~ 31 (1)
the month: (6)
the year: (0)
the century mod 4 for the Gregorian calendar and mod 7 for the Julian calendar (0).
adding 1+6+0+0=7. Dividing by 7 leaves a remainder of 0, so the day of the week is Saturday.
The formula is w = (d + m + y + c) mod 7.

Note that the date (and hence the day of the week) in the Revised Julian and Gregorian calendars is the same from 14 October 1923 to 28 February AD 2800 inclusive and that for large years it may be possible to subtract 6300 or a multiple thereof before starting so as to reach a year which is within or closer to the table.

To look up the weekday of any date for any year using the table, subtract 100 from the year, divide the difference by 100, multiply the resulting quotient (omitting fractions) by seven and divide the product by nine. Note the quotient (omitting fractions). Enter the table with the Julian year, and just before the final division add 50 and subtract the quotient noted above.

Example: What is the day of the week of 27 January 8315?

8315-6300=2015, 2015-100=1915, 1915/100=19 remainder 15, 19x7=133, 133/9=14 remainder 7. 2015 is 700 years ahead of 1315, so 1315 is used. From table: for hundreds (13): 6. For remaining digits (15): 4. For month (January): 0. For date (27): 27. 6+4+0+27+50-14=73. 73/7=10 remainder 3. Day of week = Tuesday.

To find the Sunday Letter, calculate the day of the week for either 1 January or 1 October. If it is Sunday, the Sunday Letter is A, if Saturday B, and similarly backwards through the week and forwards through the alphabet to Monday, which is G.

Leap years have two Sunday Letters, so for January and February calculate the day of the week for 1 January and for March to December calculate the day of the week for 1 October.

Leap years are all years which divide exactly by four with the following exceptions:

**In the Gregorian calendar** – all years which divide exactly by 100 (other than those which divide exactly by 400).

**In the Revised Julian calendar** – all years which divide exactly by 100 (other than those which give remainder 200 or 600 when divided by 900).

Use this table for finding the day of the week without any calculations.

Note: All the C days are doomsdays.

**Examples:**

For common method
*December 26, 1893 (GD)*
December is in row F and 26 is in column E, so the letter for the date is C located in row F and column E. 93 (year mod 100) is in row D (year row) and the letter C in the year row is located in column G. 18 ([year/100] in the Gregorian century column) is in row C (century row) and the letter in the century row and column G is B, so the day of the week is Tuesday.

*October 13, 1307 (JD)*
October 13 is a F day. The letter F in the year row (07) is located in column G. The letter in the century row (13) and column G is E, so the day of the week is Friday.

*January 1, 2000 (GD)*
January 1 corresponds to G, G in the year row (00) corresponds to F in the century row (20), and F corresponds to Saturday.

A pithy formula for the method: *"Date letter (G), letter (G) is in year row (00) for the letter (F) in century row (20), and for the day, the letter (F) become weekday (Saturday)"*.

For modified domimical letter method
*1783, September 18 (GD)*
Use 17 (in the Gregorian century row, column C) and 83 (in row C) to find the dominical letter that is E. The letter for September 18 is B, so the day of the week is Thursday.

*1676, February 23 (JD, non-OS)*
Use 16 (in the Julian century row, column E) and 76 (in row D) to find the dominical letter that is A. February 23 is a "D" day, so the day of the week is Wednesday.

In a handwritten note in a collection of astronomical tables, Carl Friedrich Gauss described a method for calculating the day of the week for 1 January in any given year. He never published it. It was finally included in his collected works in 1927.

Gauss' Method was applicable to the Gregorian calendar. He numbered the weekdays from 0 to 6 starting with Sunday. He defined the following operation: The weekday of 1 January in year number A is

R
(
1
+
5
R
(
A
−
1
,
4
)
+
4
R
(
A
−
1
,
100
)
+
6
R
(
A
−
1
,
400
)
,
7
)
where
R
(
y
,
m
)
is the remainder after division of y by m, or y modulo m.

This formula was also converted into graphical and tabular methods for calculating any day of the week by Kraitchik and Schwerdtfeger.

Another variation of the above algorithm likewise works with no lookup tables. A slight disadvantage is the unusual month and year counting convention. The formula is

w
=
(
d
+
⌊
2.6
m
−
0.2
⌋
+
y
+
⌊
y
4
⌋
+
⌊
c
4
⌋
−
2
c
)
mod
7
,
where

Y is the year minus 1 for January or February, and the year for any other month
y is the last 2 digits of Y
c is the first 2 digits of Y
d is the day of the month (1 to 31)
m is the shifted month (March=1,...,February=12)
w is the day of week (0=Sunday,...,6=Saturday)
For example, January 1, 2000. (year − 1 for January)

Note: The first is only for a 00 leap year and the second is for any 00 years.

The term ⌊2.6*m* − 0.2⌋ mod 7 gives the values of months: m

**Months m**
January 0
February 3
March 2
April 5
May 0
June 3
July 5
August 1
September 4
October 6
November 2
December 4

The term *y* + ⌊*y*/4⌋ mod 7 gives the values of years: y

**y mod 28 y**
01 07 12 18 –- 1
02 -– 13 19 24 2
03 08 14 –- 25 3
-- 09 15 20 26 4
04 10 –- 21 27 5
05 11 16 22 –- 6
06 -– 17 23 00 0

The term ⌊*c*/4⌋ − 2*c* mod 7 gives the values of centuries: c

**c mod 4 c**
1 5
2 3
3 1
0 0

Now from the general formula:
w
=
d
+
m
+
y
+
c
mod
7
; January 1, 2000 can be recalculated as follows:

Kraitchik proposed two methods for calculating the day of the week. One is a graphical method. The other uses a formula that he credits to Gauss on p. 110:

w
=
d
+
m
+
c
+
y
mod
7
,
where w is the day of the week (counting upwards from 1 on Sunday instead of 0 in Gauss's version); and d, m, c and y are numbers depending on the day, month, century and year which are tabulated in the "Complete table: Julian and Gregorian calendars" above. Note that the numbers tabulated for y can also be described by the following equation:

y
=
(
⌊
s
4
⌋
+
s
)
mod
7
Where

s is the last two digits of the year (i.e. if the year is 1987, s = 87)

y is ...

So, for example, if you want to find 'y' for the year 1987:

y
=
(
⌊
87
4
⌋
+
87
)
mod
7
=
(
21
+
87
)
mod
7
=
108
mod
7
=
3
In Zeller’s algorithm, the months are numbered from 3 for March to 14 for February. The year is assumed to begin in March; this means, for example, that January 1995 is to be treated as month 13 of 1994. The formula for the Gregorian calendar is

w
=
(
d
+
⌊
13
(
m
+
1
)
5
⌋
+
y
+
⌊
y
4
⌋
+
⌊
c
4
⌋
−
2
c
)
mod
7
,
where

Y is the year minus 1 for January or February, and the year for any other month
y is the last 2 digits of Y
c is the first 2 digits of Y
d is the day of the month (1 to 31)
m is the shifted month (March=3,...February=14)
w is the day of week (1=Sunday,..0=Saturday)
The only difference is one between Zeller’s algorithm (Z) and the Gaussian algorithm (G), that is *Z* − *G* = 1 = Sunday.

(
d
+
⌊
(
m
+
1
)
2.6
⌋
+
y
+
⌊
y
/
4
⌋
+
⌊
c
/
4
⌋
−
2
c
)
mod
7
−
(
d
+
⌊
2.6
m
−
0.2
⌋
+
y
+
⌊
y
/
4
⌋
+
⌊
c
/
4
⌋
−
2
c
)
mod
7
=
(
⌊
(
m
+
2
+
1
)
2.6
−
(
2.6
m
−
0.2
)
⌋
)
mod
7
(March = 3 in

Z but March = 1 in

G)

=
(
⌊
2.6
m
+
7.8
−
2.6
m
+
0.2
⌋
)
mod
7
=
8
mod
7
=
1
So we can get the values of months from those for the Gaussian algorithm by adding one:

**Months m**
January 1
February 4
March 3
April 6
May 1
June 4
July 6
August 2
September 5
October 0
November 3
December 5

In a tabular method by Schwerdtfeger, the year is split into the century and the two digit year within the century. The approach depends on the month. For `m` ≥ 3,

c
=
⌊
y
100
⌋
and
g
=
y
−
100
c
,
so `g` is between 0 and 99. For `m` = 1,2,

c
=
⌊
y
−
1
100
⌋
and
g
=
y
−
1
−
100
c
.
The formula for the day of the week is

w
=
d
+
e
+
f
+
g
+
⌊
g
4
⌋
mod
7
,
where the positive modulus is chosen.

The value of e is obtained from the following table:

The value of f is obtained from the following table, which depends on the calendar. For the Gregorian calendar,

For the Julian calendar,

Charles Lutwidge Dodgson (Lewis Carroll) devised a method resembling a puzzle, yet partly tabular in using equivalent values to those in the Corresponding months' table given above: he lists the same three adjustments for the first three months of non-leap years, one 7 higher for the last, and gives cryptic instructions for finding the rest; his adjustments for centuries are to be determined using formulas identical to those for the Centuries table. Although explicit in asserting that his method also works for Old Style dates, his example reproduced below to determine that "1676, February 23" is a Wednesday, only works on the New Style Julian calendar which starts the year on January 1, instead of March 25 as on the Old Style calendar:

**Algorithm:** Take the given date in 4 portions, viz. the number of centuries, the number of years over, the month, the day of the month. Compute the following 4 items, adding each, when found, to the total of the previous items. When an item or total exceeds 7, divide by 7, and keep the remainder only.

The Century-item For Old Style (which ended September 2, 1752) subtract from 18. For New Style (which began September 14) divide by 4, take overplus from 3, multiply remainder by 2.

The Year-item Add together the number of dozens, the overplus, and the number of 4s in the overplus.

The Month-item If it begins or ends with a vowel, subtract the number, denoting its place in the year, from 10. This, plus its number of days, gives the item for the following month. The item for January is "0"; for February or March, "3"; for December, "12".

The Day-item The total, thus reached, must be corrected, by deducting "1" (first adding 7, if the total be "0"), if the date be January or February in a leap year: remembering that every year, divisible by 4, is a Leap Year, excepting only the century-years, in New Style, when the number of centuries is not so divisible (e.g. 1800).

The final result gives the day of the week, "0" meaning Sunday, "1" Monday, and so on.

**Examples:**

*1783, September 18*
17, divided by 4, leaves "1" over; 1 from 3 gives "2"; twice 2 is "4". 83 is 6 dozen and 11, giving 17; plus 2 gives 19, i.e. (dividing by 7) "5". Total 9, i.e. "2" The item for August is "8 from 10", i.e. "2"; so, for September, it is "2 plus 31", i.e. "5" Total 7, i.e. "0", which goes out. 18 gives "4". Answer, "Thursday".

*1676, February 23*
16 from 18 gives "2" 76 is 6 dozen and 4, giving 10; plus 1 gives 11, i.e. "4". Total "6" The item for February is "3". Total 9, i.e. "2" 23 gives "2". Total "4" Correction for Leap Year gives "3". Answer, "Wednesday".

The latter result should be "Friday" for an Old Style date that on the Gregorian calendar is the same day as March 5 of the following year—just like the difference in years for George Washington's birthday between the two calendars. It is noteworthy that those who have republished Carroll's method have failed to notice his mistake, most notably Martin Gardner.

In 1752, the British Empire abandoned its use of the Old Style Julian calendar upon adopting the Gregorian calendar, which has become today's standard in most countries of the world. For more background, see Old Style and New Style dates.

In the C language expressions below, `y`, `m` and `d` are, respectively, integer variables representing the year (e.g., 1988), month (1-12) and day of the month (1-31).

In 1990, Michael Keith and Tom Craver published the foregoing expression that seeks to minimise the number of keystrokes needed to enter a self-contained function for converting a Gregorian date into a numerical day of the week. It preserves neither `y` nor `d`, and returns `0` = Sunday, `1` = Monday, etc.

Shortly afterwards, Hans Lachman streamlined their algorithm for ease of use on low-end devices. As designed originally for four-function calculators, his method needs fewer keypad entries by limiting its range either to A.D. 1905-2099, or to historical Julian dates. It was later modified to convert any Gregorian date, even on an abacus. On Motorola 68000-based devices, there is similarly less need of either processor registers or opcodes, depending on the intended design objective.

The tabular forerunner to Tøndering's algorithm is embodied in the following K&R C function. With minor changes, it is adaptable to other high level programming languages such as APL2. (A 6502 assembly language version exists as well). Posted by Tomohiko Sakamoto on the comp.lang.c Usenet newsgroup in 1992, it is accurate for any Gregorian date.

The function does not always preserve `y`, and returns `0` = Sunday, `1` = Monday, etc. In contrast, the following expression

posted simultaneously by Sakamoto is not only not easily adaptable to other languages, but may even fail if compiled on a computer that encodes characters using other than standard ASCII values (e.g. EBCDIC), or on C compilers that enforce ANSI C compliance (even on code that is still compliant with the original K&R C specification, where omitted type declarations are assumed to be integer). For the latter consideration alone, Sakamoto's more-verbose version might be considered non-portable, as might also that of Keith and Craver as well as the example code for Rata Die given below.

IBM's Rata Die method requires that one knows the day of the week of the first calendar date on the proleptic Gregorian calendar: January 1, AD 1. This has to be done to establish the remainder number based on which the day of the week is determined for the latter part of the analysis. By using a given day August 13, 2009 which was a Thursday as a reference, with *Base* and *n* being the number of days and weeks it has been since 01/01/0001 to the given day, respectively and *k* the day into the given week which must be less than 7, *Base* is expressed as

*Base* =

*7n* +

*k* (i)

Knowing that a year divisible by 4 or 400 is a leap year while a year divisible by 100 and not 400 is not a leap year, a software program can be written to find the number of days. The following is a translation into C of IBM's method for its REXX programming language. The function does not preserve *d*, except for dates in January.

It is found that `daystotal` is 733632 from the base date January 1, AD 1. This total number of days can be verified with a simple calculation: There are already 2008 full years since 01/01/0001. The total number of days in 2008 years not counting the leap days is 365×2008 = 732920 days. Assume that all years divisible by 4 are leap years. Add 2008/4 = 502 to the total; then subtract the 15 leap days because the years which are exactly divisible by 100 but not 400 are not leap. Continue by adding to the new total the number of days in the first seven months of 2009 that have already passed which are 31 + 28 + 31 + 30 + 31 + 30 + 31 = 212 days and the 13 days of August to get *Base* = 732920 + 502 – 20 + 5 + 212 + 13 = 733632.

What this means is that it has been 733632 days since the base date. Substitute the value of *Base* into the above equation (i) to get 733632 = 7×104804 + 4, *n* = 104804 and *k* = 4 which implies that August 13, 2009 is the fourth day into the 104805th week since 01/01/0001. 13 August 2009 is Thursday; therefore, the first day of the week must be Monday, and it is concluded that the first day 01/01/0001 of the calendar is *Monday*. Based on this, the remainder of the ratio *Base/7*, defined above as *k*, decides what day of the week it is. If *k* = 0, it’s Monday, *k* = 1, it’s Tuesday, etc.