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!
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ Find user
→ Recent actions
What is proof for finding remainder(%) when n divide by k, if k is power of two.
Revision en2, by Kaleab_Asfaw, 2020-07-27 13:49:49
History
Revisions
| 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) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/19/2026 08:42:42 (g2).
Desktop version, switch to mobile version.
Supported by
