Maximize XOR
Public  1w:1d  6xp  Programming  60.0% 
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]
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]
New Members
 Juliomox 2d:5h
 RandyHiz 1w:1d
 hamid914 1w:1d
 Richardtogue 1w:3d
 khlilism 1w:6d
Fresh Problems

Alternate sums 1d:4h
solved by 9 
Eulerconstant like 1d:4h
solved by 8 
Maximize XOR 1w:1d
solved by 9 
Mutated worm 1w:4d
solved by 6 
Self avoiding paths 2w:1d
solved by 10