Search for Wieferich Primes through the use of Periodic Binary Strings
Dobeš, Jan, Kureš, Miroslav (2010)
Serdica Journal of Computing
Similarity:
The result of the distributed computing projectWieferich@Home is presented: the binary periodic numbers of bit pseudo-length j ≤ 3500 obtained by replication of a bit string of bit pseudo-length k ≤ 24 and increased by one are Wieferich primes only for the cases of 1092 or 3510.