How does this bitwise operation check for a power of 2?

Any power of 2 minus 1 is all ones: (2 N – 1 = 111….b)

2 = 2^1.  2-1 = 1 (1b)
4 = 2^2.  4-1 = 3 (11b)
8 = 2^3.  8-1 = 7 (111b)

Take 8 for example. 1000 & 0111 = 0000

So that expression tests if a number is NOT a power of 2.

Related Contents:

  1. Explain this snippet which finds the maximum of two integers without using if-else or any other comparison operator?
  2. Compute fast log base 2 ceiling
  3. What is the behavior of integer division?
  4. The most efficient way to implement an integer based power function pow(int, int)
  5. What is the fastest/most efficient way to find the highest set bit (msb) in an integer in C?
  6. How does C compute sin() and other math functions?
  7. Efficient Algorithm for Bit Reversal (from MSB->LSB to LSB->MSB) in C
  8. Arithmetic bit-shift on a signed integer
  9. Power by squaring for negative exponents
  10. How can I multiply and divide using only bit shifting and adding?
  11. What is Bit Masking?
  12. What’s the difference between “mod” and “remainder”?
  13. Are the shift operators () arithmetic or logical in C?
  14. What is CHAR_BIT?
  15. Rounding up to next power of 2
  16. Catch and compute overflow during multiplication of two large integers
  17. Find most significant bit (left-most) that is set in a bit array
  18. How do I determine the number of digits of an integer in C?
  19. Undefined reference to `sin` [duplicate]
  20. Extracting bits with a single multiplication
  21. SIMD signed with unsigned multiplication for 64-bit * 64-bit to 128-bit
  22. Divide a number by 3 without using *, /, +, -, % operators
  23. Mapping a numeric range onto another
  24. Bitwise operators and “endianness”
  25. Bitfield manipulation in C
  26. Bit twiddling: which bit is set?
  27. Fastest way to clamp a real (fixed/floating point) value?
  28. Bitshift and integer promotion?
  29. How to use nan and inf in C?
  30. “undefined reference to `pow'” even with math.h and the library link -lm [duplicate]
  31. Using M_PI with C89 standard
  32. Representing integers in doubles
  33. Why does gdb evaluate sqrt(3) to 0?
  34. Gaussian elimination without result for acceleration
  35. Encoding int value as an IEEE-754 float (binary32)
  36. What does the statement if (counter & (1
  37. Unexpected C/C++ bitwise shift operators outcome
  38. Are floating point operations in C associative?
  39. Finding consecutive bit string of 1 or 0
  40. C: How to wrap a float to the interval [-pi, pi)
  41. C: how to break apart a multi digit number into separate variables?
  42. How to concatenate two integers in C
  43. Implementing Logical Right Shift in C
  44. What’s the quickest way to compute log2 of an integer in C#?
  45. Order of fields when using a bit field in C
  46. C reverse bits in unsigned integer
  47. warning: left shift count >= width of type
  48. Algorithm to pick values from array that sum closest to a target value?
  49. set the m-bit to n-bit [closed]
  50. Algorithm to generate bit mask

Leave a Comment