Detail publikace

Search for Wieferich primes through the use of periodic binary strings

Originální název

Search for Wieferich primes through the use of periodic binary strings

Anglický název

Search for Wieferich primes through the use of periodic binary strings

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.

Anglický 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.

BibTex


@article{BUT51029,
  author="Jan {Dobeš} and Miroslav {Kureš}",
  title="Search for Wieferich primes through the use of periodic binary strings",
  annote="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.",
  chapter="51029",
  journal="Serdica Journal of Computing",
  number="3",
  volume="4",
  year="2010",
  month="october",
  pages="293--300",
  type="journal article - other"
}