You are viewing a single comment's thread. Return to all comments →
How can we show that if (k-1) | k > n, then there is no way to obtain k-1?
Seems like cookies are disabled on this browser, please enable them to open this website
Day 29: Bitwise AND
You are viewing a single comment's thread. Return to all comments →
How can we show that if (k-1) | k > n, then there is no way to obtain k-1?