Publication detail

Search for Wieferich primes through the use of periodic binary strings

DOBEŠ, J. KUREŠ, M.

English title

Search for Wieferich primes through the use of periodic binary strings

Type

Peer-reviewed article not indexed in WoS or Scopus

Language

en

Original abstract

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.

Keywords in English

Wieferich prime, periodic bit string, distributed computing

Released

2010-10-14

ISSN

1312-6555

Journal

Serdica Journal of Computing

Volume

4

Number

3

Pages from–to

293–300

Pages count

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"
}