diff options
| author | Adrien Hopkins <adrien.p.hopkins@gmail.com> | 2025-09-22 16:44:29 -0500 |
|---|---|---|
| committer | Adrien Hopkins <adrien.p.hopkins@gmail.com> | 2025-09-22 16:46:05 -0500 |
| commit | bec087c3855f1641ac3681d56c9f8247aa556d2e (patch) | |
| tree | 19b07482d8519326954b8a1acac310ccc4b1847c /README.org | |
| parent | d3fdb797db81ab81c4f91dd88d24723a88b39c2e (diff) | |
Add option to show logarithmic RC
This makes finding the RC of prime powers multiplication instead of
exponentation, which is much easier to do mentally.
Diffstat (limited to 'README.org')
| -rw-r--r-- | README.org | 2 |
1 files changed, 2 insertions, 0 deletions
@@ -100,6 +100,8 @@ This number measures how easy it is to work with powers of /n/ in radix /r/ - th (The exact value for both of these is \(\textrm{MPM}(r, n^e) / n^e\) - the RC simply condenses all the powers into a single number.) The Radix Info Script shows the complexity for all of the base's prime factors, not every number, in order to keep the output reasonably small. The regular complexity of a product of prime powers will be smaller than the largest of the multiplicands' complexities - prime powers are the worst case. + +If the ~-l~ argument is used, the program will display the base-2 logarithm of the complexities. This means that you can calculate the complexity of prime powers by multiplying by the power, instead of exponentiating (hard to do mentally!). ** Copyright & Contact Info radix_info: gives some information about number radices Copyright (C) 2023 Adrien Hopkins |