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

by

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.

More 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. Not able to calculate in C.How do you calculate in C?
  4. Sum of the all the numbers between a and b [closed]
  5. What’s the difference between “mod” and “remainder”?
  6. Efficient Algorithm for Bit Reversal (from MSB->LSB to LSB->MSB) in C
  7. Arithmetic bit-shift on a signed integer
  8. What is Bit Masking?
  9. Find most significant bit (left-most) that is set in a bit array
  10. Rounding integer division (instead of truncating)
  11. Fast computing of log2 for 64-bit integers
  12. Extracting bits with a single multiplication
  13. Power by squaring for negative exponents
  14. “undefined reference to `pow'” even with math.h and the library link -lm [duplicate]
  15. Using M_PI with C89 standard
  16. Are floating point operations in C associative?
  17. Gaussian elimination without result for acceleration
  18. Bitshift and integer promotion?
  19. Bit twiddling: which bit is set?
  20. Why does gdb evaluate sqrt(3) to 0?
  21. Implementing Logical Right Shift in C
  22. To the power of in C? [duplicate]
  23. sin, cos, tan and rounding error
  24. How do I get bit-by-bit data from an integer value in C?
  25. Algorithm to generate bit mask
  26. Decimal to Binary
  27. Evaluate Mathematical Function from String [closed]
  28. Conditional tests in primality by trial division
  29. How sqrt() of GCC works after compiled? Which method of root is used? Newton-Raphson?
  30. What is bit masking?

Leave a Comment