Editing Talk:2835: Factorial Numbers

<!--Please sign your posts with ~~~~ and don't delete this text. New comments should be added at the bottom.-->

Number systems aren't real math, at least not serious math.  They're an affectation.  99.9% of math is number-system-independent, so nobody should care about them.  [[Special:Contributions/172.70.46.108|172.70.46.108]] 22:30, 29 September 2023 (UTC)

: Of course it's "real math." There aren't that many applications, but so what? Math isn't about applications. Besides, there are some. Maybe not specifically for factorial base, but for some place systems. The only thing "dirty" about decimal is the arbitrariness of ten. Considering place systems in general is just considering special kinds of sums. Certainly, "serious" mathematicians are interested in proving numbers normal in specific bases, or in every base. [[User:EebstertheGreat|EebstertheGreat]] ([[User talk:EebstertheGreat|talk]]) 01:55, 30 September 2023 (UTC)

: A great deal of interesting maths can be found in and around he various arrangements of digits in number systems, surely. AzureArmageddon 07:54, 30 September 2023 (UTC)

I thought this was a complete joke, until coming here. The "factorial number system" exists?! [[Special:Contributions/162.158.90.249|162.158.90.249]] 22:38, 29 September 2023 (UTC)
:Yup, complete news to me too... What's REALLY weird: the night before this comic I was tutoring a friend's daughter in math, and I happened to teach her what factorials are! (News to me there's a number system, though)... [[User:NiceGuy1|NiceGuy1]] ([[User talk:NiceGuy1|talk]]) 04:59, 1 October 2023 (UTC)

I wanted to add a link to a converter, but the one I found is https://www.dcode.fr/factorial-base which is quite ugly with lots of adds and a bit counter-intuitive.--[[User:Pere prlpz|Pere prlpz]] ([[User talk:Pere prlpz|talk]]) 23:42, 29 September 2023 (UTC)


This needs simplifying a bit. Came here because I had no idea what was going on, and after a quick scroll through the prose, the main thing I learned was "it's 'cause you're dumb". May be true but I still don't get what Randall's factorial system is....[[User:Alcatraz ii|Alcatraz ii]] ([[User talk:Alcatraz ii|talk]]) 01:25, 30 September 2023 (UTC)
==Fractions==
I have actually considered this system, though not with any illusion of its being useful. Any system "exists", just as any number "exists". A system where 1 = decimal 1, 10 = decimal 29, 100 = decimal 493 , exists in the monetary system of the Harry Potter world. An actual system existed where 1d = 1d, 1/- = 12d, £1/-/- = 240d.

It's only on seeing that someone else had come up with this system, that it's occurred to me to consider fractions. Any rational number has a finite number of places after the "factoradic" point. Anything with infinite repetition after the point is irrational.
1⁄2 = 0.1

1⁄3 = 0.021  [Corrected: 0.02]

1⁄4 = 0.0121  [Corrected: 0.012]

1⁄5 = 0.01041  [Corrected: 0.0104]

1⁄6 = 0.011  [Corrected: 0.01]

1⁄7 = 0.0032061  [Corrected: 0.003206]

1⁄8 = 0.0031  [Corrected: 0.003]

1⁄9 = 0.002321  [Corrected: 0.00232]

1⁄10 = 0.0022  

π = 11.003156502.....

e = 10.11111111111111111111.....
 [[Special:Contributions/198.41.236.185|198.41.236.185]] 09:34, 13 October 2023 (UTC)

I am not following the fractions presented above after the first - if these are inverses of the left-of-decimal bases (excluding 1!), .1 = 1/2, .01 = 1/6, .001 = 1/24, etc., then I believe the corrections added above are appropriate (mostly removing a trailing 1).  If I'm mistaken, perhaps it needs a bit more explanation?  Regardless, e as a repeating value is delightful.  Majuba
[[Special:Contributions/172.71.147.123|172.71.147.123]] 19:49, 17 October 2023 (UTC)

==..==

Factorial base also allows to finitely represent all rational numbers - no constant base is capable of that! [[Special:Contributions/172.68.238.76|172.68.238.76]] 01:55, 30 September 2023 (UTC)
: Unless you use a division sign. But yes, only radix numerals of a variable base with infinite series of factors of every prime can even theoretically finitely represent arbitrary rationals without invoking existential quantifiers. [[Special:Contributions/172.71.147.26|172.71.147.26]] 06:43, 30 September 2023 (UTC)

I feel like Michael when Oscar is trying to explain what a “surplus” is.[[Special:Contributions/162.158.186.241|162.158.186.241]] 04:12, 30 September 2023 (UTC)
:Bruh, same, and I'm a stats major. This "explanation" sorely needs a couple paragraphs of ELI5 introductory exposition for English majors between the first and second sentences. [[Special:Contributions/172.69.134.16|172.69.134.16]] 13:11, 5 October 2023 (UTC)

== The warning is complete nonsense, just remove it ==

bots cant be escorted out of somewhere just remove the stupid warning [[Special:Contributions/162.158.203.109|162.158.203.109]] 04:28, 30 September 2023 (UTC)

: you must be new here - [[Special:Contributions/108.162.216.143|108.162.216.143]] 15:51, 30 September 2023 (UTC)

: The nonsense is part of the fun. AzureArmageddon 07:52, 30 September 2023 (UTC)

::im deleting it {{unsigned ip|162.158.203.80|11:16, 30 September 2023}}‎

:::Premature elision. Still has a purpose (as does signing your contributions here). [[Special:Contributions/172.71.178.208|172.71.178.208]] 14:58, 30 September 2023 (UTC)
:::<nowiki>*</nowiki>sigh* As has been stated, you MUST be new here. The "incomplete" tag goes on new comics while their descriptions are still in flux. When the bot creates the empty description page, it does so with the Incomplete warning, labelled with its name. On the first edit, someone ALWAYS changes the name to some silly gag that's related to the comic, often pretending it's the name of the bot that created the page for us. In this case the comic shows Cueball being escorted out, so the joke is the bot is being escorted out. If you're not going to have a sense of humour, why are you here? Just leave the editing to others in the meantime. :) (Oh, and as the user above noted, make sure to end your comments with <nowiki>~~~~</nowiki> (4 tildes), like it says at the top of the editing text box you type in). :) [[User:NiceGuy1|NiceGuy1]] ([[User talk:NiceGuy1|talk]]) 05:13, 1 October 2023 (UTC)
:Okay, now the Incomplete warning needs to stay up forever. :) [[User:NiceGuy1|NiceGuy1]] ([[User talk:NiceGuy1|talk]]) 05:13, 1 October 2023 (UTC)
::nope
::: Sign your comments. :) And yup. Whenever someone makes an unreasonable objection, it MUST be ignored to tech unreasonable people to stop being ridiculous. :) [[User:NiceGuy1|NiceGuy1]] ([[User talk:NiceGuy1|talk]]) 04:27, 19 November 2023 (UTC)
:In case you weren’t aware, this wiki has a tradition of humor. This is one of its examples. [[Special:Contributions/172.68.58.134|172.68.58.134]] 12:56, 2 October 2023 (UTC)

