| # | 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 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 3 | Proof_by_QED | 147 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
A number has odd divisor or not
A number never have a odd divisor which can be represent as the power of two. A famous way to find out the number can be represent as the power of two or not is:]
n & (n — 1) by this operation we will get a number which is an even number also the number can be represent by the power of two.So if by doing this operation we get any number which is represent by the power of two.That means 'n' has no odd divisor.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
Selim_Al_Sumon | 2023-01-14 20:53:45 | 24 | Tiny change: 'd divisor.' -> 'd divisor.watch the problem\n1475A' | |
| en1 |
|
Selim_Al_Sumon | 2023-01-14 20:52:34 | 454 | Initial revision (published) |
