Pretty Numbers

Computer Science Level pending

We call an integer \(N\) pretty if there exist a non-negative integer \(k\) such that \(N+1 = 2^k\).

This list contains \(100,000\) integers less than or equal to \(2^{31}\). How many unordered pairs of numbers exist such that their bitwise XOR is pretty?

×

Problem Loading...

Note Loading...

Set Loading...