Search for Wieferich Primes through the use of Periodic Binary Strings

Dobeš, Jan, and Kureš, Miroslav. "Search for Wieferich Primes through the use of Periodic Binary Strings." Serdica Journal of Computing 4.3 (2010): 293-300. <http://eudml.org/doc/11389>.

@article{Dobeš2010,
abstract = {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.},
author = {Dobeš, Jan, Kureš, Miroslav},
journal = {Serdica Journal of Computing},
keywords = {Wieferich Prime; Periodic Bit String; Distributed Computing; Wieferich prime; periodic bit string; distributed computing},
language = {eng},
number = {3},
pages = {293-300},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {Search for Wieferich Primes through the use of Periodic Binary Strings},
url = {http://eudml.org/doc/11389},
volume = {4},
year = {2010},
}

TY - JOUR
AU - Dobeš, Jan
AU - Kureš, Miroslav
TI - Search for Wieferich Primes through the use of Periodic Binary Strings
JO - Serdica Journal of Computing
PY - 2010
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 4
IS - 3
SP - 293
EP - 300
AB - 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.
LA - eng
KW - Wieferich Prime; Periodic Bit String; Distributed Computing; Wieferich prime; periodic bit string; distributed computing
UR - http://eudml.org/doc/11389
ER -