I’ve always wondered how they figured this out.
The following algorithm for computing the date of Easter is based on the algorithm of Oudin (1940). It is valid for any Gregorian year, Y. All variables are integers and the remainders of all divisions are dropped. The final date is given by M, the month, and D, the day of the month.C = Y/100,
N = Y – 19*(Y/19),
K = (C – 17)/25,
I = C – C/4 – (C – K)/3 + 19*N + 15,
I = I – 30*(I/30),
I = I – (I/28)*(1 – (I/28)*(29/(I + 1))*((21 – N)/11)),
J = Y + Y/4 + I + 2 – C + C/4,
J = J – 7*(J/7),
L = I – J,
M = 3 + (L + 40)/44,
D = L + 28 – 31*(M/4).
Now the question is, which would take longer: working it by hand or putting it in to something like Excel?

Recent Comments