Skip to main content
SpringerLink
Log in

How to Recognize Whether a Natural Number is a Prime?

  • Chapter
The Book of Prime Number Records

  • 290 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. It has engaged the industry and wisdom of ancient and modern geometers to such an extent that it would be superfluous to discuss the problem at length…. Further, 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 89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

Bibliography

  1. GAUSS, C.F.Disquisitiones Arithmeticae. G. Fleischer, Leipzig, 1801.

    Google Scholar 

  2. GAUSS, C.F. English translation by A.A. Clarke. Yale Univ. Press, New Haven, 1966.

    Google Scholar 

  3. GAUSS, C.F. Revised English translation by W.C. Waterhouse. Springer-Verlag, New York, 1986.

    Google Scholar 

  4. EISENSTEIN, F.G. Aufgaben. Journal f.d. reine u. angew. Math., 27, 1844, p. 87.

    Google Scholar 

  5. EISENSTEIN, F.G. Reprinted in Mathematische Werke, Vol. I, p. 112. Chelsea, Bronx, N.Y., 1975.

    Google Scholar 

  6. KUMMER, E.E. Über die Erganzungssätze zu den allgemeinem Reciprocitätsgesetzen. Journal f.d. reine u. angew. Math., 44, 1852, 93–146.

    Article  MATH  Google Scholar 

  7. KUMMER, E.E. Reprinted in Collected Papers, Vol. I, (edited by A. Weil, 485–538). Springer-Verlag, New York, 1975.

    Google Scholar 

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

    Google Scholar 

  9. PEPIN, T. Sur la formule 2n+ 1. C.R. Acad. Sci. Paris, 85, 1877, 329–331.

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  12. BANG, A.S. Taltheoretiske Unders¢gelser. Tidskrift f. Math., ser. 54, 1886, 70–80 and 130–137.

    Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  16. 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 

  17. CIPOLLA, M. Sui numeri composti P, che verificano la congruenza di Fermat aP-1 E 1 (mod P). Annali di Matematica, (3), 9, 1904, 139–160.

    Google Scholar 

  18. CARMICHAEL, R.D. On composite numbers P which satisfy the Fermat congruence aP-1 n 1 (mod P). Amer. Math. Monthly, 19, 1912, 22–27.

    Article  MathSciNet  Google Scholar 

  19. CARMICHAEL, R.D. On the numerical factors of the arithmetic forms e ± ß°. Annals of Math., 15, 1913, 30–70.

    Article  MATH  Google Scholar 

  20. DICKSON, L.E. Finiteness of odd perfect and primitive abundant numbers with n distinct prime factors. Amer. J. Math., 35, 1913, 413–422.

    Article  MATH  MathSciNet  Google Scholar 

  21. DICKSON, L.E. Reprinted in The Collected Mathematical Papers (edited by A.A. Albert), Vol. I, 349–358. Chelsea, Bronx, N.Y., 1975.

    Google Scholar 

  22. 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 

  23. PIRANDELLO, L.Fu Mattia Pascal. Bemporad & Figlio, Firenze, 1921.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  27. LEHMER, D.H. An extended theory of Lucas’ functions. Annals of Math., 31, 1930, 419–448.

    Article  MATH  MathSciNet  Google Scholar 

  28. LEHMER, D.H. Reprinted in Selected Papers (edited by D. McCarthy), Vol. I, 11–48. Ch. Babbage Res. Centre, St. Pierre, Manitoba, Canada, 1981.

    Google Scholar 

  29. LEHMER, D.H. On Euler’s totient function. Bull. Amer. Math. Soc., 38, 1932, 745–757.

    Article  MathSciNet  Google Scholar 

  30. LEHMER, D.H. Reprinted in Selected Papers (edited by D. McCarthy), Vol. I, 319–325. Ch. Babbage Res. Centre, St. Pierre, Manitoba, Canada, 1981.

    Google Scholar 

  31. 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  Google Scholar 

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

    Google Scholar 

  33. ERDOS, P. On the normal number of prime factors of p —1 and some related problems concerning Euler’s O-function. Quart. J. Math. Oxford, 6, 1935, 205–213.

    Article  Google Scholar 

  34. LEHMER, D.H. On Lucas’ test for the primality of Mersenne numbers. J. London Math. Soc., 10, 1935, 162–165.

    Article  Google Scholar 

  35. LEHMER, D.H. Reprinted in Selected Papers (edited by D. McCarthy), Vol. I, 86–89. Ch. Babbage Res. Centre, St. Pierre, Manitoba, Canada, 1981.

    Google Scholar 

  36. LEHMER, D.H. On the converse of Fermat’s theorem. Amer. Math. Monthly, 43, 1936

    Google Scholar 

  37. LEHMER, D.H. Reprinted in Selected Papers (edited by D. McCarthy), Vol. I, 90–95. Ch. Babbage Res. Centre, St. Pierre, Manitoba, Canada, 1981.

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  39. KANOLD, H.J. Unterschungen über ungerade volkommene Zahlen. Journal f. d. reine u. angew. Math., 183, 1941, 98–109.

    Article  MathSciNet  Google Scholar 

  40. KANOLD, H.J. Verschärfung einer notwendigen Bedingung fur die Existenz einer ungeraden vollkommenen Zahl. Journal f. d. reine u. angew. Math., 184, 1942, 116–123.

    Article  MathSciNet  Google Scholar 

  41. BRAUER, A. On the non-existence of odd perfect numbers of the form puq q2. gtot Bull. Amer. Math. Soc., 49, 1943, 712–718, and page 937.

    Google Scholar 

  42. KANOLD, H.J. Folgerungen aus dem Vorkommen einer Gauss’ schen Primzahl in der Primfaktorenzerlegung einer ungeraden vollkommenen Zahl. Journal f. d. reine u. angew. Math., 186, 1944, 25–29.

    MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  47. LEHMER, D.H. On the factors of 2° ± 1. Bull. Amer. Math. Soc., 53, 1947, 164–167.

    Article  MATH  MathSciNet  Google Scholar 

  48. LEHMER, D.H. Reprinted in Selected Papers (edited by D. McCarthy), Vol. III, 1081–1084. Ch. Baggage Res. Centre, St. Pierre, Manitoba, Canada, 1981.

    Google Scholar 

  49. LEVIT, R.J. The non-existence of a certain type of odd perfect number. Bull. Amer. Math. Soc., 53, 1947, 392–396.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  51. STEUERWALD, R. Uber die Kongruenz an-1 n 1 (mod n). Sitzungsber. math.-naturw. Kl. Bayer. Akad. Wiss. München, 1948, 69–70.

    Google Scholar 

  52. BERNHARD, H.A. On the least possible odd perfect number. Amer. Math. Monthly, 56, 1949, 628–629.

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  55. KUHNEL, U. Verschärfung der notwendigen Bedingungen für die Existenz von ungeraden vollkommenen Zahlen. Math. Z., 52, 1949, 202–211.

    Article  MathSciNet  Google Scholar 

  56. SHAPIRO, H.N. Note on a theorem of Dickson. Bull. Amer. Math. Soc., 55, 1949, 366

    Article  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  58. 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.

    MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  60. 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 

  61. SALIE, H. Uber den kleinsten positiven quadratischen Nichtrest einer Primzahl. Math. Nachr., 3, 1949, 7–8.

    Article  MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  64. MORROW, D.C. Some properties of D numbers. Amer. Math. Monthly, 58, 1951

    Google Scholar 

  65. WEBBER, G.C. Nonexistence of odd perfect numbers of the form 3213 pa. s2ß1 s2ß2ß3 S2. Duke Math. J., 18, 1951, 741–749.

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  67. GRUN, O. Über ungerade vollkommene Zahlen. Math. Zeits., 55, 1952, 353–354.

    Article  MathSciNet  Google Scholar 

  68. KANOLD, H.J. Einige neuere Bedingungen für die Existenz ungerader vollkommener Zahlen. Journal f. d. reine u. angew. Math., 192, 1953, 24–34.

    Article  MATH  MathSciNet  Google Scholar 

  69. KANODEL, W. Carmichaelsche Zahlen. Math. Nachr., 9, 1953, 343–350.

    Article  MathSciNet  Google Scholar 

  70. TOUCHARD, J. On prime numbers and perfect numbers. Scripta Math., 19, 1953, 35–39.

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  73. SCHINZEL, A. Quelques théorèmes sur les fonctions 95(n) et a(n). Bull. Acad. Polon. Sci., Cl. III, 2, 1954, 467–469.

    MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  75. SCHINZEL, A. & SIERPINSKI, W., Sur quelques propriétés des fonctions 0(n) et a(n). Bull. Acad. Polon. Sci., Cl. III, 2, 1954, 463–466.

    MathSciNet  Google Scholar 

  76. ARTIN, E. The orders of the linear groups. Comm. Pure & Appl. Math., 8, 1955, 355–365.

    Article  MATH  MathSciNet  Google Scholar 

  77. ARTIN, E. Reprinted in Collected Papers (edited by S. Lang & J.T. Tate), 387–397. Addison-Wesley, Reading, Mass., 1965.

    Google Scholar 

  78. HORNFECK, B. Zur Dichte der Menge der vollkommenen Zahlen. Arch. Math., 6, 1955, 442–443.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  80. WARD, M. The intrinsic divisors of Lehmer numbers. Annals of Math., (2), 62, 1955, 230–236.

    Article  MATH  Google Scholar 

  81. HORNFECK, B. Bemerkung zu meiner Note über vollkommene Zahlen. Arch. Math., 7, 1956, p. 273.

    Article  Google Scholar 

  82. KANOLD, H.J. Uber einen Satz von L.E. Dickson, II. Math. Ann., 132, 1956, 246–255.

    Article  MathSciNet  Google Scholar 

  83. ORE, O. NumberTheory and its History. McGraw-Hill, New York, 2nd edition, 1956.

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

  86. SIERPISKI, W. Sur une propriété de la function 0(n). pub1. Math. Debrecen, 4, 1956, 184–185.

    Google Scholar 

  87. HORNFECK, B & WIRSING, E., über die Haufigkeit vollkommener Zahlen. Math. Ann., 133, 1957, 431–438.

    Article  MATH  MathSciNet  Google Scholar 

  88. KANOLD, H.J. Über die Verteilung der vollkommenen Zahlen und allgemeinerer Zahlenmengen. Math. Ann., 132, 1957, 442–450.

    Article  MATH  MathSciNet  Google Scholar 

  89. KANOLD, H.J. Liber mehrfach vollkommene Zahlen, II. Journal f. d. reine u. angew. Math., 197, 1957, 82–96.

    Article  MATH  MathSciNet  Google Scholar 

  90. McCARTHY, P.J. Odd perfect numbers. Scripta Math., 23, 1957, 43–47.

    MathSciNet  Google Scholar 

  91. ROBINSON, R.M. The converse of Fermat’s theorem. Amer. Math. Monthly, 64, 1957, 703–710.

    Article  MATH  MathSciNet  Google Scholar 

  92. ERDOS, P. Some remarks on Euler’s (P-function. Acta Arithm., 4, 1958, 10–19.

    Google Scholar 

  93. JARDEN, D.Recurring Sequences. Riveon Lematematika, Jerusalem, 1958 (3rd edition, 1973).

    Google Scholar 

  94. PERISASTRI, M. A note on odd perfect numbers. Math. Student, 26, 1958, 179–181.

    MathSciNet  Google Scholar 

  95. ROBINSON, R.M. A report on primes of the form k.2“ + 1 and on factors of Fermat numbers. Proc. Amer. Math. Soc., 9, 1958, 673–681.

    MATH  MathSciNet  Google Scholar 

  96. SCHINZEL, A. Sur l’équation (1)(x + k) = 4)(x). Acta Arithm., 4, 1958, 181–184.

    MATH  MathSciNet  Google Scholar 

  97. SIERPINSKI, W. Sur les nombres premiers de la forme nn+ 1. L’Enseign. Math., (2), 4, 1958, 211–212.

    MATH  MathSciNet  Google Scholar 

  98. DURST, L.K. Exceptional real Lehmer sequences. Pacific J. Math., 9, 1959, 437–441.

    MATH  MathSciNet  Google Scholar 

  99. ROTKIEWICZ, A. Sur les nombres composes qui divisent 0–1 —bn-1 Rend. Circ. Mat. Palermo, (2), 8, 1959, 115–116.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  101. SATYANARAYANA, M. Odd perfect numbers Math. Student, 27, 1959, 17–18.

    MathSciNet  Google Scholar 

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

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  104. WARD, M. Tests for primality based on Sylvester’s cyclotomic numbers. Pacific J. Math., 9, 1959, 1269–1272.

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  107. ERDOS, P. Remarks in number theory, I (in Hungarian, with English summary). Mat. Lapok, 12, 1961, 10–17.

    MathSciNet  Google Scholar 

  108. NORTON, K.K. Remarks on the number of factors of an odd perfect number. Acta Arithm., 6, 1961, 365–374.

    MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  112. MAKOWSKI, A. Generalization of Morrow’s D numbers. Simon Stevin, 36, 1962, p. 71.

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  114. SCHINZEL, A. On primitive prime factors of an —bn. Proc. Cambridge Phil. Soc., 58, 1962, 555–562.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    MathSciNet  Google Scholar 

  118. SURYANARAYANA, D. On odd perfect numbers, II. Proc. Amer. Math., 14, 1963, 896–904.

    MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  120. ERDÖS, P. Some recent advances and current problems in number theory, in Lectures in Modern Mathematics, Vol. III (edited by T.L. Saaty), 196–244. Wiley, New York, 1965.

    Google Scholar 

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

    MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  125. TUCKERMAN, B. Odd perfect numbers: A search procedure, and a new lower bound of 1036. IBM Res. Rep., RC-1925, 1967, and Notices Amer. Math. Soc., 15, 1968, p.226.

    Google Scholar 

  126. SCHINZEL, A. On primitive prime factors of Lehmer numbers, III. Acta Arithm., 15, 1968, 49–69.

    MATH  MathSciNet  Google Scholar 

  127. LEHMER, D.H. Computer technology applied to the theory of numbers. In Studies in Number Theory (edited by W.J. Le Veque), 117–151. Math. Assoc. of America, Washington, 1969.

    Google Scholar 

  128. ELLIOTT, P.D.T.A. On the mean value of 1(p). Proc. London Math. Soc., (3), 21, 1970, 28–96.

    Article  MATH  MathSciNet  Google Scholar 

  129. LIEUWENS, E. Do there exist composite numbers for which kc(M) = M-1 holds? Nieuw. Arch. Wisk., (3), 18, 1970, 165–169.

    MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  131. SURYANARAYANA, D. & HAGIS, Jr., P. A theorem concerning odd perfect numbers. Fibonnaci Quart., 8, 1970, 337–346 and 374.

    MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  134. 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  MATH  MathSciNet  Google Scholar 

  135. MANN, H.B. & SHANKS, D., A necessary and sufficient condition for primality and its source. J. Comb. Th., ser. A, 13, 1972, 131–134.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    MATH  Google Scholar 

  138. ROBBINS, N. The nonexistence of odd perfect numbers with less than seven distinct prime factors. Notices Amer. Math. Soc., 19, 1972, page A52.

    Google Scholar 

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

    MATH  Google Scholar 

  140. ROTKIEWICZ, A. Un problême sur les nombres pseudo-premiers. Indag. Math., 34, 1972, 86–91.

    MathSciNet  Google Scholar 

  141. WILLIAMS, H.C. The primality of N = 2A3n —1. Can. Math. Bull., (4), 15, 1972, 585–589.

    Article  MATH  Google Scholar 

  142. HAGIS, Jr., P. A lower bound for the set of odd perfect numbers. Math. Comp., 27, 1973, 951–953.

    Article  MATH  MathSciNet  Google Scholar 

  143. HONSBERGER, R.Mathematical GemsI. Math. Assoc. of America, Washington, 1973.

    MATH  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

  149. BRILLHART, J., LEHMER, D.H. & SELFRIDGE, J.L. New primality criteria and factorizations of 2m f 1. Math. Comp., 29, 1975, 620–647.

    MATH  MathSciNet  Google Scholar 

  150. 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 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  153. MORRISON, M.A. & BRILLHART, J., A method of factoring and the factorization ofF7. Math. Comp., 29, 1975, 183–208.

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  156. STEWART, C.L. The greatest prime factor ofa n—b n. Acta Arithm., 26, 1975, 427–433.

    MATH  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  159. ERDÖS, P. & SHOREY, T.N., On the greatest prime factor of 2p—1 for a primep, and other expressions. Acta Arithm., 30, 1976, 257–265.

    MATH  Google Scholar 

  160. LEHMER, D.H. Strong Carmichael numbers. J. Austral. Math. Soc., A, 21, 1976, 508–510.

    Article  MATH  MathSciNet  Google Scholar 

  161. LEHMER, D.H. Reprinted in Selected Papers (edited by D. McCarthy), Vol. I, 140–142. Ch. Babbage Res. Centre, St. Pierre, Manitoba, Canada, 1981.

    Google Scholar 

  162. MENDELSOHN, N.S. The equation cP(x) = k. Math. Mag., 49, 1976, 37–39.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Google Scholar 

  165. RECAMAN SANTOS, B. Twelve and its totatives. Math. Mag., 49, 1970, 239–240.

    Google Scholar 

  166. TRAUB, J.F. Algorithms and Complexity. (editor) Academic Press, New York, 1976.

    MATH  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  168. AIGNER, A. Das quadratfreie Kern der Eulerschen 0-Funktion. Monatsh. Math., 83, 1977, 89–91.

    Article  MATH  MathSciNet  Google Scholar 

  169. KISHORE, M. Odd perfect numbers not divisible by 3 are divisible by at least ten distinct primes. Math. Comp. 31, 1977, 274–279.

    MATH  MathSciNet  Google Scholar 

  170. KISHORE, M. The Number of Distinct Prime Factors for Which a(N) = 2N, a(N)=2N±1and 4)(N)IN-1. Ph.D. Thesis, University of Toledo, Ohio, 1977, 39 pages.

    Google Scholar 

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

    Google Scholar 

  172. POMERANCE, C. On composite n for which 0(n)In-1.II Pacific J. Math., 69, 1977, 177–186.

    MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  175. STEWART, C.L. On divisors of Fermat, Fibonacci, Lucas, and Lehmer numbers. Proc. London Math. Soc., (3), 35, 1977, 425–447.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Article  MATH  Google Scholar 

  178. COHEN, G.L. On odd perfect numbers. Fibonacci Quart., 16, 1978, 523–527.

    MATH  MathSciNet  Google Scholar 

  179. HAUSMAN, M. & SHAPIRO, H.N., Adding totatives. Math. Mag., 51, 1978, 284–288.

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  181. RIVEST, R.L. Remarks on a proposed cryptanalytic attack on the M.I.T. public-key cryptosystem. Cryptologia, 2, 1978.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  185. CHEIN, E.Z.Non-existence of odd perfect numbers of the form gall q22qg6 and 51 a2 a9 q2 q9 Ph.D. Thesis, Pennsylvania State Univ., 1979.

    Google Scholar 

  186. BAILLIE, R & WAGSTAFF, Jr., S.S., Lucas pseudoprimes. Math. Comp., 35, 1980, 1391–1417.

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  188. 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  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  193. WALL, D.W. Conditions for 0(N) to properly divide N —1. In A Collection 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 

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

    Article  MATH  MathSciNet  Google Scholar 

  195. DIXON, J.D. Asymptotically fast factorization of integers. Math. Comp., 36, 1981, 255–260.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  197. KISHORE, M On odd perfect, quasi perfect and odd almost perfect numbers. Math. Comp., 36, 1981, 583–586.

    Article  MATH  MathSciNet  Google Scholar 

  198. KNUTH, D.E. The Art of Computer Programming, Vol. 2, 2nd edition. Addison-Wesley, Reading, Mass., 1981.

    MATH  Google Scholar 

  199. KONHEIM, A.G.Cryptography: A Primer. Wiley-Interscience, New York, 1981.

    MATH  Google Scholar 

  200. 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.

    Chapter  Google Scholar 

  201. LUNEBURG, H. Ein einfacher Beweis für den Satz von Zsigmondy über primitive Primteiler von AN —1. In Geometries and Groups (edited by M. Aigner & D. Jungnickel). Lecture Notes in Math., #893, 219–222. Springer-Verlag, New York, 1981.

    Chapter  Google Scholar 

  202. POMERANCE, C. Recent developments in primality testing. Math. Intelligencer, 3, No. 3, 1981, 97–105.

    Article  MATH  MathSciNet  Google Scholar 

  203. SHOREY, T.N. & STEWART, C.L. On divisors of Fermat, Fibonacci, Lucas and Lehmer numbers, II. J. London Math. Soc., (2), 23, 1981, 17–23.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  205. HOOGENDOORN, P.J. On a secure public-key cryptosystem. In Computational Methods in Number Theory (edited by H.W. Lenstra Jr. & R. Tijdeman), Part I, 159–168. Math. Centre Tracts, #154, Amsterdam, 1982.

    Google Scholar 

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

    Google Scholar 

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

    MathSciNet  Google Scholar 

  208. POMERANCE, C. Analysis and comparison of some integer factoring algorithms. In Computational Methods in Number Theory (edited by H.W. Lenstra Jr. & R. Tijdeman), Part I, 89–139. Math. Centre Tracts, #154, Amsterdam, 1982.

    Google Scholar 

  209. VAN EMDE BOAS, P. Machine models, computational complexity and number theory. In Computational Methods in Number Theory (edited by H.W. Lenstra Jr. & R. Tijdeman), Part I, 7–42. Math. Centre Tracts, #154, Amsterdam, 1982.

    Google Scholar 

  210. VORHOEVE, M., Factorizations algorithms of exponential order. In Computational Methods in Number Theory (edited by H.W. Lenstra Jr. & R. Tijdeman), Part I, 79–87. Math. Centre Tracts, #154, Amsterdam, 1982.

    Google Scholar 

  211. WILLIAMS, H.C., A class of primality tests for trinomials which includes the Lucas-Lehmer test. Pacific J. Math., 98, 1982, 477–494.

    MATH  MathSciNet  Google Scholar 

  212. WILLIAMS, H.C., The influence of computers in the development of number theory. Comp. & Maths. with Appl., 8, 1982, 75–93.

    Article  MATH  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  215. BRILLHART, J., LEHMER, D.H., SELFRIDGE, J.E., TUCKERMAN, B. & WAGSTAFF, Jr., S.S.Factorizations of b n± 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 

  216. 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.

    MATH  MathSciNet  Google Scholar 

  217. KELLER, W. Factors of Fermat numbers and large primes of the form k • 2n + 1. Math. Comp., 41, 1983, 661–673.

    MATH  MathSciNet  Google Scholar 

  218. KISHORE, M. Odd perfect numbers not divisible by 3, II. Math. Comp., 40, 1983, 405–411.

    MATH  MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  221. RUMELY, R.S. Recent advances in primality testing. Notices Amer. Math. Soc., 30, No. 5, 1983, 475–477.

    MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  225. DIXON, J.D. Factorization and primality tests. Amer. Math. Monthly, 91, 1984

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  228. 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 

  229. ROTKIEWICZ, A. On the congruence 2n-2 E 1 (mod n). Math. Comp., 43, 1984, 271–272.

    MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  231. WILLIAMS, H.C. Factoring on a computer. Math. Intelligencer, 6, 1984, No. 3, 29–36.

    Article  MATH  MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

  233. BACH, E.Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms. A.C.M. Distinguished Dissertations. M.I.T. Press, Cambridge, 1985.

    MATH  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  235. BOSMA, W. Primality testing using elliptic curves. Math. Inst., Univ. Amsterdam, Report 85–12, 54 pages, 1985.

    Google Scholar 

  236. DUBNER, H. & DUBNER, R., The development of a powerful low-cost computer for number theory applications. J. Recr. Math., 18, 1985/6, 92–96.

    Google Scholar 

  237. KELLER, W. The 17th prime of the form 5.211+ 1. Abstract Amer. Math. Soc., 6, No. 1, 1985, p. 121.

    Google Scholar 

  238. ONDREJKA, R. Ten extraordinary primes. J. Recr. Math., 18, 1985/86, 87–92.

    Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  241. ADLEMAN, L.M. & HUANG, M.-D.A.Recognizing primes in random polynomial time. Preprint, 1986.

    Google Scholar 

  242. ERDÖS, P. & POMERANCE, C., On the number of false witnesses for a composite number. Math. Comp., 46, 1986, 259–279.

    MATH  MathSciNet  Google Scholar 

  243. KISS, P., PHONG, B.M. & LIEUWENS, E. On Lucas pesudoprimes which are products of s primes. In Fibonacci Numbers and their Applications (edited by A.N. Philippou, G.E. Bergum & A.F. Horadam), 131–139. Reidel, Dordrecht, 1986.

    Chapter  Google Scholar 

  244. LENSTRA, Jr., H.W. Elliptic curves and number-theoretic algorithms. Math. Inst., Univ. Amsterdam, Report 86–19, 18 pages, 1986.

    Google Scholar 

  245. LENSTRA, Jr., H.W. Factoring integers with elliptic curves. Math. Inst., Univ. Amsterdam. Report 86–18, 19 pages, 1986.

    Google Scholar 

  246. SHEN, M.K. On the congruence 2n-k n 1 (mod n). Math. Comp., 46, 1986, 715–716.

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  249. ADLEMAN, L.M. & McCURLEY, K.S.Open problems in number theoretic complexity, in Discrete Algorithms and Complexity237–262. Academic Press, New York, 1987.

    Google Scholar 

  250. BRILLHART, J., MONTGOMERY, P.L. & SILVERMAN, R.D., Tables of Fibonacci and Lucas factorizations. To appear.

    Google Scholar 

  251. COHEN, H. & LENSTRA, A.K., Implementation of a new primality test (and Supplement). Math. Comp., 48, 1987, 103–121, and S1–S4.

    Article  MATH  MathSciNet  Google Scholar 

  252. KISS, P. & PHONG, B.M., On a problem of A. Rotkiewicz. Math. Comp., 48, 1987, 751–755.

    Article  MATH  MathSciNet  Google Scholar 

  253. McDANIEL, W.L. The generalized pseudoprime congruence an-k n bn-k (mod n). C.R. Math. Rep. Acad. Sci. Canada, 9, 1987, 143–148.

    MATH  MathSciNet  Google Scholar 

  254. POMERANCE, C. Very short primality proofs. Math. Comp., 48, 1987, 315–322.

    Article  MATH  MathSciNet  Google Scholar 

  255. YOUNG, J. & BUELL, D.A. The twentieth Fermat number is composite. Math. Comp. (to appear).

    Google Scholar 

  256. McDANIEL, W.L. The existence of solutions of the generalized pseudoprime congruence ac n-k n bcn-k (modn). Preprint, to appear in 1988

    Google Scholar 

  257. PHONG, B.M., Generalized solution of Rotkiewicz’s problem. Mat. Lapok, to appear in 1988

    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

© 1989 Springer-Verlag New York Inc.

About this chapter

Cite this chapter

Ribenboim, P. (1989). How to Recognize Whether a Natural Number is a Prime?. In: The Book of Prime Number Records. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-0507-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-0507-1_3

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4684-0509-5

  • Online ISBN: 978-1-4684-0507-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation