Using Simple Linear Models with Truncation to Determine the Gregorian Day of the Week

TL;DR

This paper introduces a new algorithm for calculating the day of the week for any Gregorian date using simple linear models with truncation, eliminating the need for lookup tables or relabeling, thus enhancing computational simplicity and efficiency.

Contribution

The novel algorithm employs linear regression with truncation to accurately determine weekdays without relying on stored tables or re-labeling, improving ease of implementation.

Findings

Accurately computes weekdays for any Gregorian date.

Eliminates the need for lookup tables or relabeling.

Maintains high accuracy with simple linear models.

Abstract

The Gregorian calendar -- first established for daily use on Friday, October 15th, 1582 by Pope Gregory XIII in Catholic countries -- is presently the most pervasive calendar in the world. As such, algorithms for performing various calendrical computations in accurate, performant, and easily implementable ways are extremely useful in fields like software engineering. In this paper, we present a novel algorithm for determining the day of the week for any date in the Gregorian calendar. Of note, our algorithm does not rely on remembering tables of values. Instead, we encode tables needed for computation using simple linear regression with truncation to adjust for any errors present in our linear models in such a way that no tables have to be recalled. In addition, our algorithm does not require a relabeling of days, weeks, months, or years to values other than their intuitive representations. The algorithm works by taking a date in the Gregorian calendar, calculating the number of days (accounting for leap years using simple linear regression with truncation) that have elapsed since the epoch of the Gregorian calendar in 1582 from the specified date and adding this number modulo 7 to the epoch's day of the week thus, obtaining the day of the week for the requested date in numeric form.