Calendrical calculation

Last updated March 11, 2023

A calendrical calculation is a calculation concerning calendar dates. Calendrical calculations can be considered an area of applied mathematics. Some examples of calendrical calculations:

Converting a Julian or Gregorian calendar date to its Julian day number and vice versa .
The number of days between two dates, which is simply the difference in their Julian day numbers.
The dates of moveable holidays, like Christian Easter (the calculation is known as Computus) followed up by Ascension Thursday and Pentecost or Advent Sundays, or the Jewish Passover, for a given year.
Converting a date between different calendars. For instance, dates in the Gregorian calendar can be converted to dates in the Islamic calendar with the Kuwaiti algorithm.
Calculating the day of the week.

Calendrical calculation is one of the five major Savant syndrome characteristics.^[1]

Examples

Numerical methods were described in the Journal of the Department of Mathematics, Open University, Milton Keynes, Buckinghamshire (M500) in 1997 and 1998.^[2] The following algorithm gives the number of days (d) in month m of year y. The value of m is given on the right of the month in the following list:

January 11 February 12 March 1 April 2 May 3 June 4 July 5 August 6 September 7 October 8 November 9 December 10.

The algorithm enables a computer to print calendar and diary pages for past or future sequences of any desired length from the reform of the calendar, which in England was 3/14 September 1752. The article Date of Easter gives algorithms for calculating the date of Easter. Combining the two enables the page headers to show any fixed or movable festival observed on the day, and whether it is a bank holiday.

The algorithm utilises the integral or floor function: thus $\left\lfloor {x}\right\rfloor$ is that part of the number x which lies to the left of the decimal point. It is only necessary to work through the complete function when calculating the length of February in a year which is divisible by 100 without remainder. When calculating the length of February in any other year it is only necessary to evaluate the terms to the left of the fifth + sign. When calculating the length of any other month it is only necessary to evaluate the terms to the left of the third - sign.

$d=30+\left\lfloor {0.6m+0.4}\right\rfloor -\left\lfloor {0.6m-0.2}\right\rfloor -2\left\lfloor {m/12}\right\rfloor +\left\lfloor {m/12}\right\rfloor \left\lfloor {{\frac {y-1}{4}}-\left\lfloor {\frac {y-1}{4}}\right\rfloor +0.25}\right\rfloor$

+\left\lfloor {m/12}\right\rfloor \left\lfloor {\left\lfloor {\cfrac {\left\lfloor {0.3+{\cfrac {\left\lfloor {y/100}\right\rfloor -3}{4.5}}-\left\lfloor {\cfrac {\left\lfloor {y/100}\right\rfloor -3}{4.5}}\right\rfloor }\right\rfloor +99+100\left\lfloor {y/100-\left\lfloor {y/100}\right\rfloor }\right\rfloor }{100}}\right\rfloor -1}\right\rfloor

To find the length of, for example, February 2000 the calculation is

d=30+\left\lfloor {7.2+0.4}\right\rfloor -\left\lfloor {7.2-0.2}\right\rfloor -2+\left\lfloor {1999/4-\left\lfloor {1999/4}\right\rfloor +0.25}\right\rfloor

$+\left\lfloor {\cfrac {\left\lfloor {0.3+{\cfrac {20-3}{4.5}}-\left\lfloor {\cfrac {20-3}{4.5}}\right\rfloor }\right\rfloor +99}{100}}\right\rfloor -1$

$=30+7-7-2+\left\lfloor {499.75-499+0.25}\right\rfloor +\left\lfloor {\frac {\left\lfloor {0.3+3.77-3}\right\rfloor +99}{100}}\right\rfloor -1$

$=28+1+1-1$

$=29.$

Related Research Articles

In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the middle element of the array. If they are not equal, the half in which the target cannot lie is eliminated and the search continues on the remaining half, again taking the middle element to compare to the target value, and repeating this until the target value is found. If the search ends with the remaining half being empty, the target is not in the array.

The number $e$ , also known as Euler's number, is a mathematical constant approximately equal to 2.71828 that can be characterized in many ways. It is the base of the natural logarithms. It is the limit of $(1 + 1/ n) n$ as $n$ approaches infinity, an expression that arises in the study of compound interest. It can also be calculated as the sum of the infinite series

In mathematics and computer science, the floor function is the function that takes as input a real number $x$ , and gives as output the greatest integer less than or equal to $x$ , denoted $⌊ x ⌋$ or $floor(x)$ . Similarly, the ceiling function maps $x$ to the least integer greater than or equal to $x$ , denoted $⌈ x ⌉$ or $ceil(x)$ .

In mathematics, a cube root of a number $x$ is a number $y$ such that $y 3 = x$ . All nonzero real numbers, have exactly one real cube root and a pair of complex conjugate cube roots, and all nonzero complex numbers have three distinct complex cube roots. For example, the real cube root of $8$ , denoted $, is 2, because 23 = 8, while the other cube roots of 8 are and . The three cube roots of -27 i are$

Dominical letters or Sunday letters are a method used to determine the day of the week for particular dates. When using this method, each year is assigned a letter depending on which day of the week the year starts.

