Search for Wieferich Primes through the use of Periodic Binary Strings
Serdica Journal of Computing, Tome 4 (2010) no. 3, pp. 293-300
Voir la notice de l'article provenant de la source Bulgarian Digital Mathematics Library
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.
Keywords:
Wieferich Prime, Periodic Bit String, Distributed Computing
@article{SJC_2010_4_3_a0,
author = {Dobe\v{s}, Jan and Kure\v{s}, Miroslav},
title = {Search for {Wieferich} {Primes} through the use of {Periodic} {Binary} {Strings}},
journal = {Serdica Journal of Computing},
pages = {293--300},
publisher = {mathdoc},
volume = {4},
number = {3},
year = {2010},
language = {en},
url = {http://geodesic.mathdoc.fr/item/SJC_2010_4_3_a0/}
}
Dobeš, Jan; Kureš, Miroslav. Search for Wieferich Primes through the use of Periodic Binary Strings. Serdica Journal of Computing, Tome 4 (2010) no. 3, pp. 293-300. http://geodesic.mathdoc.fr/item/SJC_2010_4_3_a0/