Detail publikace

Search for Wieferich primes through the use of periodic binary strings

DOBEŠ, J. KUREŠ, M.

Anglický název

Search for Wieferich primes through the use of periodic binary strings

Typ

Článek recenzovaný mimo WoS a Scopus

Jazyk

en

Originální abstrakt

The result of the distributed computing project Wieferich@Home is presented: the binary periodic numbers of bit pseudo-length up to 3500 obtained by replication of a bit string of bit pseudo-length up to 24 and increased by one represent Wieferich primes only for cases 1093 or 3511.

Klíčová slova anglicky

Wieferich prime, periodic bit string, distributed computing

Vydáno

2010-10-14

ISSN

1312-6555

Časopis

Serdica Journal of Computing

Ročník

4

Číslo

3

Strany od–do

293–300

Počet stran

8

BIBTEX


@article{BUT51029,
  author="Jan {Dobeš} and Miroslav {Kureš}",
  title="Search for Wieferich primes through the use of periodic binary strings",
  journal="Serdica Journal of Computing",
  year="2010",
  volume="4",
  number="3",
  pages="293--300",
  issn="1312-6555"
}