In statistics, a k-thpercentile, also known as percentile score or centile, is a score below which a given percentage k of scores in its frequency distribution falls or a score at or below which a given percentage falls . Percentiles are expressed in the same unit of measurement as the input scores, not in percent; for example, if the scores refer to human weight, the corresponding percentiles will be expressed in kilograms or pounds.

The determination of the day of the week for any date may be performed with a variety of algorithms. In addition, perpetual calendars require no calculation by the user, and are essentially lookup tables. A typical application is to calculate the day of the week on which someone was born or a specific event occurred.

In number theory, a formula for primes is a formula generating the prime numbers, exactly and without exception. No such formula which is efficiently computable is known. A number of constraints are known, showing what such a "formula" can and cannot be.

The Doomsday rule, Doomsday algorithm or Doomsday method is an algorithm of determination of the day of the week for a given date. It provides a perpetual calendar because the Gregorian calendar moves in cycles of 400 years. The algorithm for mental calculation was devised by John Conway in 1973, drawing inspiration from Lewis Carroll's perpetual calendar algorithm. It takes advantage of each year having a certain day of the week upon which certain easy-to-remember dates, called the doomsdays, fall; for example, the last day of February, 4/4, 6/6, 8/8, 10/10, and 12/12 all occur on the same day of the week in any year. Applying the Doomsday algorithm involves three steps: Determination of the anchor day for the century, calculation of the anchor day for the year from the one for the century, and selection of the closest date out of those that always fall on the doomsday, e.g., 4/4 and 6/6, and count of the number of days between that date and the date in question to arrive at the day of the week. The technique applies to both the Gregorian calendar and the Julian calendar, although their doomsdays are usually different days of the week.

In number theory, the integer square root (isqrt) of a non-negative integer n is the non-negative integer m which is the greatest integer less than or equal to the square root of n,

Zeller's congruence is an algorithm devised by Christian Zeller in the 19th century to calculate the day of the week for any Julian or Gregorian calendar date. It can be considered to be based on the conversion between Julian day and the calendar date.

In computing, the modulo operation returns the remainder or signed remainder of a division, after one number is divided by another.

The Engel expansion of a positive real number x is the unique non-decreasing sequence of positive integers $such that$

Approximations for the mathematical constant pi in the history of mathematics reached an accuracy within 0.04% of the true value before the beginning of the Common Era. In Chinese mathematics, this was improved to approximations correct to what corresponds to about seven decimal digits by the 5th century.

The ISO week date system is effectively a leap week calendar system that is part of the ISO 8601 date and time standard issued by the International Organization for Standardization (ISO) since 1988 and, before that, it was defined in ISO (R) 2015 since 1971. It is used (mainly) in government and business for fiscal years, as well as in timekeeping. This was previously known as "Industrial date coding". The system specifies a week year atop the Gregorian calendar by defining a notation for ordinal weeks of the year.

An ordinal date is a calendar date typically consisting of a year and a day of the year or ordinal day number, an ordinal number ranging between 1 and 366, though year may sometimes be omitted. The two numbers can be formatted as YYYY-DDD to comply with the ISO 8601 ordinal date format.

In mathematics, an infinite periodic continued fraction is a continued fraction that can be placed in the form

In modular arithmetic, Barrett reduction is a reduction algorithm introduced in 1986 by P.D. Barrett. A naive way of computing

The metallic means of the successive natural numbers are the continued fractions:

In computer science, merge-insertion sort or the Ford–Johnson algorithm is a comparison sorting algorithm published in 1959 by L. R. Ford Jr. and Selmer M. Johnson. It uses fewer comparisons in the worst case than the best previously known algorithms, binary insertion sort and merge sort, and for 20 years it was the sorting algorithm with the fewest known comparisons. Although not of practical significance, it remains of theoretical interest in connection with the problem of sorting with a minimum number of comparisons. The same algorithm may have also been independently discovered by Stanisław Trybuła and Czen Ping.

References

Edward M. Reingold and Nachum Dershowitz. Calendrical Calculations: The Ultimate Edition . Cambridge University Press; (2018). ISBN 978-0-521-88540-9

↑ "Unlocking the brain's potential". BBC. 10 March 2001. Retrieved 8 February 2021.
↑ Journal of the Department of Mathematics, M500 (ed. A D Forbes) Issue 157 (September 1997) p 21, Issue 160 (February 1998) pp 19-20 (contains typographical errors, corrected version below) and Issue 161 (April 1998) p 21. The M500 Society, Open University, Milton Keynes, Buckinghamshire.

This applied mathematics-related article is a stub. You can help Wikipedia by expanding it.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] "Unlocking the brain's potential". BBC. 10 March 2001. Retrieved 8 February 2021.

[2] Journal of the Department of Mathematics, M500 (ed. A D Forbes) Issue 157 (September 1997) p 21, Issue 160 (February 1998) pp 19-20 (contains typographical errors, corrected version below) and Issue 161 (April 1998) p 21. The M500 Society, Open University, Milton Keynes, Buckinghamshire.

[1]

[2]

Calendrical calculation

Contents

Examples

See also

Related Research Articles

References