Intuitive fred888

To the best of my ability I write about my experience of the Universe Past, Present and Future

Friday, May 15, 2026

Was it difficult to convert Logarithms to Binary from a Base 10 system?

begin quotes:
 
It was not difficult for mathematicians and computer programmers to make the transition. Logarithms are a universal mathematical concept. Changing the base is simply a matter of dividing by a constant factor. However, how and why these bases are used differs significantly across history. 
The Shift in Mathematics
Logarithms were first invented in the early 1600s by John Napier. Shortly after, mathematician Henry Briggs proposed moving to base 10 because it aligned perfectly with the human decimal system, making manual calculations, slide rules, and navigation much easier. 
Because logarithmic mathematics operates on a constant ratio, moving from base 10 to base 2 (binary) relies on the simple conversion formula:
Mathematicians already knew how to convert bases easily using the Change of Base rule. Leonhard Euler published tables of binary logarithms as early as 1739. 
The Shift in Computer Science
For computer scientists, the move to base 2 was not an obstacle but a natural fit. Computers process data in binary (ones and zeros), meaning that memory addresses, bit-shifting operations, and hardware states naturally align with powers of 2. 
In computer science, binary logarithms are predominantly used to calculate the time complexity of algorithms. For example: 
  • Binary Search: Dividing the search space in half repeatedly relies directly on base 2 logarithms.
  • Tree Data Structures: The number of levels in a balanced binary tree is equivalent to
    .
     
Programming Implementations
In modern programming, developers do not need to manually compute binary logs. Virtually all software libraries include built-in functions to handle them directly (e.g., Math.log2() in standard C, Java, Python, and JavaScript). 
Because the difference between base 10, base 2, and base
(natural logarithms) is just a constant multiplier, it does not impact the theoretical limits of algorithm performance (like Big-O notation). This makes translating between bases effortless for both computers and modern programmers. 
  • Logarithms as optimization? : r/compsci - Reddit
    Sep 13, 2024 — Comments Section. maweki. • 2y ago. logs are in a base 10. That works in any base. So for computers log2 would be useful. Logarith...
    Reddit·r/compsci
  • Binary logarithm - Wikipedia
    Earlier than Stifel, the 8th century Jain mathematician Virasena is credited with a precursor to the binary logarithm. Virasena's ...
    Wikipedia
  • Why do most of programming languages (except Sinclair ... - Quora
    May 29, 2021 — * The notation “logx log ⁡ x " always stands for whatever logarithm is being treated as the default one. Mathematicians tend to tr...
    Quora
Show all

Videos
Why The Logarithm Is So Important For Algorithms & Data ...
YouTube · Clément Mihailescu
Sep 20, 2021
YouTube · Clément Mihailescu
10:05
Logarithmic algorithms are faster than linear algorithms. A linear algorithm on 4 billion inputs takes 4 days, while a log algorithm takes 32 nanoseconds.
Where do Logarithms Come From? A Full History of Logs
YouTube · Superheroes of Science
2 weeks ago
YouTube · Superheroes of Science
19:26
An Awesome History of Logarithms
YouTube · NiLTime
Feb 7, 2024
YouTube · NiLTime
3:52
Scottish mathematician John Napier invented logarithms in 1614 to simplify complex multiplication and division using addition and subtraction.

 

intuitivefred888 at 5:13 PM
Share

No comments:

Post a Comment

‹
›
Home
View web version

About Me

intuitivefred888
I live in Coastal Northern California at present but was raised mostly in Los Angeles and San Diego Counties. I have also lived in Seattle, Santa Fe, New Mexico, Maui and the big Island of Hawaii. My archive site is: dragonofcompassion.com
View my complete profile
Powered by Blogger.