On the Subject of Base Off

every base is base 10

See Appendix MISALIAN N➔B for the Misalian base naming system reference. Note that numbers themselves in this appendix are in base ten.

This module consists of a display with “BASE-#”, where # is a number, a blank display below it to display inputted characters, and a keyboard below that to input said characters.

The top display will always contain a number in the format “BASE-#”. Submitting the base name the number belongs to will solve the module. An incorrect base name will result in a strike but will not reset the module.

Instead of the typical mostly Latin-derived base naming system, this module uses the Misalian base naming system instead, as instead of basing it off of the number in base ten, it uses the factorization of the number instead. Refer to the appendix on the following pages to convert the number to its corresponding base name.

After obtaining the full base name, remove any hyphens, and input it into the module using the keyboard. Then, press the asterisk to submit the correct name, and absolutely humiliate the person who dared using “BASE-N”.

After the module is solved, you can press the asterisk one more time to stop the torrent of sounds that are probably playing through your ears right now.

Appendix MISALIAN N➔B:
Misalian Base Naming System Reference
From Number to Base

Part 1: Pre-defined names

Main roots
13baker's dozenalbaker--ker's dozenal
Other roots
un-, hen- & -sna

The table on the right shows the full list of pre-defined names for bases in this base-naming system.

Part 2: Factorization

If the number is prime and not already defined, its name consists of the prefix “un-” plus the name of the composite number this prime succeeds.

Otherwise, find the two factors making up this number that:

  1. Require the least amount of roots to express.
  2. Have the absolute difference minimised.

If the smaller number is prime, it is prefixed with “hen-” and suffixed with “-sna”. What goes in between is the name of the composite number this prime succeeds. If the larger number is prime, follow the first sentence of this Part.

Put the smaller factor before the larger one, and apply Part 2 to each factor.

Part 3: Vowel Sequences

  • If a root that ends with <a> or <o> is followed by a root that begins with a vowel, the vowel at the end of the first root is removed.
  • If a root that ends with <i> is followed by a root that begins with <i> or <u>, the vowel at the beginning of the second root is removed.