08-03-2022, 02:49 AM
(08-03-2022, 01:39 AM)Jack Wrote: Pete I can't answer that, on the other hand, have heard of posit/unum's ?
Dr. John L. Gustafson http://web.stanford.edu/class/ee380/Abst...70201.html came up with a different way to do computer arithmetic
here's a 1 and 1/2 hour video https://youtu.be/aP0Y1uAA-2Y
Wikipedia https://en.wikipedia.org/wiki/Unum_(number_format)
Trying my best to avoid anything to do with BCD (binary coded decimal) manipulation. Sure, it looks fun if you want to soak in the whole information pool and redo the program to turn bits rather than string numbers. Of course, the really good online precision calculators may be based on just that.; in which case the best I can do is approximate something between those apps and the ones that ignore repetends all together.
I looked up the largest repetend online. While 1 / 9973 gives a decimal repetend of 554 digits, the supposed largest is 1 / 9967, which gives a whopping 9966 decimal digits before repeating! I had to set my string math limit&& variable to 20,000 places to test it.
Working with 20,000 digits for each division calculation to catch something like this would make my calculator way too slow; about 2 to 3-seconds per non-terminating calculations.