== The "adic" part of factor-adic numbers ==

It's not explicitly mentioned in the comic but the "adic" in the name "Factor''adic''™" implies that the number system extends the factorial number system by being in some way "adic" as discussed in [https://youtube.com/watch?v=tRaq4aYPzCc this YouTube video on the Veritasium channel] and so negative numbers would have a truly wacky representation that violates the intent of the title text's pronouncement by requiring an infinitely long representation requiring infinite digits (1, 2, 3, 4, ..., 9, A, B, C, ..., ''infinite digits''). AzureArmageddon 08:00, 30 September 2023 (UTC)

: The "adic" in factoradic doesn't actually relate to p-adic numbers of any kind. Rather, both factoradic and p-adic numbers use the suffix -adic to refer to the concept of adicity, which is "The number of arguments or operands a function or operation takes" according to Wiktionary. Each place value of a p-adic number had p possibilities, and each place value in the factoradic system has a number of possible arguments determined by the factorial of the place. Factoradic would be better called "factorary" since it's more similar to ordinary n-ary number systems, but I guess it just isn't. [[Special:Contributions/172.69.205.130|172.69.205.130]] 20:43, 30 September 2023 (UTC)

:: Ah, today I learned. AzureArmageddon 15:35, 1 October 2023 (UTC)

