Maximize XOR
C_K_Yang Walker liuguangxi a_forsteri Min_25 Philippe_57721 gerrob zilet sinan hervas lesnik7 R2D2 clytorock nielkh
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]
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
 LzyRapx 3d:1h
 doc420836131 1w
 KennTedync 1w:3d
 CharlesUNSEM 2w:4d
 famx_pencil 2w:5d
Fresh Problems

Standard Nim 3d:15h
solved by 7 
Powerful Numbers II 4d:22h
solved by 8 
Powerful Numbers I 4d:23h
solved by 8 
Ordinal Numbers II 1w:4d
solved by 7 
Ordinal numbers I 1w:4d
solved by 8