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 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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 |
---|