Conjectured polynomial time primality tests for numbers of special forms

Predrag Terzić
Notes on Number Theory and Discrete Mathematics, ISSN 1310-5132
Volume 20, 2014, Number 5, Pages 40—43
Download full paper: PDF, 145 Kb

Details

Authors and affiliations

Predrag Terzić
Podgorica, Montenegro

Abstract

Conjectured polynomial time primality tests for numbers of special forms similar to the Riesel primality test for numbers of the form k · 2n − 1 are introduced.

Keywords

  • Primality test
  • Polynomial time
  • Prime numbers

AMS Classification

  • 11A51

References

  1. Riesel, H. Lucasian Criteria for the Primality of N =h. 2n − 1, Mathematics of Computation (American Mathematical Society), Vol. 23(108), 1969, 869–875
  2. Crandall, R., C. Pomerance. “Section 4.2.1: The Lucas-Lehmer test”, Prime Numbers: A Computational Perspective (1st ed.), Berlin: Springer, 2001, 167–170
  3. Related papers

    Cite this paper

    APA

    Terzić, P. (2014). Conjectured polynomial time primality tests for numbers of special forms. Notes on Number Theory and Discrete Mathematics, 20(5), 40-43.

    Chicago

    Terzić, Predrag . “Conjectured Polynomial Time Primality Tests for Numbers of Special Forms.” Notes on Number Theory and Discrete Mathematics 20, no. 5 (2014): 40-43.

    MLA

    Terzić, Predrag . “Conjectured Polynomial Time Primality Tests for Numbers of Special Forms.” Notes on Number Theory and Discrete Mathematics 20.5 (2014): 40-43. Print.

Comments are closed.