Problemintro
Floor of log base 2
Also called integer logarithm base 2, ilog2, most significant bit index.
Computing the index of the most significant 1-bit, which equals floor(log2 x) for x > 0.
Computing the index of the most significant 1-bit, which equals floor(log2 x) for x > 0.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag YBA3D2 Edit this page History Report an error