== Title text ==
The title text references that 10! = 3,628,800 (base 10), and so for numbers greater than or equal to that, you would have to add a tenth digit in order to display them in this system. The question is asking whether you would then proceed to using letters of the alphabet such as one does in [https://en.wikipedia.org/wiki/Hexadecimal hexadecimal] to which the reply is that numbers above this amount are simply illegal. The trouble comes when you try to write down the number 10 * 10! = 36,288,000 (base 10) in this system. For 10!, the notation is 1000000000 , so 9 * 10! would be 9000000000, and then to get 10 * 10!, you would have to write A000000000 because 10 * 10! < 11!. In fact, since this is the first "illegal" number, you could "legally" allow up to 10 * 10! - 1 = 36,287,999 (base 10) in the system (which would be written as 9987654321 = 9 * 10! + 9 * 9! + 8 * 8! + ... + 2 * 1! + 1 * 1!) without the need to introduce any letters. I also want to point out that the reference in the comic to 9 being reserved for big numbers is due to no number needing a 9 to write it down in this system until 9 * 9! = 3265920 which is written 900000000. Since numbers above 10! are not allowed, this means that only the 9! digit is legally allowed to hold a 9, and it only applies to numbers in that high range of 3265920 to 3628799.[[Special:Contributions/172.71.166.230|172.71.166.230]] 15:01, 30 September 2023 (UTC)
:I feel the current in-Explanation explanation about that already covers this, with the addition of the validity that the digit that could need to be >9 could still be any digit 0..9 without needing to invoke the 11th digit. (Maybe a few tweaks, but not sure what you're trying to add here.) [[Special:Contributions/172.70.86.148|172.70.86.148]] 15:13, 30 September 2023 (UTC)

== Radix Economy ==
Someone got in there just before I did, about (from a quick scan of what's been added) "economical" use of Factorial-based variable radices. (I was planning both the test code and the explanation for this, whilst travelling.) My short way of putting it is that (apart from values of zero or one, which represent identically in Factorial-based notation to any other notation in base of 2+) the Factorialised method initially is using up 'places' quicker until the point at which it has reached a 'magnitude' equal to its base-normal 'original' (i.e. only when there are N glyphs made available under Factoradic notation does it not rush through the 'magnitude' quicker than the base-N number). And ''then'', it needs to work up into the more 'efficient' higher-order digits in order to pull back the disadvantages of its lower-order ones and equal, then be shorter than, any given value's respective base-N form.<br />
Now, I've done some very rough calculations (started hitting numbers for which I really need to convert everything into high-precision large-number data types, which needs me to rewrite one or two elements of my existing code) and looked at the successive changes of magnitude, in each base, and checked the calculated Factoradic length (with the assumption that there are enough extended glyphs to represent every digit singly, unlike the comic Title Text speculation).<br />
By my reckoning, Base-2 is more efficient at 20<sub>fact</sub> (compare with 100<sub>2</sub>, =4<sub>10</sub>); Base-3 breaks better at 
3111<sub>fact</sub> (10000<sub>3</sub>, =81); Base-4: 540220<sub>fact</sub> (1000000<sub>4</sub>, =4096); Base-5: 533340021<sub>fact</sub> (1000000000<sub>5</sub>, =1953125); Base-6: 90967344000<sub>fact</sub>(100000000000<sub>6</sub>, =362797056); Base-7: 7ABAA086002001<sub>fact</sub>(100000000000000<sub>7</sub>, =678223072849); Base-8: D73A256860540220<sub>fact</sub>(10000000000000000<sub>8</sub>, =281474976710656); Base-9: B1HEA65678836651220<sub>fact</sub>(10000000000000000811<sub>9</sub>, =1350851717672992000) ...but at this point, the conversion of decimal to its base-9 form (and that powers of 9 should ''never'' have trailing zeros!) shows I may very well have hit a limit to normal large-number precision, so I really can't trust the subsequently derived base-10 values.<br />
But, in case anyone wants it, the following is my (Perl, but should be easily convertible into most medium-to-high level code dialevts) en-Factoriadialising function.
 sub factadic { my ($n,$place)=(@_,1);
   return () unless $place;
   if ($n>=fact($place+1)) { return factadic($n,++$place) }
   my $digit=0; my $base=fact($place);
   while ($n>=$base) { $digit++; $n-=$base; }
   my @return=($digit,factadic($n,$place-1));
   return @return;
 }
You call it as <code>factadic(''<value>'')</code>. Or <code>factadic(''<value>'',''<minimum_digits>'')</code> to start with the assumption of at least a minimum number of digits, but it'll start by shifting the default minimum of 1 into the <script>$place</script> variable if you don't give it that (there are other ways that you can/must do that, of course), and it will still always expand that to the degree necessary in the first phase of 'diving in' as far as it needs to in order to agree with the <code>fact()</code> function (factorial calculator, a trivial coding issue that I only use here like this because I alreadu set it up for another bit of code).<br />
It returns an array (@-variable, in Perl) of digits, in standard most-to-least-significance order, that you can convert to a glyphwise notation in any way that you wish (or do a string conversion within the function, at each stage of building it up). ...and I'm presenting a ''slightly'' less optimised version of it here (some of the Perl-tricks I originally used don't translate well into some non-Perl) and, yes, the <code>while ($n>=$base)</code> loop could be done using modulus and integer-division, but it's a fairly trivial part of the looping process.<br />
If you have any ''real'' problems with it, it's probably going to be if you're hitting any recursion-depth limits (especially as it uses roughly twice as many recursive calls as the eventual notation-length it produces). I also have a 'stack-based' version (loops round as it shifts in enough 'slots', then works back down again assigning the place-values) which avoids such trouble, but that's coded in a slightly esoteric Perlish way that I'm not sure most of you'd appreciate. ;) [[Special:Contributions/141.101.76.77|141.101.76.77]] 20:25, 30 September 2023 (UTC)
: Probably a double precision floating point accuracy limitation, you can only get up to 2^53 = 9007199254740992 before many modern programs start getting numerically fuzzy. But what weirds me out is you seem to have gotten 1350851717672992900 out of what should have been 9^19 = 1350851717672992089, instead of a nearby float of 1350851717672992768 or 1350851717672993024. What is it with things rounding to decimal like that? [[Special:Contributions/172.71.147.84|172.71.147.84]] 11:43, 1 October 2023 (UTC)
::One 'solution' is to <code>use Math::BigFloat</code> (or similar), in the Perl, and make hold such sensitive and large-tending values. Alternately, implement an array of digits in a raw manner (can be of entirely arbitrary base, explicitly, plus arbitrarily long; well, as long as one doesn't hit ''other'' data limits!) and make your own long-division/etc algorithms. Or pack bitwise/bytewise data as a 'string', with suitable overloaded/replacement mathematical functions. But it all adds extra coding effort, of course. And I rarely share my various hacked-together bits of Perl, because they either work but look horrible or they don't work (and probably look strange, even to me - hence why I've failed to discover why they don't work!). [[Special:Contributions/172.71.98.87|172.71.98.87]] 19:39, 1 October 2023 (UTC)
: Just analyzed the growth rate; For base x, the length can be estimated by 1/2+e*x-e-1.487*ln(x). Maybe a more sniped nerd can get more precision, or even an exact solution; but this is within a digit of the result up to around base 10^13, and then I start running into precision problems in general, so I'm just putting this here as a good enough guess. [[Special:Contributions/172.71.146.129|172.71.146.129]] 13:20, 1 October 2023 (UTC)

Factorial numbers is new to me... It sounds more like a coding system than a number system, LOL! "The door code is 4503 in factorial! Figure it out!" (I'd write this on the bottom of the comments as usual, but I don't want to get mixed up with that ill-thought out and unsigned coding sample Algorithm and table that I KNOW must be mangled when published because the wiki refuses to honour single Newlines. Clearly the author didn't take a peek at what it looks like when published EDIT: Correction, wow, the wiki spotted the code and marked it as such automatically (for now), wow!) :) [[User:NiceGuy1|NiceGuy1]] ([[User talk:NiceGuy1|talk]]) 04:59, 1 October 2023 (UTC)

All the stuff about economy / efficiency doesn't seem to really have any direct relation to the comic, so I'd suggest it doesn't really belong in the explanation, but should be confined to the comments, or at least to a trivia section. Not least because it dives off into a lot of technical stuff that ''itself'' requires explanation for a significant part of the readership. As it is, it's doing more to confuse than to explain.[[Special:Contributions/172.70.85.218|172.70.85.218]] 09:02, 2 October 2023 (UTC)
:I sort of agree, in that I had planned something similar about 'notation economy' as a Trivia-like addendum, before others got there before me. But there could at least be something to be said that by reserving higher-digits(/dissalowing them in lower values), Cueball/Randall is sacrificing conciseness for (one idea of) aestheticism. (And that's without going into 'how much storage it takes to store each digit', which I wasn't going into. So rather than the idealised radix being base-'e', I would have said the idealised base was whatever base-number exceeded the highest value, so it was just one (different) single squiggle for ''everything''. Obviously, there's necessary entropy in the choice of differentiatable squiggles/encoding, though, which is why I also appreciate the current Explanation's blurb.) [[Special:Contributions/172.70.90.52|172.70.90.52]] 10:15, 2 October 2023 (UTC)

NiceGuy1 the wiki uses standard markdown, if you preface with 6 spaces, it will automatically recognize it as a code snippit. I appologize if my contribution was ill-thought out, though i have gone back and signed it. [[User:Drinkcoffeeandcode|Drinkcoffeeandcode]] ([[User talk:Drinkcoffeeandcode|talk]]) 20:06, 4 October 2023 (UTC)
:I called it "ill-thought out" for having no tags or markup, and thus figured it would be all mangled. :) I was mistaken. Good to know, except I don't see myself ever sharing code (I figure people generally aren't hanging out in a coding environment to just run random code like that. I myself don't have any place to try it these days, and if I did I don't prefer C so probably wouldn't have a C environment anyway). But the last time I wrote someone after an unsigned comment, some idiot manually marked it as mine (WHY would I reply to myself?), which I removed, and I don't know how to manually write someone else's sign in (and didn't want to hunt one down to SEE and learn how), so it's probably STILL unsigned. Usually when there's an unsigned comment someone who knows how checks the edit history to find the IP or name to add it. :) Oh, and usually if you want to reply to someone, you put a colon and place your reply below theirs (like this). :) [[User:NiceGuy1|NiceGuy1]] ([[User talk:NiceGuy1|talk]]) 04:29, 7 October 2023 (UTC)

