For any integer n and where k is power of 2,
n % k = n & (k-1)
Example
I wasn't able to proof this statement, how could it be proofed without taking number as example?
Thanks in Advance!
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
What is proof for finding remainder(%) when n divide by k, if k is power of two.
For any integer n and where k is power of 2,
n % k = n & (k-1)
Example : Let n = 26 and k = 2 ^ 3 = 8 , so 26 % 8 = 2
bin(26) = 11010
bin(8-1) = 00111
26 & 7 = 00010 = 2, which is CORRECT
...
I wasn't able to proof this statement, how could it be proofed without taking number as example?
Thanks in Advance!
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | Kaleab_Asfaw | 2020-07-27 13:49:49 | 235 | Tiny change: 'oofed with out taking' -> 'oofed without taking' | ||
en1 | Kaleab_Asfaw | 2020-07-27 13:37:18 | 250 | Initial revision (published) |
Name |
---|