Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Prikladnaya Diskretnaya Matematika. Supplement, 2014, Issue 7, Pages 13–14 (Mi pdma146)  
Theoretical Foundations of Applied Discrete Mathematics

The equivalent problem of testing Fermat primes

Kr. L. Geut, S. S. Titov

Urals State University of Railway Transport, Ekaterinburg
Full-text PDF (457 kB)
References:
PDF
HTML
Abstract: It is shown that the problem of testing Fermat numbers for primality is equivalent to the problem of testing some polynomials over $\mathrm{GF}(2)$ or $\mathrm{GF}(3)$ for irreducibility.
Keywords: irreducible polynomial, prime numbers, Fermat numbers.
Document Type: Article
UDC: 512.62
Language: Russian
Citation: Kr. L. Geut, S. S. Titov, “The equivalent problem of testing Fermat primes”, Prikl. Diskr. Mat. Suppl., 2014, no. 7, 13–14
Citation in format AMSBIB
\Bibitem{GeuTit14}
\by Kr.~L.~Geut, S.~S.~Titov
\paper The equivalent problem of testing Fermat primes
\jour Prikl. Diskr. Mat. Suppl.
\yr 2014
\issue 7
\pages 13--14
\mathnet{http://mi.mathnet.ru/pdma146}
Linking options:
  • https://www.mathnet.ru/eng/pdma146
  • https://www.mathnet.ru/eng/pdma/y2014/i7/p13
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Prikladnaya Diskretnaya Matematika. Supplement
    Statistics & downloads:
    Abstract page:145
    Full-text PDF :89
    References:28
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024