== Factoradic Algorithms ==

there are several ways to compute the factoradic of a base 10 number, depending on the choice of language
the length of the program will be demonstrably bigger. Dynamically typed languages, like perl can likely 
perform this in one or two lines, where as a language like c++ will be longer.

The simplest algorithm is to generate the digits from right to left one at time by dividing the number by a per-iteration-incrementing radix starting from 2 (because 1 is simply '0', we start from 2), taking the result and repeating until the quotient reaches zero:

     #include <iostream>
     #include <algorithm>
     using namespace std;
     int factoradic(int num) {
        string digits;
        int radix = 2;
        while (num != 0) {
            digits.push_back(((num % radix)-'0'));
            num /= radix++;
        }
        reverse(digits.begin(), digits.end());
        return atoi(digits.c_str());
     }

Using Randall's values we can confirm it is correct:

     int main(int argc, char* argv[]) {
         for (int i = 21; i < 26; i++) 
             cout<<i<<" - "<<factoradic(i)<<endl;
         for (int i = 5038; i < 5042; i++) 
             cout<<i<<" - "<<factoradic(i)<<endl;
         for (int i = 999998; i < 1000002; i++) 
             cout<<i<<" - "<<factoradic(i)<<endl;
         return 0;
     }

     max@laptop:~/$ ./factoradic
     21 - 311
     22 - 320
     23 - 321
     24 - 1000
     25 - 1001
     5038 - 654320
     5039 - 654321
     5040 - 1000000
     5041 - 1000001
     999998 - 266251210
     999999 - 266251211
     1000000 - 266251220
     1000001 - 266251221

