On Sat, Oct 18, 2014 at 5:42 PM, Artur Bercik <vbubbl...@gmail.com> wrote: > I got some sense, but could not imagine if required Bit No. 2–5, and Bit > Combination 0000. > > I hope example with the new case would make me more sense. >
Just write the number in binary, with the bits you're interested in set to 1, and everything else 0: ... 876543210 ... 000111100 >>> 0b000111100 60 >>> 1073741877 & 0b000111100 52 So this number does _not_ have all zeroes there. If it did, the result would be zero. To look for some other pattern, just do the same thing - suppose we want to find numbers where it's 1001, we just look for the result to be 0b000100100, or 36. ChrisA -- https://mail.python.org/mailman/listinfo/python-list
