Easter Sunday computation

[Moneo]

what I saw on the website weren't specifications but ALMOST code.

Had to replace x with * and set all vars to integers..

2003 = 4, 20.

Code:

CLS
DIM year AS INTEGER, a AS INTEGER, b AS INTEGER, c AS INTEGER
DIM d as integer, e AS INTEGER, f AS INTEGER, g AS INTEGER
DIM h AS INTEGER, i AS INTEGER, j AS INTEGER, k AS INTEGER,
DIM l AS INTEGER, m AS INTEGER, n AS INTEGER, o AS INTEGER

INPUT year

a = year MOD 19
b = year \ 100
c = year MOD 100
d = b \ 4
e = b MOD 4
f = (b + 8) \ 25
g = (b - f + 1) \ 3
h = ((19 * a) + b - d - g + 15) MOD 30
i = c \ 4
j = c MOD 4
k = (32 + 2 * e + 2 * i - h - j) MOD 7
l = (a + 11 * h + 22 * k) \ 451
m = (h + k + 7 * l + 114)
n = m \ 31
o = m MOD 31 + 1
PRINT n; o

Hmmmmmmmmm...... "Mexico QB Central" or "QB Mexico Central"

**************************************************
Ok, you now have some virgin code for an intricate problem. Get youself a copy of The Farmer's Almanac, which has a long list of dates for Easter Sunday, and check out about 50 random years, going back about 200 years and forward for about 200 years. Make sure to select a good number of leap years. When you've done this, and the dates check out exactly, you can consider that the routine works in general. When you get to this point, let me have a crack at testing it.
P.S. While testing my version, I discovered that the MOD instruction in QB does not work on negative number. I had to do this function the long way.
Have fun!
P.S. This "QB Central" guy now lives in Mexico City but was born and learned how to program in New York, New York.
*****************************************************