Came back to sign code sample after seeing NiceGuy1's comment. [[User:Drinkcoffeeandcode|Drinkcoffeeandcode]] ([[User talk:Drinkcoffeeandcode|talk]]) 20:02, 4 October 2023 (UTC)

I would love to have some kind of explanation as to why this number system exists/what it's used for in the real world. (Even if that explanation is just "there's no practical purpose, mathematicians just love doing this stuff".) [[Special:Contributions/172.70.134.87|172.70.134.87]] 14:55, 2 October 2023 (UTC)

Would it be too much of a fandom crossover to edit / annotate the last word of the explanation (at time of commenting, the word "senary") to "seximal"? Or, given that we are discussing intentionally silly base systems, just the '''right''' amount of a fandom crossover? [[Special:Contributions/172.71.242.176|172.71.242.176]] 08:14, 5 October 2023 (UTC)
:: "Fandom crossover" with what, exactly? Just humour for Beavis & Butthead/Quagmire-style "sex, hee hee" people (such as myself), or is there some actual fandom you're referring to? As it is, I would have thought the proper word WOULD have "sex" in it, like sextillion does... :) [[User:NiceGuy1|NiceGuy1]] ([[User talk:NiceGuy1|talk]]) 05:41, 7 October 2023 (UTC)
::: I'm assuming the jan Misali fandom. The guy is mostly known for his videos on constructed languages, but he also has strong opinions on base 6. As a reference, see his site [https://www.seximal.net/ seximal.net].

