this post was submitted on 27 Dec 2023
377 points (100.0% liked)
196
17278 readers
1347 users here now
Be sure to follow the rule before you head out.
Rule: You must post before you leave.
Other rules
Behavior rules:
- No bigotry (transphobia, racism, etc…)
- No genocide denial
- No support for authoritarian behaviour (incl. Tankies)
- No namecalling
- Accounts from lemmygrad.ml, threads.net, or hexbear.net are held to higher standards
- Other things seen as cleary bad
Posting rules:
- No AI generated content (DALL-E etc…)
- No advertisements
- No gore / violence
- Mutual aid posts require verification from the mods first
NSFW: NSFW content is permitted but it must be tagged and have content warnings. Anything that doesn't adhere to this will be removed. Content warnings should be added like: [penis], [explicit description of sex]. Non-sexualized breasts of any gender are not considered inappropriate and therefore do not need to be blurred/tagged.
If you have any questions, feel free to contact us on our matrix channel or email.
Other 196's:
founded 2 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
Wouldn't that require the number of available digits to be 1/10?
Fractional bases are weird, and I think there's even competing standards. What I was thinking is that you can write any number in base n like this:
\sum_{k= -∞}^{∞} a_k * n^k
where a_k are what we would call the digits of a number. To make this work (exists and is unique) for a given positive integer base, you need exactly n different symbols.
For a base 1/n, turns out you also need n different symbols, using this definition. It's fairly easy to show that using 1/n just mirrors the number around the decimal point (e.g. 13.7 becomes 7.31)
I am not very well versed in bases tho (unbased, even), so all of this could be wrong.