Find if a number is on or below the bit-boundary, as defined below.
Examples
7,9 straddle the bit-boundary at 2^3 as do 31,32 at 2^5; in these cases 7,8 are on bit boundary as are 31, and 32, but 5 and 33 do not qualify by definition.
Solution Stats
Recent Solvers21
Suggested Problems
-
Project Euler: Problem 1, Multiples of 3 and 5
1027 Solvers
-
136 Solvers
-
465 Solvers
-
123 Solvers
-
Reverse the elements of an array
484 Solvers
More from this Author12
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)
Tags