21 Apr
2017
21 Apr
'17
7:11 p.m.
Given 64-bit unsigned integer n and 0 <= k <= 63, can floor(n/(1 + 2^-k)) be computed more quickly than by general integer division?