References

Back

1. N. G. W. H. Beeger, MTAC 4 (1950), 124.

2. John Brillhart and G. D. Johnson, On the Factors of Certain Mersenne Numbers, Math.

Comp. 14 (1960), 365{369, MR 23 #A832.

3. John Brillhart, Concerning the Numbers 22p+1, p Prime, Math. Comp. 16 (1962), 424{430,

MR 26 #6100.

4. John Brillhart, Some Miscellaneous Factorizations, Math. Comp. 17 (1963), 447{450.

5. John Brillhart, On the Factors of Certain Mersenne Numbers, II, Math. Comp. 18 (1964),

87{92, MR 28 #2992.

6. John Brillhart and J. L. Selfridge, Some Factorizations of 2n_1 and Related Results, Math.

Comp. 21 (1967), 87{96; Corrigendum, ibid., 751, MR 37 #131.

7. John Brillhart, D. H. Lehmer, and J. L. Selfridge, New Primality Criteria and Factorizations

of 2m _ 1, Math. Comp. 29 (1975), 620{647, MR 52 #5546.

8. R. D. Carmichael, On the Numerical Factors of the Arithmetic Forms _n _ _n, Annals of

Math. (2) 15 (1913-1914), 30{70.

9. R. D. Carmichael, Fermat Numbers Fn = 22n

+1, Amer.Math. Monthly 26 (1919), 137{146.

10. Carnegie Institution ofWashington, News Service Bulletin (School Edition), III, No. 3, March

12, 1933, 19{22.

11. A. J. C. Cunningham and H. J. Woodall, Factorisation of yn _ 1, y = 2; 3; 5; 6; 7; 10; 11; 12

Up to High Powers (n), Hodgson, London, 1925.

12. L. E. Dickson, History of the Theory of Numbers, Chelsea, New York, 1952, Ch. XIV.

13. John D. Elder, Errata in the Lehmer Factor Stencils, Bull. Amer. Math. Soc. 43 (1937),

253{255.

14. A. Ferrier, A New Factorization of 2n + 1, MTAC 3 (1949), 451.

15. A. Ferrier, Note on the Factors of 2n + 1, MTAC 3 (1949), 496{497, MR 11, 11.

16. A. Ferrier, New Factorizations of 2n _ 1, MTAC 4 (1950), 54{55.

17. A. Ferrier, On Large Primes and Factorizations III, MTAC 4 (1950), 124{125; Corrigendum,

MTAC 5 (1951), 259.

18. A. Ferrier, On the Number 2151 + 1, MTAC 5 (1951), 55.

19. A. Ferrier, The Determination of a Large Prime, MTAC 6 (1952), 256.

20. E. Gabard, Factorization d'un Nouveau Nombre de Mersenne, Mathesis (1959), 61.

21. C. F. Gauss, Disquisitiones Arithmeticae, tr. by A. A. Clarke, S. J., Yale University Press,

1966, MR 33 #5545.

22. Donald B. Gillies, Three New Mersenne Primes and a Statistical Theory, Math. Comp. 18

(1964), 93{95.

23. G. Gostin, A Factor of F17, Math. Comp. 35 (1980), 975{976, MR 81f:10010.

24. Richard K. Guy, How to Factor a Number, Congressus Numerantium 16 (1976), 49{89, MR

53 #7924.

25. Marshall Hall, Quadratic Residues in Factorization, Bull. Amer. Math. Soc. 39 (1933), 951{

953.

26. John C. Hallyburton and John Brillhart, Two New Factors of Fermat Numbers, Math.Comp.

29 (1975), 109{112; Corrigendum, Math. Comp. 30 (1976), 198, MR 52 #13599.

27. Alexander Hurwitz and J. L. Selfridge, Fermat Numbers and Perfect Numbers, AMS Notices

8 (1961), 601.

28. Alexander Hurwitz, New Mersenne Primes, Math. Comp. 16 (1962), 249{251, MR 26

#3684.

29. K. R. Isemonger, The Complete Factorization of 2132 + 1, Math. Comp. 14 (1960), 73{74,

MR 22 #22.

30. K. R. Isemonger, Complete Factorization of 2159 􀀀1, Math. Comp. 15 (1961), 295{296, MR

23 #A1577.

31. K. R. Isemonger, Some Additional Factorizations of 2n_1, Math. Comp. 19 (1965), 145{146,

MR 30 #1081.

32. D. Knuth, The Art of Computer Programming, v. 2, Seminumerical Algorithms, Addison-

Wesley, Reading, Mass., 1969 (1st ed.), 1981 (2nd ed.), MR 44 #3531 and 83i:68003.

33. M. Kraitchik, Th_eorie des Nombres, Gauthier-Villars, Paris, 1922, Ch. 2.

34. M. Kraitchik, Th_eorie des Nombres, Tome 2, Gauthier-Villars, Paris, 1926.

35. M. Kraitchik, Recherches sur la Th_eorie des Nombres, Tome 2, Gauthier-Villars, Paris, 1929.

lxxv III E REFERENCES

36. M. Kraitchik, Introduction _a la Th_eorie des Nombres, Gauthier-Villars, Paris, 1952, MR 14,

535.

37. M. Kraitchik, On the Factorization of 2n _1, Scripta Math. 18 (1952), 39{52, MR 14, 121.

38. A. M. Legendre, Th_eorie des Nombres, Tome 1, 3rd ed., Paris, 1830, pp. 334{341; Zahlentheorie,

tr. by H. Maser, Teubner, Leipzig, 1893, pp. 329{336.

39. R. Sherman Lehman, Factoring Large Integers, Math. Comp. 28 (1974), 637{646, MR 49

#4919.

40. D. H. Lehmer, Tests for Primality by the Converse of Fermat's Theorem, Bull. Amer. Math.

Soc. 33 (1927), 327{340.

41. D. H. Lehmer, A Further Note on the Converse of Fermat's Theorem, Bull. Amer. Math.

Soc. 34 (1928), 54{56.

42. D. H. Lehmer, The Mechanical Combination of Linear Forms, Amer. Math. Monthly 35

(1928), 114{121.

43. D. H. Lehmer, On the Number (1023 􀀀 1)=9, Bull. Amer. Math. Soc. 35 (1929), 349{350.

44. D. H. Lehmer, An Extended Theory of Lucas' Functions, Annals of Math. (2) 31 (1930),

419{448.

45. D. H. Lehmer, On the Factorization of Lucas' Functions, T^ohoku Math. J. 34 (1931), 1{7.

46. D. H. Lehmer and R. E. Powers, On Factoring Large Numbers, Bull. Amer. Math. Soc. 37

(1931), 770{776.

47. D. H. Lehmer, Note on Mersenne Numbers, Bull. Amer. Math. Soc. 38 (1932), 383{384.

48. D. H. Lehmer, Some New Factorizations of 2n _ 1, Bull. Amer. Math. Soc. 39 (1933),

105{108.

49. D. H. Lehmer, A Photo-electric Number Sieve, Amer Math. Monthly 40 (1933), 401{406.

50. D. H. Lehmer, A Machine for Combining Sets of Linear Congruences, Math. Annalen 109

(1934), 661{667.

51. D. H. Lehmer, On Lucas' Test for the Primality of Mersenne's Numbers, J. London Math.

Soc. 10 (1935), 162{165.

52. D. H. Lehmer, On the Converse of Fermat's Theorem, Amer. Math. Monthly 43 (1936),

347{354.

53. D. H. Lehmer, Sur les Essais Directs de Primalit_e, Sphinx 8 (1938), 87{88.

54. D. H. Lehmer, A Factorization Theorem Applied to a Test for Primality, Bull. Amer. Math.

Soc. 45 (1939), 132{137.

55. D. H. Lehmer, Guide to Tables in the Theory of Numbers, National Research Council, Washington

D. C., 1941, MR 2, 247.

56. D. H. Lehmer, On the Factors of 2n _ 1, Bull. Amer. Math. Soc. 53 (1947), 164{167, MR

8, 441.

57. D. H. Lehmer, On the Converse of Fermat's Theorem, II, Amer. Math. Monthly 56 (1949),

300{309, MR 10, 681.

58. D. H. Lehmer, Two New Mersenne Primes, Amer. Math. Monthly 7 (1953), 72.

59. D. H. Lehmer, An Announcement Concerning the Delay Line Sieve DLS 127, Math. Comp.

20 (1966), 645{646.

60. D. H. Lehmer, Computer Technology Applied to the Theory of Numbers, Studies in Number

Theory, MAA Studies in Math., v. 6, 1969, pp. 117{151, MR 40 #84.

61. D. H. Lehmer, The Economics of Number Theoretic Computation, Computers in Number

Theory, ed. by A. O. L Atkin and B. J. Birch, Academic Press, 1971, pp. 1{9.

62. D. H. Lehmer, The Inuence of Computing on Research in Number Theory, The Inuence

of Computing on Mathematical Research and Education, Proc. of Symposium in Applied

Math., v. 20, Amer. Math. Soc., 1974, 3{12, MR 51 #316.

63. D. H. Lehmer, Exploitation of Parallelism in Number Theoretic and Combinatorial Computation,

Proc. of the Sixth Manitoba Conf. on Numerical Math. (1976), 95{111, MR 58

#27706.

64. D. H. Lehmer, A History of the Sieve Process, A History of Computing in the Twentieth

Century, Los Alamos, 1979, pp. 445{456, MR 81i:68002.

65. D. H. Lehmer and Emma Lehmer, A New Factorization Technique Using Quadratic Forms,

Math. Comp. 28 (1974), 625{635, MR 49 #7204.

66. D. N. Lehmer, On the History of the Problem of Separating a Number into Its Prime Factors,

Scienti_c Monthly (Sept. 1918), 227{234.

67. D. N. Lehmer, On a New Method of Factorization, Proc. Nat. Acad. Sci. 11 (1925), 97{98.

III E REFERENCES lxxvi

68. D. N. Lehmer, Hunting Big Game in the Theory of Numbers, Scripta Math. 1 (1932-33),

229{235.

69. D. N. Lehmer, \Factor Stencils", Revised and Extended by John D. Elder, Carnegie Institution

of Washington, Sept., 1939, pp. 1{27, MR 1, 133.

70. Emma Lehmer, Number Theory on the SWAC, Proc. Sympos. Appl. Math., v. 6, Numerical

Analysis, McGraw-Hill, 1956, 103{108, MR 18, 74.

71. E. Lucas, Th_eorie des Fonctions Num_eriques Simplement Periodiques, Amer. J. Math. 1

(1878), 184{239; 289{321.

72. E. Lucas, Th_eorie des Nombres,Tome 1, Librarie Blanchard, Paris, 1961, MR 23 #A828.

73. Michael A. Morrison and John Brillhart, The Factorization of F7, Bull. Amer. Math. Soc.

77 (1971), 264, MR 42 #3012.

74. Michael A. Morrison, A Note on Primality Testing Using Lucas Sequences, Math. Comp.

29 (1975), 181{182, MR 51 #5469.

75. Michael A. Morrison and John Brillhart, A Method of Factoring and the Factorization of

F7, Math Comp. 29 (1975), 183{205, MR 51 #8017.

76. C. Noll and L. Nickel, The 25th and 26th Mersenne Primes, Math. Comp. 35 (1980), 1387{

1390, MR 81k:10010.

77. M. Penk (unpublished private communication).

78. P. P_epin, Sur la Formule 22n

+1, C. R. Acad. Sci. Paris 85 (1877), 329{331.

79. H. C. Pocklington, The Determination of the Prime or Composite Nature of Large Numbers

by Fermat's Theorem, Proc. Camb. Phil. Soc. 18 (1914-16), 29{30.

80. J. M. Pollard, Theorems on Factorization and Primality Testing, Proc. Camb. Phil. Soc. 76

(1974), 521{528, MR 50 #6992.

81. J. M. Pollard, A Monte Carlo Method for Factorization, BIT 15 (1975), No. 3, 331{335, MR

52 #13611.

82. Carl Pomerance, J. L. Selfridge and Samuel S. Wagsta_, Jr., The Pseudoprimes to 25 _ 109,

Math. Comp. 35 (1980), 1003{1026, MR 82g:10030.

83. P. Poulet, Sphinx 4 (1934), 175.

84. R. E. Powers, Note on a Mersenne Number, Bull. Amer. Math. Soc. 40 (1934), 883.

85. E. Proth, Th_eor_emes sur les Nombres Premiers, C. R. Acad. Sci. Paris 87 (1878), 926.

86. H. Riesel, A New Mersenne Prime, MTAC 12 (1958), 60.

87. H. Riesel, Mersenne Numbers, MTAC 12 (1958), 207{213, MR 21 #657.

88. H. Riesel, A Factor of the Fermat Number F19, Math. Comp. 17 (1963), 458.

89. H. Riesel, Some Factors of the Numbers Gn = 62n

+ 1 and Hn = 102n

+ 1, Math. Comp.

23 (1969), 413{415, MR 39 #6813.

90. Raphael M. Robinson, Mersenne and Fermat Numbers, Proc. Amer. Math. Soc. 5 (1954),

842{846, MR 16, 335.

91. Raphael M. Robinson, Factors of Fermat Numbers, MTAC 11 (1957), 21{22, MR 19, 14.

92. Raphael M. Robinson, Some Factorizations of Numbers of the Form 2n _ 1, MTAC 11

(1957), 265{268, MR 20 #832.

93. Raphael M. Robinson, The Converse of Fermat's Theorem, Amer. Math. Monthly 64 (1957),

703{710, MR 20 #4520.

94. Raphael M. Robinson, A Report on Primes of the Form k:2n +1 and on Factors of Fermat

Numbers, Proc. Amer. Math. Soc. 9 (1958), 673{681, MR 20 #3097.

95. J. L. Selfridge, Factors of Fermat Numbers, MTAC 7 (1953), 274{275.

96. J. L. Selfridge and Alexander Hurwitz, Fermat Numbers and Mersenne Numbers, Math.

Comp. 18 (1964), 146{148, MR 28 #2991.

97. J. L. Selfridge and Richard K. Guy, Primality Testing with Applications to Small Machines,

Proc. Washington State Univ. Conf. on Number Theory, Pullman, 1971, pp. 45{51, MR 47

#8407.

98. J. L. Selfridge and M. C. Wunderlich, An E_cient Algorithm for Testing Large Numbers for

Primality, Congressus Numerantium, v. 12, Proc. 4th Manitoba Conf. on Numerical Math.,

Winnipeg (1974), 109{120, MR 51 #5461.

99. Daniel Shanks, Class Number, a Theory of Factorization, and Genera, 1969 Number Theory

Institute, Proc. Sympos Pure Math. 20, Amer. Math. Soc., 1970, 415{440, MR 47 #4932.

100. D. E. Shippee, Four New Factors of Fermat Numbers, Math. Comp. 32 (1978), 941, MR 57

#12359.

lxxvii

III E REFERENCES

101. David Slowinski, Searching for the 27th Mersenne Prime, J. Rec. Math. 11 (1978-79), 258{

261, MR 80g:10013.

102. Bryant Tuckerman, The 24th Mersenne Prime, Proc. Nat. Acad. Sci. USA 68 (1971), 2319{

2320, MR 45 #166.

103. Bryant Tuckerman, A Search Procedure and Lower Bound for Odd Perfect Numbers, Math.

Comp. 27 (1973), 943{949, MR 48 #3853.

104. Bryant Tuckerman, Odd-Perfect-Number Tree to 1036, to Supplement `A Search Procedure

and Lower Bound for Odd Perfect Numbers', IBM Research Report RC4695, 1974. Copy

deposited in the UMT _le and reviewed in Math. Comp. 27 (1973), 1004{1005.

105. H. S. Uhler, A New Result Concerning a Mersenne Number, MTAC 1 (1943{45), 333, 404.

106. H. S. Uhler, A Brief History of the Investigations of Mersenne's Numbers and the Latest

Immense Primes, Scripta Math. 18 (1952), 122{131, MR 14, 343.

107. H. C. Williams, A Generalization of Lehmer's Functions, Acta Arith. 29 (1976), 315{341,

MR 54 #220.

108. H. C. Williams and J. S. Judd, Determination of the Primality of N by Using Factors of

N2 _ 1, Math. Comp. 30 (1976), 157{172, MR 53 #257.

109. H. C. Williams and J. S. Judd, Some Algorithms for Prime Testing Using Generalized

Lehmer Functions, Math. Comp. 30 (1976), 867{886, MR 54 #2574.

110. H. C. Williams and R. Holte, Some Observations on Primality Testing, Math. Comp. 32

(1978), 905{917, MR 57 #16184.

111. H. C. Williams, Primality Testing on a Computer, Ars Combinatoria 5 (1978), 127{185, MR

80d:10002.

112. H. C. Williams, Some Primes with Interesting Digit Patterns, Math. Comp. 32 (1978),

1306{1310, MR 58 #484.

113. H. C. Williams and E. Seah, Some Primes of the Form (an 􀀀 1)=(a 􀀀 1), Math. Comp. 33

(1979), 1337{1342, MR 80g:10014.

114. H. C. Williams and G. Matthew, Some New Primes of the Form k:2n +1, Math. Comp. 31

(1977), 797{798, MR 55 #12605.

115. Claude P. Wrathall, New Factors of Fermat Numbers, Math. Comp. 18 (1964), 324{325.

116. Marvin C. Wunderlich and J. L. Selfridge, A Design for a Number theory Package with an

Optimized Trial Division Routine, Comm. ACM 17 (1974), 272{276.

117. C. R. Zarnke and H. C. Williams, Computer Determination of Some Large Primes, Congressus

Numerantium, v. 3, Proc. of the Second Louisiana Conf. on Combinatorics, Graph

Theory, and Computing, Utilitas Math., Winnipeg, 1971, 563{570.

118. H. Riesel, En Bok Om Primtal, Studentlitteratur, Lund, 1968, MR 42 #4507.

Additional references (201, 202, : : : ) for the second edition appear in section

IV B. Additional references (301, 302, : : : ) for the third edition appear in section

V C.

Навигация