- What us the importance of amides & polyamides?
- Multi-solvent recrystallization to extract solute from glycerol?
- Why is nitrogen dioxide brown?
- Why is standard reduction potential an intensive property?
- Difficulties understanding how salt bridge works
- Determination of magnesium sulfate hydrate formula
- Will the Ford-Fulkerson method return any value if the residual network is ignored?
- What is the recurrence form of Bubble-Sort
- Is Timsort more efficient than merge sort and why?
- On $BPP$ as oracle and $BPP$ with oracle?
- Computational power difference between all interconnected qubit vs few interconnected qubit
- Universal Hash Function
- Can publisher alter or invent writing and attribute that to the author without consultation?
- NFL fields missing team logo
- How much does a full/empty jetboil canister weigh?
- Could ketosis be therapeutic for ADHD based on the neuro-energetic theory of attention?
- Why does NDSolve work with an initial condition but not a final condition?
- Generalization of the probability of union
- DynamicModule with ExampleData
- Using Manipulate and ListLinePlot
Self-intro to mo-Roman numerals
Here come mo -Roman numerals — just like
only mo’ so.
(Explained as we go.)
What number can spell itself in two different ways
with mo-Roman letter substitution?
For example, the number 6
can spell itself in one way with mo-Roman letter substitution:
s i x
V → s,
X → i and
I → x
But, 6 =
VX I ?
Not the usual
V I ?
Both work in this system — the mo-Roman
Any smaller mo-Roman digit counts as negative
if it is written to the left of any larger digit.
Thus, when a smaller V is to the left of a larger X:
Self-spelling via mo-Roman substitution
also works for the number 19.
L I L XCXXL
n i n e t e e n
L → n,
I → i,
X → e and
C → t
Note that a smaller digit is negated even
when it does not touch the large
This is kinda cheating, in fact very very cheating:
If you allow surjective-only mapping with alternative names, then you can make any number have multiple mo-Roman representation. (In my defense, I have humn's comment in the question)
The trick is the mapping:
$O,n,e\rightarrow I$; $a \rightarrow V$;(or any permutation, say $e,n,a \rightarrow I$ and $o \rightarrow V$, of this mapping) $d \rightarrow X$, so $oneand$ becomes $IIIVIX = (-1)+(-1)+(-1)+(-5)+(-1)+10 = 1$, so you can make $oneandoneand...$ to make the number you want.
$3$ becomes $oneandoneandoneand$ (sounds kinda stupid with the end "and") $ = (-1)+(-1)+(-1)+(-5)+(-1)+10 + = (-1)+(-1)+(-1)+(-5)+(-1)+10 + = (-1)+(-1)+(-1)+(-5)+(-1)+10 = 1+1+1 =3$2017-04-21 12:07:45