[...], but it wrongly returns true for x == 0.
When we're talking about modulo 2^n arithmetic, 0 is in fact a power of two.
Proof: 2^n mod 2^n == 0.
[...], but it wrongly returns true for x == 0.
When we're talking about modulo 2^n arithmetic, 0 is in fact a power of two.
Proof: 2^n mod 2^n == 0.