The book is now available! 32377
(another Prime Pages' Curiosity)
Prime Curios!
Curios: Curios Search:
 

Participate:
Share
+ The smallest odd prime of the form (2^n+n^2) == 0 mod (n+2). [Post]

+ The smallest prime-digit emirp that remains an emirp when each digit is replaced by its binary representation: 111011111111. [Beedassy]




Prime Curios! © 2000-2017 (all rights reserved)