In my class, for a final project, we are working on improving an algorithm that matches a prefix with a power of 2
(I.E. input="25", output="2^8=256", input="99", output="2^99=9903520314283042199192993792...")
Anyways, we are relying on logarithms to identify matching prefixes. Logarithm precision actually does matter and we are looking for better log functions. The standard log function and the calc-function both have the same precision. Are there any options if I wanted even better precision?
Based off several google searches, I've come to the conclusion that one currently does not exist. If someone where to inform me otherwise, I would happily change my best answer however.