Author: Dieter Buerssner
Date: 11:17:03 09/17/03
Go up one level in this thread
On September 17, 2003 at 09:47:10, Gerd Isenberg wrote: >Some output of this program, >reciprocal hexadecimal 64-bit constants close to 64K: > ..... > 63960 1064ED5513C1B > 64050 105F079E386B9 > 64350 104B7DBC83589 > 64477 1043464BCB8B1 > 64545 103EE372781F1 > 64575 103CF4D30C411 > 64687 1035C2495533A > 64779 102FDD8A195D1 > 64897 102854AB57AFF The last number has the smallest error in the range shown. > 64944 10255657AABAE > 65026 10201FFFBF7F9 > 65077 101CE3CC6F8C1 > 65100 101B6EB892595 > 65520 1001001001002 > 65534 1000200040009 > 65535 1000100010002 I can reproduce all numbers. I guess, you won't need my output anymore. BTW. In my last posts, I rounded the floating point results to integer, but actually truncation is wanted. I have to puzzle about, why actually truncation is wanted, and not rounding of 2**64/i. It certainly has to do with the fact, that 11/4 is 3 and not 4 (which would be the closest result) in integer math. But then again, using the rounded result, multiplying it back and subtracting, if negative add the divisor should calculate the correct mod. But to think of the total correct thing, can make the head spin. Especially confusing I find that one uses + i in the denominator. Cheers, Dieter
This page took 0.01 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.