Can I politely note that your algorithm potentially has no end?  num is never 0 because you're always dividing and never subtracting.  My perl attempt goes through every radix up to around 180 before giving up.  (Leave out the atoi and you'll see what I mean.) I might recommend capping radix at 9. [[User:Hymie|Hymie]] ([[User talk:Hymie|talk]]) 12:20, 9 October 2023 (UTC)

== Category ==

There should be a category where presenters are escorted by security, or are about to be.--[[Special:Contributions/162.158.87.153|162.158.87.153]] 12:27, 6 October 2023 (UTC)
: You may be right, I recall several (none specific come to mind, but I know it's a scenario Randall clearly enjoys). [[User:NiceGuy1|NiceGuy1]] ([[User talk:NiceGuy1|talk]]) 05:41, 7 October 2023 (UTC)

== Notation ==

[[wikipedia:Factorial number system]] uses the 3121<sub>!</sub> style notation. Should probably be used in the explanation, together with the 83<sub>10</sub> notation. --[[Special:Contributions/162.158.87.154|162.158.87.154]] 12:42, 6 October 2023 (UTC)
: "In this article, a factorial number representation will be flagged by a subscript '!'", that sounds like it's not a standard notation, just one THAT editor used for THAT article to clarify things when explaining it. [[User:NiceGuy1|NiceGuy1]] ([[User talk:NiceGuy1|talk]]) 05:44, 7 October 2023 (UTC)
::It's used at least in a *Scientific American* article from 4 years ago: https://blogs.scientificamerican.com/roots-of-unity/its-factoradical/
@@ Line 14: / Line 14: @@
 This needs simplifying a bit. Came here because I had no idea what was going on, and after a quick scroll through the prose, the main thing I learned was "it's 'cause you're dumb". May be true but I still don't get what Randall's factorial system is....[[User:Alcatraz ii|Alcatraz ii]] ([[User talk:Alcatraz ii|talk]]) 01:25, 30 September 2023 (UTC)
-Should we move the line about the number at the top of the presentation being the number of this comic to trivia? Seems like it belongs there. [[User:B_for_brain|B for brain]] ([[User_talk:B_for_brain|talk]]) ([https://www.youtube.com/channel/UCg4bo-hj-mDyOOUp_Yp0pug youtube channel] [https://bforbrain.weebly.com/ wobsite (supposed to be a blag)] 17:31, 19 January 2024 (UTC)
-:It seems to be fairly integral to the comic, IMO. Trivia seems to me more for "Incidentally, if we go beyond what the comic directly says..." (though it has been used for more and for less, or not used at all when something might have been relegated to it). Maybe you can consider it an Easter Egg, but it's not even really all that hidden. [[Special:Contributions/172.71.178.33|172.71.178.33]] 19:09, 19 January 2024 (UTC)
 ==Fractions==
 I have actually considered this system, though not with any illusion of its being useful. Any system "exists", just as any number "exists". A system where 1 = decimal 1, 10 = decimal 29, 100 = decimal 493 , exists in the monetary system of the Harry Potter world. An actual system existed where 1d = 1d, 1/- = 12d, £1/-/- = 240d.
@@ Line 183: / Line 179: @@
 : "In this article, a factorial number representation will be flagged by a subscript '!'", that sounds like it's not a standard notation, just one THAT editor used for THAT article to clarify things when explaining it. [[User:NiceGuy1|NiceGuy1]] ([[User talk:NiceGuy1|talk]]) 05:44, 7 October 2023 (UTC)
 ::It's used at least in a *Scientific American* article from 4 years ago: https://blogs.scientificamerican.com/roots-of-unity/its-factoradical/
-== Practicality ==
-It doesn't seem that this number system actually has that much practicality. Perhaps this can be proven wrong though. {{unsigned ip|172.70.210.201|00:28, 28 January 2024}}
-:There's already some pointers as to what it's practical at, above...
-:At the very least, it gives an easier-to-use (from representation to implementation) rearrangement, knowing that you just have to slice off bits of both the sort-key (shifting off a digit at a time, to get N1, N2, N3... etc) and the source-sequence (splicing out the  N1th, N2th, N3th... etc). Easier than saying "try the 2835th recombination plan".
-:But that's just the most trivial use, a mere abstract compared to some more complex topological uses that map 1:1ish against number theory. Use your imagination! [[Special:Contributions/162.158.33.130|162.158.33.130]] 00:59, 28 January 2024 (UTC)
-== I like how 101 dalmatians can now be 7 dalmatians  ==
-[[User:87.bus.rider|87.bus.rider]] ([[User talk:87.bus.rider|talk]]) 11:28, 15 March 2024 (UTC)