(11C) (15C) Very fast binary converter + fast modulo
|
03-18-2018, 12:14 AM
(This post was last modified: 03-19-2018 12:09 AM by Michael Zinn.)
Post: #6
|
|||
|
|||
RE: (11C) Very fast binary converter + fast modulo
Thank you, that is very helpful. I guess this means that multiplication/division by 2/5/10 etc. is totally safe .
The simulator seems to use binary, but it uses so much bits that I get about 15 decimal digits of precision (e.g. if I do 1/3 it looks like 0.333333333333333 followed by a bunch of random looking digits). 25000 mod 7 results in 3. Yes, I see this as a fun vintage computing experience. I wanted to try something that was new to me and solving problems by programming the calculator is an interesting puzzle (It's very far removed from high level languages like Haskell or even Java). Thank you again for your very helpful responses. |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)