Problem #393

Maximize XOR
Public 2м:1w 6xp Programming 60.9%

Let $ 2^k \le p \lt q \le 2^{k+1}-1 $

We are looking for pairs (p,q) such as
$ \bullet \quad p \otimes q $ is maximal // $\otimes $ is the XOR operator.
$ \bullet \quad p, q$ are both either a prime or a square number

How many such pairs are there for k = 26 ?

Answer format: count,first p,first q

Example: 3,1307,1764 for k = 10

[My timing: 42 sec]

You need to be a member to keep track of your progress.

Time may end, but hope will last forever.

Other Challenge Sites