Easter Problem #2

Computer Science Level pending

Using the Wikipedia Georgian Easter algorithm , determine the earliest in year, most frequent and latest in year dates of Easter. Encode March as 0 and April as 1. Comstruct the answer as this computation: 1000000 ( 100 month earliest + dayOfMonth earliest ) + 1000 ( 100 month median + dayOfMonth median ) + 1 ( 100 month latest + dayOfMonth latest ) 1000000(100\text{month}_\text{earliest}+\text{dayOfMonth}_\text{earliest})+\\ 1000(100\text{month}_\text{median}+\text{dayOfMonth}_\text{median})+\\ 1(100\text{month}_\text{latest}+\text{dayOfMonth}_\text{latest}) .


The answer is 22119126.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

I computed the table of frequencies over a 760 millennia interval. 322 3684 323 7211 324 10844 325 14689 326 17752 327 22040 328 24850 329 25708 330 25280 331 25222 401 25708 402 24794 403 25709 404 24794 405 25722 406 25265 407 25308 408 25722 409 24850 410 25738 411 24836 412 25723 413 25265 414 25294 415 25724 416 24864 417 25694 418 26320 419 29363 420 25279 421 21632 422 18357 423 14140 424 11019 425 5600 \begin{array}{rr} 322 & 3684 \\ 323 & 7211 \\ 324 & 10844 \\ 325 & 14689 \\ 326 & 17752 \\ 327 & 22040 \\ 328 & 24850 \\ 329 & 25708 \\ 330 & 25280 \\ 331 & 25222 \\ 401 & 25708 \\ 402 & 24794 \\ 403 & 25709 \\ 404 & 24794 \\ 405 & 25722 \\ 406 & 25265 \\ 407 & 25308 \\ 408 & 25722 \\ 409 & 24850 \\ 410 & 25738 \\ 411 & 24836 \\ 412 & 25723 \\ 413 & 25265 \\ 414 & 25294 \\ 415 & 25724 \\ 416 & 24864 \\ 417 & 25694 \\ 418 & 26320 \\ 419 & 29363 \\ 420 & 25279 \\ 421 & 21632 \\ 422 & 18357 \\ 423 & 14140 \\ 424 & 11019 \\ 425 & 5600 \\ \end{array}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...