Most commanly the modulo operator % is used to test against an even or odd Number. Now my question is, is there any Problem testing against an odd number using a bitwise AND, as it feels much more...

How does mod of power of 2 work on only lower order bits of a binary number (1011000111011010)? What is this number mod 2 to power 0, 2 to power 4? What does power of 2 have to do with the modulo ...

I have a macro that looks something like this: Foo(x) ((x - '!') & 070) If I call the following code: Foo('1') => 16 However, if I call the following code: (('1' - '!') & 70) =&gt...