diff options
| author | Adrien Hopkins <adrien.p.hopkins@gmail.com> | 2024-11-20 21:40:06 -0500 |
|---|---|---|
| committer | Adrien Hopkins <adrien.p.hopkins@gmail.com> | 2024-11-20 21:40:06 -0500 |
| commit | 6cba5dc72cda8c7bd527ae1e094a8bf678a8e83c (patch) | |
| tree | 3e7f46efdec360bf7186f6c5b8f90bef637d2dbe /factors/factorize.go | |
| parent | 2d14a6bc2e9df90aa55646def21c36bcc7aaac48 (diff) | |
Change logarithms to binary
After thinking about how I want to best represent logarithms, I think
the best way is to see them as equivalent to the size of a digit.
Binary logarithms allow for using a familiar unit (bits) to represent
this size. Nepers exist for the natural logarithm, but almost no one
uses them.
Also, because binary is the smallest base out there, this value will
always be ≥1. This means I'm making the most out of my digits!
This does mean that digit length isn't immediately obvious, but this is
the same idea as "1 km = 1000 m" meaning that the number of km is 1/1000
the number of m - using the regular logarithm is like associating the km
with the number 1000, using the reciprocoal is like associating it with
1/1000=0.001.
Documentation has been changed to reflect this.
Diffstat (limited to 'factors/factorize.go')
0 files changed, 0 insertions, 0 deletions
