I've heard from many answers that x & 1 == 1 will determine if a number is odd (which makes sense); but I never see this in practice (x % 2 != 0 is usually used instead)
Are there any potential issues with using the bitwise and, or is x % 2 != 0 just used because of other reasons (easier to understand, faster to compute, etc)?