Search for Wieferich Primes through the use of Periodic Binary Strings

Authors

  • Jan Dobeš
  • Miroslav Kureš

DOI:

https://doi.org/10.55630/sjc.2010.4.293-300

Keywords:

Wieferich Prime, Periodic Bit String, Distributed Computing

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.

Downloads

Published

2010-10-21

Issue

Vol. 4 No. 3 (2010)

Section

Articles