Advertisement

A primality test for \(4Kp^n-1\) numbers

  • J. M. Grau
  • A. M. Oller-MarcénEmail author
  • D. Sadornil
Article
  • 22 Downloads

Abstract

We present a Lucasian type primality test, not explicitly based on Lucas sequences, for numbers written in the form \(N=4Kp^n-1\). This test is a generalization of the classical Lucas–Lehmer test for Mersenne numbers using as underlying group \(\mathcal {G}_N:=\{z \in (\mathbb {Z}/N\mathbb {Z})[i]: z\overline{z} \equiv 1 \pmod N\}\).

Keywords

Proth numbers Primality test Lucas sequences Lucasian primality test 

Mathematics Subject Classification

11A51 11Y11 11Y40 

Notes

Acknowledgements

The authors wish to thank the anonymous referees for their many insightful comments and suggestions that helped to improve the paper.

References

  1. 1.
    Berrizbeitia, P., Berry, T.G.: Cubic reciprocity and generalised Lucas–Lehmer tests for primality of \(A\cdot 3^n\pm 1\). Proc. Am. Math. Soc. 127(7), 1923–1925 (1999)CrossRefGoogle Scholar
  2. 2.
    Berrizbeitia, P., Berry, T.G.: Biquadratic reciprocity and a Lucasian primality test. Math. Comput. 73(247), 1559–1564 (2004)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Bosma, W.: Cubic reciprocity and explicit primality tests for \(h\cdot 3^k\pm 1\). In: van der Poorten, A., Stein, A. (eds.) High Primes and Misdemeanours: Lectures in Honour of the 60th Birthday of Hugh Cowie Williams, volume 41 of Fields Inst. Commun., pp. 77–89. American Mathematical Society, Providence, RI (2004)Google Scholar
  4. 4.
    Crandall, R., Pomerance, C.: Prime Numbers: A Computational Perspective, 2nd edn. Springer, New York (2005)zbMATHGoogle Scholar
  5. 5.
    Deng, Y., Lv, C.: Primality test for numbers of the form \(Ap^n+w_ n\). J. Discret. Algorithms 33, 81–92 (2015)CrossRefGoogle Scholar
  6. 6.
    Deng, Y., Huang, D.: Explicit primality criteria for \(h \cdot 2^n \pm 1\). Journal de Theorie des Nombres de Bordeaux 28(1), 55–74 (2016)MathSciNetCrossRefGoogle Scholar
  7. 7.
    GIMPS, GreatInternet Mersenne Prime Search. Founded by G. Woltman. https://www.mersenne.org. Accessed 1 Nov 2019
  8. 8.
    Grau, J.M., Oller-Marcén, A.M., Sadornil, D.: A primality test for \(Kp^n+1\) numbers. Math. Comput. 84(291), 505–512 (2015)CrossRefGoogle Scholar
  9. 9.
    Grau, J.M., Oller-Marcén, A.M., Sadornil, D.: Fermat test with Gaussian base and Gaussian pseudoprimes. Czechoslov. Math. J. 65(140), 969–982 (2015)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Koval, A.: Algorithm for Gaussian integer exponentiation. In: Latifi, S. (ed.) Information Technology: New Generations. Advances in Intelligent Systems and Computing, vol. 448, pp. 1075–1085. Springer, Berlin (2016)Google Scholar
  11. 11.
    Lehmer, D.H.: An extended theory of Lucas’ functions. Ann. Math. Second Ser. 31(3), 419–448 (1930)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Lemmermeyer, F.: Conics—a poor man’s elliptic curves. arXiv:math/0311306v1, preprint at http://www.fen.bilkent.edu.tr/franz/publ/conics.pdf
  13. 13.
    Lucas, E.: Théorie des fonctions numériques simplement périodiques. Am. J. Math. Pure Appl. 1(184–239), 289–321 (1878)Google Scholar
  14. 14.
    Riesel, H.: Lucasian criteria for the primality of \(N = h\cdot 2^n - 1\). Math. Comput. 23(108), 869–875 (1969)zbMATHGoogle Scholar
  15. 15.
    Rödseth, O.J.: A note on primality tests for \(N=h\cdot 2^n-1\). BIT 34(3), 451–454 (1994)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Roettger, E.L., Williams, H.C., Guy, R.K.: Some primality tests that eluded Lucas. Des. Codes Cryptogr. 77, 515–539 (2015)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Sadovnik, E.V.: Testing numbers of the form \(N = 2kp^m - 1\) for primality. Discret. Math. Appl. 16(2), 99–108 (2006)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Schönhage, A., Strassen, V.: Schnelle multiplikation grosser zahlen. Computing (Arch. Elektron. Rechnen) 7, 281–292 (1971)MathSciNetzbMATHGoogle Scholar
  19. 19.
    Stechkin, S.B.: Lucas’s criterion for the primality of numbers of the form \(N = h2^n-1\). Math. Notes Acad. Sci. USSR 10(3), 578–584 (1971)zbMATHGoogle Scholar
  20. 20.
    Stein, A., Williams, H.C.: Explicit primality criteria for \((p-1)p^n-1\). Math. Comput. 69(232), 1721–1734 (2000)CrossRefGoogle Scholar
  21. 21.
    Sun, Z.-H.: Primality tests for numbers of the form \(K\cdot 2^m \pm 1\). Fibonacci Q. 44(2), 121–130 (2006)Google Scholar
  22. 22.
    Williams, H.C.: The primality of certain integers of the form \(2Ar^n-1\). Acta Arith. 39(1), 7–17 (1981)MathSciNetCrossRefGoogle Scholar
  23. 23.
    Williams, H.C.: Édouard Lucas and Primality Testing. Wiley, New York (1998)zbMATHGoogle Scholar
  24. 24.
    Williams, H.C., Zarnke, C.R.: Some prime numbers of the forms \(2A3^{n}+1\) and \(2A3^{n}-1\). Math. Comput. 26, 995–998 (1972)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag GmbH Austria, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Departamento de MatemáticasUniversidad de OviedoOviedoSpain
  2. 2.Centro Universitario de la DefensaZaragozaSpain
  3. 3.Departamento de Matemáticas, Estadística y ComputaciónUniversidad de CantabriaSantanderSpain

Personalised recommendations