<p><span class="h-card" translate="no"><a href="https://rants.au/@sabik" class="u-url mention" rel="nofollow noopener noreferrer" target="_blank">@<span>sabik</span></a></span> <span class="h-card" translate="no"><a href="https://mastodon.social/@whitequark" class="u-url mention" rel="nofollow noopener noreferrer" target="_blank">@<span>whitequark</span></a></span> Yes, but I don’t understand the significance of that number which immediately gives you the correct answer mod 2<sup>64</sup> .<br>GCC, Clang and Intel all compute n/50 as M*(n&gt;&gt;1) &gt;&gt; 68, where M is the smallest integer larger than 2<sup>68</sup> /25 (0xa3d70a3d70a3d70b). But that involves the upper half of the product (from RDX), not the lower part.</p>
Reply