Skip to main content
SpringerLink
Log in

How to Recognize Whether a Natural Number is a Prime

  • Chapter
Book cover The Little Book of Big Primes

  • 249 Accesses

Abstract

In the art. 329 of Disquisitiones Arithmeticae, Gauss (1801) wrote:

The problem of distinguishing prime numbers from composite numbers and of resolving the latter into their prime factors is known to be one of the most important and useful in arithmetic... The dignity of the science itself seems to require that every possible means be explored for the solution of a problem so elegant and so celebrated.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. GAUSS, C.F. Disquisitiones Arithmeticae. G. Fleischer, Leipzig, 1801. English translation by A.A. Clarke. Yale Univ. Press, New Haven, 1966. Revised English translation by W.C. Waterhouse. Springer-Verlag, New York, 1986.

    Google Scholar 

  2. EISENSTEIN, F.G. Aufgaben. Journal f.d. reine u. angew. Math., 27, 1844, p. 87. Reprinted inMathematische Werke, Vol. I, p. 112. Chelsea, Bronx, N.Y., 1975.

    Google Scholar 

  3. KUMMER, E.E. Über die Erganzungssätze zu den allgemeinem Reciprocitätsgesetzen. Journal f.d. reine u. angew. Math., 44, 1852, 93–146. Reprinted inCollected Papers, Vol. I, (edited by A. Weil, 485–538). Springer-Verlag, New York, 1975.

    Google Scholar 

  4. LUCAS, E. Sur la recherche des grands nombres premiers. Assoc. Française p. l’Avanc. des Sciences, 5, 1876, 61–68.

    Google Scholar 

  5. PEPIN, T. Sur la formule 2’ + 1. C.R. Acad. Sci. Paris, 65, 1877, 329–331.

    Google Scholar 

  6. LUCAS, E. Théorie des fonctions numériques simplement périodiques. Amer. J. Math., 1, 1878, 184–240 and 289–321.

    Google Scholar 

  7. PROTH, F. Théorèmes sur les nombres premiers. C.R. Acad. Sci. Paris, 85, 1877, 329–331.

    Google Scholar 

  8. BANG, A.S. Taltheoretiske Underso/gelser. Tidskrift f. Math., ser.5, 4, 1886, 70–80 and 130–137.

    Google Scholar 

  9. LUCAS, E. Théorie des Nombres. Gauthier-Villars, Paris, 1891. Reprinted by A. Blanchard, Paris, 1961.

    Google Scholar 

  10. ZSIGMONDY, K. Zur Theorie der Potenzreste. Monatsh. f. Math., 3, 1892, 265–284.

    Article  MathSciNet  MATH  Google Scholar 

  11. MALO, E. Nombres qui, sans être premiers, vérifient exceptionnellement une congruence de Fermat. L’Interm. des Math., 10, 1903, p. 88.

    Google Scholar 

  12. BIRKHOFF, G.D. & VANDIVER, H.S. On the integral divisors of an —bn. Annals of Math., (2), 5, 1904, 173–180.

    Article  MathSciNet  Google Scholar 

  13. CIPOLLA, M. Sui numeri compostiP, the verificano la congruenza di FermataP-1–1 (modP). Annali di Matematica, (3), 9, 1904, 139–160.

    Article  Google Scholar 

  14. CARMICHAEL, R.D. On composite numbersP which satisfy the Fermat congruenceaP-1–1 (modP). Amer. Math. Monthly, 19, 1912, 22–27.

    Article  MathSciNet  Google Scholar 

  15. CARMICHAEL, R.D. On the numerical factors of the arithmetic forms an + ßn. Annals of Math., 15, 1913, 30–70.

    Article  MATH  Google Scholar 

  16. DICKSON, L.E. Finiteness of odd perfect and primitive abundant numbers with n distinct prime factors. Amer. J. Math., 35, 1913, 413–422.Reprinted inThe Collected Mathematical Papers(edited by A.A. Albert), Vol. I, 349–358.Chelsea, Bronx, N.Y.,1975.

    Google Scholar 

  17. POCKLINGTON, H.C. The determination of the prime or composite nature of large numbers by Fermat’s theorem. Proc. Cambridge Phil. Soc.,18, 1914/6, 29–30.

    Google Scholar 

  18. PIRANDELLO, L. Fu Mattia Pascal.Bemporad & Figlio, Firenze, 1921, 169 (multiple editions and translations into many languages; especially recommended.)

    Google Scholar 

  19. CARMICHAEL, R.D. Note on Euler’s 0-function. Bull. Amer. Math. Soc., 28, 1922, 109–110.

    MATH  Google Scholar 

  20. CUNNINGHAM, A.J.C. & WOODALL, H.J. Factorization ofyn + 1, y = 2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers(n). Hodgson, London, 1925.

    Google Scholar 

  21. PILLAI, S.S. On some functions connected with0(n). Bull. Amer. Math. Soc., 35, 1929, 832–836.

    Article  MathSciNet  MATH  Google Scholar 

  22. LEHMER, D.H. An extended theory of Lucas’ functions. Annals of Math.,31, 1930, 419–448. Reprinted inSelected Papers(edited by D. McCarthy), Vol. I, 11–48.Ch. Babbage Res. Centre, St. Pierre, Manitoba, Canada,1981.

    Google Scholar 

  23. LEHMER, D.H. On Euler’s totient function. Bull. Amer. Math. Soc., 38, 1932, 745–757. Reprinted inSelected Papers (edited by D. McCarthy), Vol. I, 319–325. Ch. Babbage Res. Centre, St. Pierre, Manitoba, Canada, 1981.

    Google Scholar 

  24. WESTERN, A.E. On Lucas’ and Pepin’s tests for the primeness of Mersenne’s numbers. J. London Math. Soc., 7, 1932, 130–137.

    Article  MathSciNet  Google Scholar 

  25. ARCHIBALD, R.C. Mersenne’s numbers. Scripta Math., 3, 1935, 112–119.

    Google Scholar 

  26. LEHMER, D.H. On Lucas’ test for the primality of Mersenne numbers. J. London Math. Soc., 10, 1935, 162–165. Reprinted inSelected Papers (edited by D. McCarthy), Vol. I, 86–89. Ch. Babbage Res. Centre, St. Pierre, Manitoba, Canada, 1981.

    Google Scholar 

  27. LEHMER, D.H. On the converse of Fermat’s theorem. Amer. Math. Monthly, 43, 1936, Reprinted inSelected Papers (edited by D. McCarthy), Vol. I, 90–95. Ch. Babbage Res. Centre, St. Pierre, Manitoba, Canada, 1981.

    Google Scholar 

  28. CHERNICK, J. On Fermat’s simple theorem. Bull. Amer. Math. Soc., 45, 1939, 269–274.

    Article  MathSciNet  Google Scholar 

  29. PILLAI, S.S. On the smallest primitive root of a prime. J. Indian Math. Soc., (N.S.), 8, 1944, 14–17.

    MathSciNet  MATH  Google Scholar 

  30. SCHUH, F. Can n–1 be divisible by 0(n) when n is composite? (in Dutch). Mathematica, Zutphen, B, 12, 1944, 102–107.

    MathSciNet  MATH  Google Scholar 

  31. KAPLANSKY, I. Lucas’ tests for Mersenne numbers. Amer. Math. Monthly, 52, 1945, 188–190.

    Article  MathSciNet  MATH  Google Scholar 

  32. KLEE, V.L. On a conjecture of Carmichael. Bull. Amer. Math. Soc., 53, 1947, 1183–1186.

    Article  MathSciNet  MATH  Google Scholar 

  33. LEHMER, D.H. On the factors of 2n + 1. Bull. Amer. Math. Soc., 53, 1947, 164–167. Reprinted inSelected Papers (edited by D. McCarthy), Vol. III, 1081–1084. Ch. Baggage Res. Centre, St. Pierre, Manitoba, Canada, 1981.

    Google Scholar 

  34. ORE, O. On the averages of the divisors of a number. Amer. Math. Monthly, 55, 1948, 615–619.

    Article  MathSciNet  MATH  Google Scholar 

  35. ERDÖS, P. On the convers of Fermat’s theorem. Amer. Math. Monthly, 56, 1949, 623–624.

    Article  MathSciNet  MATH  Google Scholar 

  36. FRIDLENDER, V.R. On the least nth power non-residue (in Russian). Doklady Akad. Nauk SSSR (N.S.), 66, 1949, 351–352.

    MathSciNet  MATH  Google Scholar 

  37. SHAPIRO, H.N. Note on a theorem of Dickson. Bull. Amer. Math. Soc., 55, 1949, 450–452.

    Article  MATH  Google Scholar 

  38. BEEGER, N.G.W.H. On composite numbers n for which an-1–1 (mod n), for every a, prime to n. Scripta Math., 16, 1950, 133–135.

    MathSciNet  MATH  Google Scholar 

  39. GIUGA, G. Su una presumibile proprietà caratteristica dei numeri primi. Ist. Lombardo Sci. Lett. Rend. Cl. Sci. Mat. Nat., (3), 14 (83), 1950, 511–528.

    Google Scholar 

  40. GUPTA, H. On a problem of Erdös. Amer. Math. Monthly, 57, 1950, 326–329.

    Article  MathSciNet  MATH  Google Scholar 

  41. KANOLD, H.J. Sätze über Kreisteilungspolynome und ihre Anwendungen auf einige zahlentheoretische Probleme, II. Journal f.d. reine u. angew. Math., 187, 1950, 355–366.

    MathSciNet  Google Scholar 

  42. SALIÉ, H. Uber den kleinsten positiven quadratischen Nichtrest einer Primzahl. Math. Nachr., 3, 1949, 7–8.

    Google Scholar 

  43. SOMAYAJULU, B.S.K.R. On Euler’s totient function0(n). Math. Student, 18, 1950, 31–32.

    MathSciNet  Google Scholar 

  44. BEEGER, N.G.W.H. On even numbers m dividing 2m —2. Amer. Math. Monthly, 58, 1951, 553–555.

    Article  MathSciNet  MATH  Google Scholar 

  45. DUPARC, H.J.A. On Carmichael numbers. Simon Stevin, 29, 1952, 21–24.

    MathSciNet  MATH  Google Scholar 

  46. GRÜN, O. Uber ungerade vollkommene Zahlen. Math. Zeits., 55, 1952, 353–354.

    Article  MATH  Google Scholar 

  47. KANOLD, H.J. Uber die Dichten der Mengen der vollkommenen und der befreundeten Zahlen. Math. Zeits., 61, 1954, 180–185.

    MathSciNet  MATH  Google Scholar 

  48. ROBINSON, R.M. Mersenne and Fermat numbers. Proc. Amer. Math. Soc., 5, 1954, 842–846.

    Article  MATH  Google Scholar 

  49. SCHINZEL, A. Quelques théorèmes sur les fonctions 0(n) etQ(n). Bull. Acad. Polon. Sci., Cl. III, 2, 1954, 467–469.

    MathSciNet  MATH  Google Scholar 

  50. SCHINZEL, A. Generalization of a theorem of B.S.K.R. Somayajulu on the Euler’s function 0(n). Ganita, 5, 1954, 123–128.

    MathSciNet  MATH  Google Scholar 

  51. SCHINZEL, A. & SIERPII-TSKI, W. Sur quelques propriétés des fonctionsq(n) eta(n). Bull. Acad. Polon. Sci., Cl. III, 2, 1954, 463–466.

    MathSciNet  MATH  Google Scholar 

  52. ARTIN, E. The orders of the linear groups. Comm. Pure & Appl. Math., 8, 1955, 355–365. Reprinted inCollected Papers (edited by S. Lang & J.T. Tate), 387–397. Addison-Wesley, Reading, Mass., 1965.

    Google Scholar 

  53. LABORDE, P. A note on the even perfect numbers. Amer. Math. Monthly, 62, 1955, 348–349.

    Article  MathSciNet  MATH  Google Scholar 

  54. SCHINZEL, A. Sur l’équation0(x) = m. Elem. Math., 11, 1956, 75–78.

    MathSciNet  MATH  Google Scholar 

  55. SCHINZEL, A. Sur un problème concernant la fonction0(n). Czechoslovak Math. J., 6, (81), 1956, 164–165.

    MathSciNet  Google Scholar 

  56. JARDEN, D. Recurring Sequences. Riveon Lematematika, Jerusalem, 1958 (3rd edition, Fibonacci Assoc., San Jose, CA, 1973 ).

    Google Scholar 

  57. SIERPIINTSKI, W. Sur les nombres premiers de la formen n + 1. L’Enseign. Math., (2), 4, 1958, 211–212.

    Google Scholar 

  58. ROTKIEWICZ, A. Sur les nombres pairs a pour lesquels les nombresanb—abn, respectivement an-1-bn-1 sont divisibles par n. Rend. Circ. Mat. Palermo, (2), 8, 1959, 341–342.

    Article  MathSciNet  Google Scholar 

  59. SCHINZEL, A. Sur les nombres composés n qui divisent an–a. Rend. Circ. Mat. Palermo, (2), 7, 1958, 1–5.

    Google Scholar 

  60. SCHINZEL, A. & WAKULICZ, A. Sur l’équation0(x+ k) = 0(x), II. Acta Arithm., 5, 1959, 425–426.

    MathSciNet  MATH  Google Scholar 

  61. WIRSING, E. Bemerkung zu der Arbeit über vollkommene Zahlen. Math. Ann., 137, 1959, 316–318.

    MathSciNet  MATH  Google Scholar 

  62. INKERI, K. Tests for primality. Annales Acad. Sci. Fennicae, Ser. A, I, 279, Helsinki, 1960, 19 pages.

    Google Scholar 

  63. WARD, M. The prime divisors of Fibonacci numbers. Pacific J. Math., 11, 1961, 379–389.

    MATH  Google Scholar 

  64. BURGESS, D.A. On character sums and L-series. Proc. London Math. Soc., (3), 2, 1962, 193–206.

    Article  MathSciNet  MATH  Google Scholar 

  65. CROCKER, R. A theorem on pseudo-primes. Amer. Math. Monthly, 69, 1962, p. 540.

    Article  MathSciNet  MATH  Google Scholar 

  66. SCHINZEL, A. The intrinsic divisors of Lehmer numbers in the case of negative discriminant Arkiv. för Mat., 4, 1962, 413–416.

    Article  MathSciNet  MATH  Google Scholar 

  67. SCHINZEL, A. On primitive prime factors of a’ -P. Proc. Cambridge Phil. Soc., 58, 1962, 555–562.

    Article  MathSciNet  MATH  Google Scholar 

  68. SHANKS, D. Solved and Unsolved Problems in Number Theory. Spartan, Washington, 1962. 3rd edition by Chelsea, Bronx, N.Y., 1985.

    Google Scholar 

  69. SCHINZEL, A. On primitive prime factors of Lehmer numbers, I. Acta Arithm., 8, 1963, 211–223.

    Google Scholar 

  70. SCHINZEL, A. On primitive prime factors of Lehmer numbers, II. Acta Arithm, 8, 1963, 251–257.

    MathSciNet  Google Scholar 

  71. LEHMER, E. On the infinitude of Fibonacci pseudo-primes. Fibonacci Quart., 2, 1964, 229–230.

    MATH  Google Scholar 

  72. ROTKIEWICZ, A. Sur les nombres de Mersenne dépourvus de facteurs carrés et sur les nombres naturels n tels que n2 l 2n -2. Matem. Vesnik (Beograd), 2, (17), 1965, 78–80.

    MathSciNet  Google Scholar 

  73. GROSSWALD, E. Topics from the Theory of Numbers. Macmillan, New York, 1966; 2nd edition Birkhäuser, Boston, 1984.

    Google Scholar 

  74. MUSKAT, J.B. On divisors of odd perfect numbers. Math. Comp., 20, 1966, 141–144.

    Article  MathSciNet  MATH  Google Scholar 

  75. BRILLHART, J. & SELFRIDGE, J.L. Some factorizations of 2’n + 1 and related results. Math. Comp., 21, 1967, 87–96 and p. 751.

    Google Scholar 

  76. MOZZOCHI, C.J. A simple proof of the Chinese remainder theorem. Amer. Math. Monthly, 74, 1967, p. 998.

    Article  MathSciNet  MATH  Google Scholar 

  77. LIEUWENS, E. Do there exist composite numbers for whichkO(M) =M − 1 holds? Nieuw. Arch. Wisk., (3), 18, 1970, 165–169.

    MathSciNet  MATH  Google Scholar 

  78. PARBERRY, E.A. On primes and pseudo-primes related to the Fibonacci sequence. Fibonacci Quart., 8, 1970, 49–60.

    MathSciNet  MATH  Google Scholar 

  79. LIEUWENS, E. Fermat Pseudo-Primes. Ph.D. Thesis, Delft, 1971.

    MATH  Google Scholar 

  80. MORRISON, M.A. & BRILLHART, J. The factorization ofF7. Bull. Amer. Math. Soc., 77, 1971, p. 264.

    Article  MathSciNet  MATH  Google Scholar 

  81. HAGIS, Jr., P. & McDANIEL, W.L. A new result concerning the structure of odd perfect numbers. Proc. Amer. Math. Soc., 32, 1972, 13–15.

    Article  MathSciNet  MATH  Google Scholar 

  82. MILLS, W.H. On a conjecture of Ore. Proc. 1972 Number Th. Conf. in Boulder, p. 142–146.

    Google Scholar 

  83. RIBENBOIM, P. Algebraic Numbers. Wiley-Interscience, New York, 1972.

    MATH  Google Scholar 

  84. ROTKIEWICZ, A. Pseudoprime Numbers and their Generalizations. Stud. Assoc. Fac. Sci. Univ. Novi Sad, 1972.

    Google Scholar 

  85. ROTKIEWICZ, A. On pseudoprimes with respect to the Lucas sequences. Bull. Acad. Polon. Sci., 21, 1973, 793–797.

    MathSciNet  MATH  Google Scholar 

  86. LIGH, S. & NEAL, L. A note on Mersenne numbers. Math. Mag., 47, 1974, 231–233.

    Article  MathSciNet  MATH  Google Scholar 

  87. POMERANCE, C. On Carmichael’s conjecture. Proc. Amer. Math. Soc., 43, 1974, 297–298.

    MathSciNet  MATH  Google Scholar 

  88. SCHINZEL, A. Primitive divisors of the expression An—B n in algebraic number fields. Journal f. d. reine u. angew. Math., 268 /269, 1974, 27–33.

    MathSciNet  Google Scholar 

  89. SINHA, T.N. Note on perfect numbers. Math. Student, 42, 1974, p. 336.

    Google Scholar 

  90. BRILLHART, J., LEHMER, D.H. & SELFRIDGE, J.L. New primality criteria and factorizations of2m + 1. Math. Comp., 29, 1975, 620–647.

    MathSciNet  MATH  Google Scholar 

  91. GUY, R.K. How to factor a number Proc. Fifth Manitoba Conf. Numerical Math., 1975, 49–89 (Congressus Numerantium, XVI, Winnipeg, Manitoba, 1976 ).

    Google Scholar 

  92. HAGIS, Jr., P. & McDANIEL, W.L. On the largest prime divisor of an odd perfect number Math. Comp., 29, 1975, 922–924.

    Article  MathSciNet  MATH  Google Scholar 

  93. MORRISON, M.A. A note on primality testing using Lucas sequences. Math. Comp., 29, 1975, 181–182.

    MATH  Google Scholar 

  94. POMERANCE, C. The second largest prime factor of an odd perfect number Math. Comp., 29, 1975, 914–921.

    Article  MathSciNet  MATH  Google Scholar 

  95. PRATT, V.R. Every prime has a succinct certificate. SIAM J. Comput., 4, 1975, 214–220.

    Article  MathSciNet  MATH  Google Scholar 

  96. BUXTON, M. & ELMORE, S. An extension of lower bounds for odd perfect numbers. Notices Amer. Math. Soc., 23, 1976, p. A55.

    Google Scholar 

  97. DIFFIE, W. & HELLMAN, M.E. New directions in cryptography. IEEE Trans. on Inf. Th., IT-22

    Google Scholar 

  98. LEHMER, D.H. Strong Carmichael numbers. J. Austral. Math. Soc., A, 21, 1976, 508–510. Reprinted inSelected Papers (edited by D. McCarthy), Vol. I, 140142. Ch. Babbage Res. Centre, St. Pierre, Manitoba, Canada, 1981.

    Google Scholar 

  99. MENDELSOHN, N.S. The equation0(x) =k. Math. Mag., 49, 1976, 37–39.

    Article  MathSciNet  MATH  Google Scholar 

  100. MILLER, G.L. Riemann’s hypothesis and tests for primality. J. Comp. Syst. Sci., 13, 1976, 300–317.

    MATH  Google Scholar 

  101. RABIN, M.O. Probabilistic algorithms. InAlgorithms and Complexity (edited by J.F. Traub ), 21–39. Academic Press, New York, 1976.

    Google Scholar 

  102. YORINAGA, M. On a congruential property of Fibonacci numbers. Numerical experiments. Considerations and Remarks. Math. J. Okayama Univ., 19, 1976, 5–10; 11–17.

    MathSciNet  Google Scholar 

  103. MALM, D.E.G. On Monte-Carlo primality tests. Notices Amer. Math. Soc.,24, 1977, A-529, abstract 77T-A22.

    Google Scholar 

  104. POMERANCE, C. On composite n for which0(n) in -1. II Pacific J. Math., 69, 1977, 177–186.

    MathSciNet  Google Scholar 

  105. POMERANCE, C. Multiply perfect numbers, Mersenne primes and effective computability. Math. Ann., 226, 1977, 195–206.

    MathSciNet  MATH  Google Scholar 

  106. SOLOVAY, R. & STRASSEN, V. A fast Monte-Carlo test for primality. SIAM J. Comput., 6, 1977, 84–85.

    MathSciNet  MATH  Google Scholar 

  107. STEWART, C.L. Primitive divisors of Lucas and Lehmer numbers. InTranscendence Theory: Advances and Applications (edited by A. Baker & D.W. Masser ), 79–92. Academic Press, London, 1977.

    Google Scholar 

  108. WILLIAMS, H.C. On numbers analogous to the Carmichael numbers. Can. Math. Bull., 20, 1977, 133–143.

    Article  MATH  Google Scholar 

  109. KISS, P. & PHONG, B.M. On a function concerning second order recurrences. Ann. Univ. Sci. Budapest, 21, 1978, 119–122.

    MATH  Google Scholar 

  110. RIVEST, R.L. Remarks on a proposed cryptanalytic attack on the M.I.T. public-key cryptosystem. Cryptologia, 2, 19–78.

    Google Scholar 

  111. RIVEST, R.L., SHAMIR, A. & ADLEMAN, L.M. A method for obtaining digital signatures and public-key cryptosystems. Comm. ACM, 21, 1978, 120–126.

    MathSciNet  MATH  Google Scholar 

  112. WILLIAMS, H.C. Primality testing on a computer. Ars Comb., 5, 1978, 127–185.

    MATH  Google Scholar 

  113. YORINAGA, M. Numerical computation of Carmichael numbers. Math. J. Okayama Univ., 20, 1978, 151–163.

    MathSciNet  MATH  Google Scholar 

  114. CHEIN, E.Z. Non-existence of odd perfect numbers of the form4 1 q?.. 4 6 and 5a142... 49. Ph.D. Thesis, Pennsylvania State Univ., 1979.

    Google Scholar 

  115. BAILLIE, R. & WAGSTAFF, Jr., S.S. Lucas pseudo-primes. Math. Comp., 35, 1980, 1391–1417.

    Article  MathSciNet  MATH  Google Scholar 

  116. COHEN, G.L. & HAGIS, Jr., P. On the number of prime factors of n if 0(n) (n − 1). Nieuw Arch. Wisk., (3), 28, 1980, 177–185.

    MathSciNet  MATH  Google Scholar 

  117. HAGIS, Jr., P. Outline of a proof that every odd perfect number has at least eight prime factors. Math. Comp., 35, 1980, 1027–1032.

    Article  MathSciNet  MATH  Google Scholar 

  118. MONIER, L. Evaluation and comparison of two efficient probabilistic primality testing algorithms. Theoret. Comput. Sci., 12, 1980, 97–108.

    MathSciNet  MATH  Google Scholar 

  119. POMERANCE, C., SELFRIDGE, J.L. & WAGSTAFF, Jr., S.S. The pseudoprimes to 25.109. Math. Comp., 35, 1980, 1003–1026.

    MathSciNet  MATH  Google Scholar 

  120. RABIN, M.O. Probabilistic algorithm for testing primality. J. Nb. Th., 12, 1980, 128–138.

    MathSciNet  MATH  Google Scholar 

  121. WAGSTAFF, Jr., S.S. Large Carmichael numbers. Math. J. Okayama Univ., 22, 1980, 33–41.

    MathSciNet  MATH  Google Scholar 

  122. WALL, D.W. Conditions for0(N) to properly divideN-1. In ACollection of Manuscripts Related to the Fibonacci Sequence (edited by V.E. Hoggatt & M. Bicknell-Johnson), 205–208. 18th Anniv Vol., Fibonacci Assoc., San Jose, 1980.

    Google Scholar 

  123. BRENT, R.P. & POLLARD, J.M. Factorization of the eighth Fermat number. Math. Comp., 36, 1981, 627–630.

    Article  MathSciNet  MATH  Google Scholar 

  124. GROSSWALD, E. On Burgess’ bound for primitive roots modulo primes and an application to I’(p). Amer. J. Math., 103, 1981, 1171–1183.

    Article  MathSciNet  MATH  Google Scholar 

  125. LENSTRA, Jr., H.W. Primality testing algorithms (after Adleman, Rumely and Williams) In Séminaire Bourbaki, exposé No. 576. Lecture Notes in Math., #901, 243–257. Springer-Verlag, Berlin, 1981.

    Google Scholar 

  126. LÜNEBURG, H. Ein einfacher Beweis für den Satz von Zsigmondy über primitive Primteiler vonA N–1. InGeometries and Groups (edited by M. Aigner & D. Jungnickel). Lecture Notes in Math., #893, 219–222. Springer-Verlag, New York, 1981.

    Google Scholar 

  127. BRENT, R.P. Succinct proofs of primality for the factors of some Fermat numbers. Math. Comp., 38, 1982, 253–255.

    MathSciNet  MATH  Google Scholar 

  128. LENSTRA, Jr., H.W. Primality testing. InComputational Methods in Number Theory (edited by H.W. Lenstra, Jr. & R. Tijdeman), Part I, 55–77. Math. Centre Tracts, #154, Amsterdam, 1982.

    Google Scholar 

  129. MASAI, P. & VALETTE, A. A lower bound for a counterexample in Carmichael’s conjecture. Boll. Un. Mat. Ital., (6), 1-A, 1982, 313–316.

    Google Scholar 

  130. WOODS, D. & HUENEMANN, J. Larger Carmichael numbers. Comput. Math. & Appl., 8, 1982, 215–216.

    MathSciNet  MATH  Google Scholar 

  131. ADLEMAN, L.M., POMERANCE, C. & RUMELY, R.S. On distinguishing prime numbers from composite numbers. Annals of Math., (2), 117, 1983, 173–206.

    Article  MathSciNet  MATH  Google Scholar 

  132. BRILLHART, J., LEHMER, D.H., SELFRIDGE, J.L., TUCKERMAN, B. & WAGSTAFF, Jr., S.S. Factorizations of bm±1, b = 2, 3, 5, 6, 7, 10, 11, 12 up to High Powers. Contemporary Math., Vol. 22, Amer. Math. Soc., Providence, R.I., 1983, second edition, 1988 ).

    Google Scholar 

  133. HAGIS, Jr., P. Sketch of a proof that an odd perfect number relatively prime to 3 has at least eleven prime factors. Math. Comp., 40, 1983, 399–404.

    MathSciNet  MATH  Google Scholar 

  134. POMERANCE, C. & WAGSTAFF, Jr., S.S. Implementation of the continued fraction integer factoring algorithm. Congressus Numerantium, 37, 1983, 99–118.

    MathSciNet  Google Scholar 

  135. POWELL, B. Problem 6420 (On primitive roots). Amer. Math. Monthly, 90, 1983, p. 60.

    Article  Google Scholar 

  136. SINGMASTER, D. Some Lucas pseudoprimes. Abstracts Amer. Math. Soc.,4, 1983, No. 83T-10–146, p. 197.

    Google Scholar 

  137. YATES, S. Titanic primes. J. Recr. Math.,16, 1983/4, 250–260.

    Google Scholar 

  138. COHEN, H. & LENSTRA, Jr., H.W. Primality testing and Jacobi sums Math. Comp., 42, 1984, 297–330.

    Article  MathSciNet  MATH  Google Scholar 

  139. DIXON, J.D. Factorization and primality tests. Amer. Math. Monthly, 91, 1984, 333–352.

    Article  MATH  Google Scholar 

  140. KEARNES, K. Solution of problem 6420. Amer. Math. Monthly, 91, 1984, p. 521.

    MathSciNet  Google Scholar 

  141. NICOLAS, J.L. Tests de primalité. Expo. Math., 2, 1984, 223–234.

    MathSciNet  MATH  Google Scholar 

  142. POMERANCE, C.Lecture Notes on Primality Testing and Factoring(Notes by G.M. Gagola Jr.). Math. Assoc. America, Notes, No.4, 1984, 34 pages.

    Google Scholar 

  143. WILLIAMS, H.C. An overview of factoring. InAdvances in Cryptology (edited by D. Chaum ), 71–80. Plenum, New York, 1984.

    Chapter  Google Scholar 

  144. YATES, S. Sinkers of the Titanics. J. Recr. Math.,17, 1984/5, 268–274.

    Google Scholar 

  145. BEDOCCHI, E. Note on a conjecture on prime numbers. Rev. Mat. Univ. Parma (4), 11, 1985, 229–236.

    MathSciNet  MATH  Google Scholar 

  146. RIESEL, H. Prime Numbers and Computer Methods for Factorization. Birkhäuser, Boston, 1985.

    Book  MATH  Google Scholar 

  147. WAGON, S. Perfect numbers. Math. Intelligencer, 7, No. 2, 1985, 66–68.

    Article  MathSciNet  MATH  Google Scholar 

  148. KISS, P., PHONG, B.M., & LIEUWENS, E. On Lucas pseudoprimes which are products ofs primes. InFibonacci Numbers and their Applications edited by A.N. Philippou, G.E. Bergum & A.F. Horadam), 131–139. Reidel, Dordrecht, 1986.

    Chapter  Google Scholar 

  149. WAGON, S. Carmichael’s “Empirical Theorem”. Math. Intelligencer, 8, No. 2, 1986, 61–62.

    Article  MathSciNet  MATH  Google Scholar 

  150. WAGON, S. Primality testing. Math. Intelligencer, 8, No. 3, 1986, 58–61.

    Article  MathSciNet  MATH  Google Scholar 

  151. COHEN, G.L. On the largest component of an odd perfect number J Austral. Math. Soc. (Ser. A), 42, 1987, 280–286.

    Article  MathSciNet  MATH  Google Scholar 

  152. KOBLITZ, N. A Course in Number Theory and Cryptography. Springer-Verlag, New York, 1987.

    Book  MATH  Google Scholar 

  153. LENSTRA, Jr., H.W. Factoring integers with elliptic curves. Annals Math, 126, 1987, 649–673.

    Article  MathSciNet  MATH  Google Scholar 

  154. BRILLHART, J., MONTGOMERY, P.L. & SILVER-MAN, R.D. Tables of Fibonacci and Lucas factorizations, and Supplement. Math. Comp., 50, 1988, 251–260 and S-1 to S-15.

    Google Scholar 

  155. YOUNG, J. & BUELL, D.A. The twentieth Fermat number is composite. Math. Comp., 50, 1988, 261–262.

    Article  MathSciNet  MATH  Google Scholar 

  156. BATEMAN, P.T., SELFRIDGE, J.L., & WAGSTAFF, Jr., S.S. The New Mersenne Conjecture, Amer. Math. Monthly, 96, 1989, 125–128.

    Article  MathSciNet  MATH  Google Scholar 

  157. BRENT, R.A. & COHEN, G.L. A new lower bound for odd perfect numbers. Math. Comp., 53, 1989, 431–437 and S-7 to S-24.

    Google Scholar 

  158. DUBNER, H. A new method for producing large Carmichael numbers. Math. Comp., 53, 1989, 411–414.

    MathSciNet  MATH  Google Scholar 

  159. LEMOS, M.Criptografia, úmeros Primos e Algoritmos.(17° Colóquio Brasileiro de Matematica) Inst. Mat. Pura e Aplic., Rio de Janeiro, 1989, 72 pages.

    Google Scholar 

  160. LENSTRA, A.K. & LENSTRA, Jr., H.W. Algorithms in number theory, in Handbook of Theoretical Computer Science, North-Holland, Amsterdam, 1989.

    Google Scholar 

  161. LENSTRA, A.K., LENSTRA, Jr., H.W., MANASSE, M.S. & POLLARD, J.M. The number theory sieve. Preprint, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, Queen’s University, K7L 3N6, Kingston, Ontario, Canada

    Paulo Ribenboim

Authors
  1. Paulo Ribenboim
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Paulo Ribenboim

About this chapter

Cite this chapter

Ribenboim, P. (1991). How to Recognize Whether a Natural Number is a Prime. In: The Little Book of Big Primes. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-4330-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-4330-2_3

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97508-5

  • Online ISBN: 978-1-4757-4330-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation