Invariable Calendar

In April 1900, Professor L. A. Grosclaude of Geneva proposed the Invariable Calendar, New Era Calendar, or Normal Calendar with 12 months and four 91-day quarters of exactly 13 weeks. An additional day, termed New Year's Day, that was not any day of the week and not part of any month, would occur between December 31 and January 1. Another such day is inserted between June 31 and July 1 on leap years.

This model would be a perennial calendar, with each date occurring perennially on the same day of the week. Grosclaude lists many business advantages to this. Three monthly days important to businesses, the 1st, 15th, and 30th would always occur on the same 3 days of the week, respectively, and additionally would never occur on a Sunday, for example. It became the model for The World Calendar, promoted by Elisabeth Acheils and The World Calendar Association since 1930.

Proposed Calendar
12345678910111213141516171819202122232425262728293031
New Years DayX
JanuaryMTuWThFSaSuMTuWThFSaSuMTuWThFSaSuMTuWThFSaSuMTu
FebruaryWThFSaSuMTuWThFSaSuMTuWThFSaSuMTuWThFSaSuMTuWTh
MarchFSaSuMTuWThFSaSuMTuWThFSaSuMTuWThFSaSuMTuWThFSaSu
AprilMTuWThFSaSuMTuWThFSaSuMTuWThFSaSuMTuWThFSaSuMTu
MayWThFSaSuMTuWThFSaSuMTuWThFSaSuMTuWThFSaSuMTuWTh
JuneFSaSuMTuWThFSaSuMTuWThFSaSuMTuWThFSaSuMTuWThFSaSu
Leap DayX
JulyMTuWThFSaSuMTuWThFSaSuMTuWThFSaSuMTuWThFSaSuMTu
AugustWThFSaSuMTuWThFSaSuMTuWThFSaSuMTuWThFSaSuMTuWTh
SeptemberFSaSuMTuWThFSaSuMTuWThFSaSuMTuWThFSaSuMTuWThFSaSu
OctoberMTuWThFSaSuMTuWThFSaSuMTuWThFSaSuMTuWThFSaSuMTu
NovemberWThFSaSuMTuWThFSaSuMTuWThFSaSuMTuWThFSaSuMTuWTh
DecemberFSaSuMTuWThFSaSuMTuWThFSaSuMTuWThFSaSuMTuWThFSaSu
12345678910111213141516171819202122232425262728293031

Criticism
  • The Sabbatarian objection, that the strict cycle of the seven-day week is interrupted; sometimes there are seven days between sabbaths, instead of the usual six.
  • Difficulties of defining the dates of New Year's and Leap Days when they don't belong to any month or week.

Other calendars and proposals

Sources
    gollark: ``` WillPascucci commented 21 days ago •I'm trying to run this on IBM Q. I want to increase my performance by ~10-15% and I believe that optimizing these operations on qubits would be the simplest way. What is the plan to include quantum computing support? I'm trying to have this ready for my performance review next quarter. Please advise!```
    gollark: Not mine.
    gollark: ``` My printer isn't working #393Openwizzwizz4 opened this Issue 11 days ago · 0 commentsCommentsAssigneesNo one assignedLabelsNone yetProjectsNone yetMilestoneNo milestoneNotificationsYou’re not receiving notifications from this thread.1 participant@wizzwizz4@wizzwizz4wizzwizz4 commented 11 days agoI used to be able to use my printer, but after coming back from holiday it doesn't work. Every time I try to print, a box comes up and even after I close it it still doesn't work.```
    gollark: It is truly glorious.
    gollark: ```javapackage com.seriouscompany.business.java.fizzbuzz.packagenamingpackage.impl.math.arithmetics;import com.seriouscompany.business.java.fizzbuzz.packagenamingpackage.impl.ApplicationContextHolder;import javax.annotation.PostConstruct;import org.springframework.beans.factory.annotation.Autowired;import org.springframework.context.ApplicationContext;import org.springframework.stereotype.Service;import com.seriouscompany.business.java.fizzbuzz.packagenamingpackage.impl.strategies.comparators.integercomparator.IntegerForEqualityComparator;@Servicepublic class NumberIsMultipleOfAnotherNumberVerifier { private static IntegerDivider integerDivider; @Autowired private ApplicationContextHolder applicationContextHolder; @PostConstruct public void init() { final ApplicationContext applicationContext = applicationContextHolder.getApplicationContext(); this.integerDivider = applicationContext.getBean(IntegerDivider.class); } public static boolean numberIsMultipleOfAnotherNumber(final int nFirstNumber, final int nSecondNumber) { try { final int nDivideFirstIntegerBySecondIntegerResult = (NumberIsMultipleOfAnotherNumberVerifier.integerDivider.divide(nFirstNumber, nSecondNumber)); final int nMultiplyDivisionResultBySecondIntegerResult = nDivideFirstIntegerBySecondIntegerResult * nSecondNumber; if (IntegerForEqualityComparator.areTwoIntegersEqual(nMultiplyDivisionResultBySecondIntegerResult, nFirstNumber)) { return true; } else { return false; } } catch (final ArithmeticException ae) { return false; } }}```
    This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.