Search for Wieferich Primes through the use of Periodic Binary Strings
| Data(s) |
08/06/2011
08/06/2011
2010
|
|---|---|
| Resumo |
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. |
| Identificador |
Serdica Journal of Computing, Vol. 4, No 3, (2010), 293p-300p 1312-6555 |
| Idioma(s) |
en |
| Publicador |
Institute of Mathematics and Informatics Bulgarian Academy of Sciences |
| Palavras-Chave | #Wieferich Prime #Periodic Bit String #Distributed Computing |
| Tipo |
Article |
