summaryrefslogtreecommitdiff
path: root/README.org
diff options
context:
space:
mode:
Diffstat (limited to 'README.org')
-rw-r--r--README.org2
1 files changed, 2 insertions, 0 deletions
diff --git a/README.org b/README.org
index 09fab4a..4544e13 100644
--- a/README.org
+++ b/README.org
@@ -84,6 +84,8 @@ Some radices fall into certain classes that indicate they have many useful facto
The MTC is an estimate of how difficult it is to learn a radix's multiplication table. Every row except 0, 1 and the last one (which have their own patterns) is assigned a difficulty equal to the length of the pattern in its last digit, and these difficulties are summed to get the overall MTC.
** Base-2 Logarithm
The radix's base-2 logarithm indicates its information density - how much information it can fit into a digit. Radices with higher logarithms will be able to count higher with fewer digits, and approximations will be more accurate for the same number of decimal places. Specifically, one digit in radix n is equivalent to log_2(n) bits (base-2 digits).
+
+The reciprocoal of the logarithm is proportional to the number of digits in a number, so it is also shown in the extended view. It uses a scale where decimal is 1, so when you see the value of 3.3219 in binary, you know that numbers in binary require ~3.32 times as many digits as decimal.
** Copyright & Contact Info
radix_info: gives some information about number radices
Copyright (C) 2023 Adrien Hopkins