List of Papers

1. Odd perfect numbers are divisible by at least seven distinct primes, C. Pomerance, Acta Arith. 25 (1974), 265-300.

2. On Carmichael's conjecture, C. Pomerance, Proc. Amer. Math. Soc. 43 (1974), 297-298.

3. A search for elliptic curves with large rank, D.E. Penney and C. Pomerance, Math. Comp. 28 (1974), 851-853.

4. 714 and 715, C. Nelson, D.E. Penney and C. Pomerance, J. Rec. Math. 7 (1974), 87-89.

5. Three elliptic curves with rank at least seven, D.E. Penney and C. Pomerance, Math. Comp. 29 (1975), 965-967.

6. The second largest prime factor of an odd perfect number, C. Pomerance, Math. Comp. 29 (1975), 914-921.

7. On the congruences sigma(n) = a (mod n) and n = a (mod phi(n)), C. Pomerance, Acta Arith. 26 (1975), 265-272.

8. On an interesting property of 112359550561797752809, J.L. Hunsucker and C. Pomerance, Fibonacci Quarterly 13 (1975), 331-333.

9. There are no odd super perfect numbers less than 7 x 10^{24}, J.L. Hunsucker and C. Pomerance, Indian J. Math. 17 (1975), 107-120.

10. Some new results on odd perfect numbers, G.G. Dandapat, J.L. Hunsucker and C. Pomerance, Pacific J. Math. 57 (1975), 359-364.

11. On multiply perfect numbers with a special property, C. Pomerance, Pacific J. Math. 57 (1975), 511-517.

12. On composite n for which phi(n)|n-1, I, C. Pomerance, Acta Arith. 28 (1976), 387-389.

13. Multiply perfect numbers, Mersenne primes and effective computability, C. Pomerance, Math. Ann. 226 (1977), 195-206.

14. On a tiling problem of R.B. Eggleton, C. Pomerance, Discrete Math. 18 (1977), 63-70.

15. On composite n for which phi(n)|n-1, II, C. Pomerance, Pacific J. Math. 69 (1977), 177-186.

16. On the distribution of amicable numbers, C. Pomerance, J. reine angew. Math. 293/294 (1977), 217-222.

17. On the largest prime factors of n and n+1, P. Erdös and C. Pomerance, Aequationes Math. 17 (1978), 311-321.

18. On a class of relatively prime sequences, P. Erdös, D.E. Penney and C. Pomerance, J. Number Theory 10 (1978), 451-474.

19. The prime number graph, C. Pomerance, Math. Comp. 33 (1979), 399-408.

20. On a problem of Evelyn - Linfoot and Page in additive number theory, C. Pomerance and D. Suryanarayana, Publ. Math. Debrecen 26 (1979), 237-244.

21. Nearly parallel vectors, H.G. Diamond and C. Pomerance, Mathematika 26 (1979), 258-268.

22. Some number theoretic matching problems, C. Pomerance, Proceedings of the Queen's Number Theory Conference, P. Ribenboim, ed., Queen's Papers in Pure and Applied Mathematics, No. 54, Kingston, Canada, 1979, 237-247.

23. Collinear subsets of lattice point sequences - an analogue of Szemerédi's theorem, C. Pomerance, J. Combinatorial Theory (A) 28 (1980), 140-149.

24. A note on the least prime in an arithmetic progression, C. Pomerance, J. Number Theory 12 (1980), 218-223.

25. The pseudoprimes to 25 x 10^9, C. Pomerance, J.L. Selfridge and S.S. Wagstaff, Jr., Math. Comp. 35 (1980), 1003-1026.

26. Matching the natural numbers up to n with distinct multiples in another interval, P. Erdös and C. Pomerance, Nederl. Akad. Wetensch. Proc. Ser. A 83 (1980), 147-161.

27. Proof of D.J. Newman's coprime mapping conjecture, C. Pomerance and J.L. Selfridge, Mathematika 27 (1980), 69-83.

28. Popular values of Euler's function, C. Pomerance, Mathematika 27 (1980), 84-89.

29. Sets on which an entire function is determined by its range, H.G. Diamond, C. Pomerance and L. Rubel, Math. Z. 176 (1981), 383-398.

30. On the distribution of amicable numbers, II, C. Pomerance, J. reine angew. Math. 325 (1981), 183-188.

31. The arithmetic mean of the divisors of an integer, P.T. Bateman, P. Erdös, C. Pomerance and E.G. Straus, Analytic Number Theory Proceedings, Philadelphia 1980, M. I. Knopp, ed., Lecture Notes in Math. 899 (1981), 197-220.

32. On the distribution of pseudoprimes, C. Pomerance, Math. Comp. 37 (1981), 587-593.

33. Recent results in primality testing, C. Pomerance, Math. Intelligencer 3 (1981), 97-105.

34. A new lower bound for the pseudoprime counting function, C. Pomerance, Illinois J. Math. 26 (1982), 4-9.

35. The search for prime numbers, C. Pomerance, Scientific American 247, No. 6 (1982), 136-144.

36. Analysis and comparison of some integer factoring algorithms, C. Pomerance, Computational Methods in Number Theory, Part I, H.W. Lenstra, Jr. and R. Tijdeman, eds., Math. Centre Tract 154, Amsterdam, 1982, 89-139.

37. On distinguishing prime numbers from composite numbers, L.M. Adleman, C. Pomerance and R.S. Rumely, Annals Math. 117 (1983), 173-206.

38. An analogue of Grimm's problem of finding distinct prime factors of consecutive integers, P. Erdös and C. Pomerance, Utilitas Math. 24 (1983), 45-65.

39. On a problem of Oppenheim concerning `Factorisatio Numerorum', E.R. Canfield, P. Erdös and C. Pomerance, J. Number Theory 17 (1983), 1-28.

40. Implementation of the continued fraction integer factoring algorithm, C. Pomerance and S.S. Wagstaff, Jr., Congressus Numerantium 37 (1983), 99-117.

41. On the longest simple path in the divisor graph, C. Pomerance, Proc. Southeastern Conf. Combinatorics, Graph Theory, and Computing, Boca Raton, Florida, 1983, Cong. Num. 40 (1983), 291-304.

42. Moduli r for which there are many small primes congruent to a modulo r, P.T. Bateman and C. Pomerance, Publ. Math. d'Orsay 83.04 (1983), 8-19.

43. Lecture notes on primality testing and factoring - A short course at Kent State University, C. Pomerance, (based on notes by S. M. Gagola, Jr.), MAA Notes 4 (1984).

44. New ideas for factoring large integers, C. Pomerance, J. W. Smith and S. S. Wagstaff, Jr., Advances in Cryptology, Proc. Crypto 83, D. Chaum, ed., Plenum Press, New York, 1984, 81-85.

45. Estimates for certain sums involving the largest prime factor of an integer, A. Ivic and C. Pomerance, Proc. Colloquium on Number Theory 34 (1981), Topics in Classical Number Theory, North Holland, 1984, 769-789.

46. On the size of the coefficients of the cyclotomic polynomial, P. T. Bateman, C. Pomerance and R. C. Vaughan, Proc. Colloquium on Number Theory 34 (1981), Topics in Classical Number Theory, North Holland, 1984, 171-202.

47. View obstruction problems, III, T. W. Cusick and C. Pomerance, J. Number Theory 19 (1984), 131-139.

48. The normal number of prime factors of phi(n), P. Erdös and C. Pomerance, Rocky Mtn. J. Math. 15 (1985), 343-352.

49. On locally repeated values of certain arithmetic functions, I, P. Erdös, C. Pomerance and A. Sárközy, J. Number Theory 21 (1985), 319-332.

50. Multiplicative relations for sums of initial k-th powers, D.E. Penney and C. Pomerance, Amer. Math. Monthly 92 (1985), 729-731.

51. On the distribution of round numbers, C. Pomerance, Number Theory Proceedings, Ootacamund, India 1984, K. Alladi, ed., Lecture Notes in Math. 1122 (1985), 173-200.

52. The quadratic sieve factoring algorithm, C. Pomerance, Advances in Cryptology, Proceedings of Eurocrypt 84, Paris, 1984, T. Beth. N. Cot, and I. Ingemarsson, eds., Lecture Notes in Computer Sci. 209 (1985), 169-182.

53. On the Schnirelmann and asymptotic densities of certain sets of non-mulitples, P. Erdös, C. B. Lacampagne, C. Pomerance and J. L. Selfridge, Proceedings of the Southeast Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida, 1985, Congressus Numerantium 48 (1985), 67-79.

54. On sums involving reciprocals of the largest prime factor of an integer, P. Erdös and A. Ivic and C. Pomerance, Glasnik Math. 21 (1986), 283-300.

55. On the number of false witnesses for a composite number, P. Erdös and C. Pomerance, Math. Comp. 46 (1986), 259-279.

56. On primitive divisors of Mersenne numbers, C. Pomerance Acta Arith. 46 (1986), 355-367.

57. On the distribution of the values of Euler's function, C. Pomerance, Acta Arith. 47 (1986), 63-70.

58. On locally repeated values of certain arithmetic functions, II, P. Erdös, C. Pomerance and A. Sárközy, Acta Math. Hungarica 49 (1987), 251-259.

59. On the average number of groups of square-free order, C. Pomerance, Proc. Amer. Math. Soc. 99 (1987), 223-231.

60. The smallest n-uniform hypergraph with positive discrepancy, N. Alon, D. J. Kleitman, C. Pomerance, M. Saks and P. Seymour, Combinatorica 7 (1987), 151-160.

61. On locally repeated values of certain arithmetic functions, III, P. Erdös, C. Pomerance and A. Sárközy, Proc. Amer. Math. Soc. 101 (1987), 1-7.

62. Very short primality proofs, C. Pomerance, Math. Comp. 48 (1987), 315-322.

63. Fast, rigorous factorization and discrete logarithm algorithms, C. Pomerance, Discrete algorithms and complexity, D. S. Johnson, T. Nishizeki, A. Nozaki, H. S. Wilf, eds., Academic Press, Orlando, Florida, 1987, pp. 119-143.

64. On products of sequences of integers, C. Pomerance and A. Sárközy, Coll. Math. Soc. Janos Bolyai 51 (1987), 447-463.

65. A pipe-line architecture for factoring large integers with the quadratic sieve algorithm, C. Pomerance, J. W. Smith and R. Tuler, SIAM J. Comput. 17 (1988), 387-403.

66. On homogeneous multiplicative hybrid problems in number theory, C. Pomerance and A. Sárközy, Acta Arith. 49 (1988), 291-302.

67. On the number of distinct values of Euler's phi-function, H. Maier and C. Pomerance, Acta Arith. 49 (1988), 263-275.

68. On divisors of sums of integers, III, C. Pomerance, A. Sárközy and C. L. Stewart, Pacific J. Math. 133 (1988), 363-379.

69. The generation of random numbers that are probably prime, P. Beauchemin, G. Brassard, C. Crépeau, C. Goutier and C. Pomerance, Journal of Cryptology 1 (1988), 53-64.

70. Two methods in elementary analytic number theory, C. Pomerance, Number theory and applications, R. A. Mollin, ed., Kluwer Academic Publishers, Dordrecht, 1989, pp. 135-161.

71. On the composition of the arithmetic functions sigma and phi, C. Pomerance, Colloq. Math. 58 (1989), 11-15.

72. The probability that a random probable prime is composite, S.H. Kim and C. Pomerance, Math. Comp. 53 (1989), 721-741.

73. Fonction zêta de Riemann et conjecture de Weyl-Berry pour les tambours fractals, M. L. Lapidus and C. Pomerance, C. R. Acad. Sci. Paris (Ser. I) 310 (1990), 343-348.

74. On the normal behavior of the iterates of some arithmetic functions, P. Erdös, A. Granville, C. Pomerance and C. Spiro, Analytic Number Theory, Proc. Conf. in honor of Paul T. Bateman, B. C. Berndt, et al. eds., Birkhauser, Boston, 1990, pp. 165-204.

75. Unusually large gaps between consecutive primes, H. Maier and C. Pomerance, Trans. Amer. Math. Soc. 322 (1990), 201-237.

76. On the least prime in certain arithmetic progressions, A. Granville and C. Pomerance, J. London Math. Soc. (2) 41 (1990), 193-200.

77. Factoring, C. Pomerance, Cryptology and Computational Number Theory, C. Pomerance, ed., Proc. Symp. Appl. Math. 42, Amer. Math. Soc. Providence, 1990.

78. Cryptology and computational number theory - an introduction, C. Pomerance, Cryptology and Computational Number Theory, C. Pomerance, ed., Proc. Symp. Appl. Math. 42, Amer. Math. Soc., Providence, 1990.

79. On a theorem of Besicovitch: values of arithmetic functions that divide their arguments, P. Erdös and C. Pomerance, Indian J. Math. 32 (1990), 279-287.

80. On the prime divisors of Mersenne numbers, P. Erdös, P. Kiss and C. Pomerance, Acta Arith. 57 (1991), 267-281.

81. Carmichael's lambda function, P. Erdös, C. Pomerance and E. Schmutz, Acta Arith. 58 (1991), 363-385.

82. The distribution of Lucas and elliptic pseudoprimes, D.M. Gordon and C. Pomerance, Math. Comp. 57 (1991), 825-838.

83. Grandes déviations pour certaines fonctions arithmétiques, M. Balazard, J.L. Nicolas, C. Pomerance and G. Tenenbaum, J. Number Theory 40 (1992), 146-164.

84. The distribution of smooth numbers in arithmetic progressions, A. Balog and C. Pomerance, Proc. Amer. Math. Soc. 115 (1992), 33-43.

85. A rigorous time bound for factoring integers, H. W. Lenstra, Jr. and C. Pomerance, J. Amer. Math. Soc. 5 (1992), 483-516.

86. Reduction of huge, sparse matrices over a finite field via created catastrophes, C. Pomerance and J. W. Smith, Experimental Math. 1 (1992), 90-94.

87. The Riemann zeta function and the one dimensional Weyl-Berry conjecture for fractal drums, M.L. Lapidus and C. Pomerance, Proc. London Math. Soc. (3) 66 (1993), 41-69.

88. Average case error estimates for the strong probable prime test, I. Damgard, P. Landrock and C. Pomerance, Math. Comp. 61 (1993), 177-194.

89. Carmichael numbers, C. Pomerance, Nieuw Arch. Wisk. 11 (1993), 199-209.

90. On elements of sumsets with many prime factors, P. Erdös, C. Pomerance, A. Sárközy and C. L. Stewart, J. Number Theory 44 (1993), 93-104.

91. An upper bound in Goldbach's conjecture, J.M. Deshouillers, A. Granville, W. Narkiewicz and C. Pomerance, Math. Comp. 61 (1993), 209-213.

92. Factoring integers with the number field sieve, J. Buhler, H. W. Lenstra, Jr. and C. Pomerance, The development of the number field sieve, A. K. Lenstra and H. W. Lenstra, Jr., eds., Lecture Notes in Math. 1554, pp. 50-94, Springer-Verlag, Berlin, 1993.

93. A hyperelliptic smoothness test. I, H. W. Lenstra, Jr., J. Pila and C. Pomerance, Phil. Trans. R. Soc. London A 345 (1993), 397-408.

94. Sixes and sevens, C. Pomerance, Missouri J. Math. Sci. 6 (1994), 62-63.

95. There are infinitely many Carmichael numbers, W. R. Alford, A. Granville and C. Pomerance, Annals Math. 140 (1994), 703-722.

96. On the difficulty of finding reliable witnesses, W. R. Alford, A. Granville and C. Pomerance, Algorithmic Number Theory Proceedings (ANTS-I), L. M. Adleman and M.-D. Huang, eds., Lecture Notes in Computer Sci. 877 (1994), Springer-Verlag, Berlin, pp. 1-16.

97. Dickson polynomials with few fixed points in a finite field, C. Pomerance, J. Sichuan U. (Natural Science Ed.) 31 (1994), 460-464.

98. On a conjecture of R. L. Graham, F. Y. Cheng and C. Pomerance, Rocky Mtn. J. Math. 24 (1994), 961-975.

99. The number field sieve, C. Pomerance, Mathematics of Computation, 1943-1993, Fifty Years of Computational Mathematics, W. Gautschi, ed., Proc. Symp. Appl. Math. 48, American Mathematical Society, Providence, 1994, pp. 465-480.

100. Counting the integers factorable via cyclotomic methods, C. Pomerance and J. Sorenson, J. Algorithms, 19 (1995), 250-265.

101. On a conjecture of Crandall concerning the 3n+1 problem, Z. Franco and C. Pomerance, Math. Comp. 64 (1995), 1333-1336.

102. Implementing the self initializing quadratic sieve on a distributed network, W.R. Alford and C. Pomerance, Number Theoretic and Algebraic Methods in Computer Science, Proc. of Int'l Moscow Conference, June-July, 1993, A. J. van der Poorten, I. Shparlinski, H. G. Zimmer, eds., World Scientific, 1995, pp. 163-174.

103. Combinatorial number theory, C. Pomerance and A. Sárközy, Handbook of Combinatorics, R. L. Graham, M. Grötschel, L. Lovász, eds., Elsevier Science B.V., pp. 967-1018.

104. On the role of smooth numbers in number theoretic algorithms, C. Pomerance, Proceedings of the Intenational Congress of Mathematicians, Zurich, Switzerland 1994, Birkhauser Verlag, Basel, 1995, pp. 411-422.

105. Counterexamples to the modified Weyl-Berry conjecture, M.L. Lapidus and C. Pomerance, Math. Trans. Cambridge Phil. Soc. 119 (1996), 167-178.

106. Symmetric and asymmetric primes, P. Fletcher, W. Lindgren and C. Pomerance, J. Number Theory 58 (1996), 89-99.

107. Multiplicative independence for random integers, C. Pomerance, Analytic Number Theory, Proceedings of a Conference in Honor of Heini Halberstam, Vol. 2, B. Berndt, H. Diamond, A. Hildebrand, eds., Birkhauser, Boston, 1996, pp. 703-711.

108. On the divisors of n!, P. Erdös, S.W. Graham, A. Ivic and C. Pomerance, Analytic Number Theory, Proceedings of a Conference in Honor of Heini Halberstam, Vol. 1, B. Berndt, H. Diamond, A. Hildebrand, eds., Birkhauser, Boston, 1996, pp. 337-355.

109. A tale of two sieves, C. Pomerance, The Notices of the Amer. Math. Soc. 43 (1996), 1473-1485.

110. On primes recognizable in deterministic polynomial time, S. Konyagin and C. Pomerance, The mathematics of Paul Erdös, R. L. Graham and J. Nesetril, eds., Springer-Verlag, Berlin, pp. 176-198.

111. A search for Wieferich and Wilson primes, R. Crandall, K. Dilcher and C. Pomerance, Math. Comp. 66 (1997), 433-449.

112. On locally repeated values of certain arithmetic functions, IV, P. Erdös, C. Pomerance and A. Sárközy, The Ramanujan J. 1 (1997), 227-241.

113. Automaticity II: Descriptional complexity in the unary case, C. Pomerance, J.M. Robson and J. Shallitt, Theoretical Computer Sci. 180 (1997), 181-201.

114. Paul Erdös, number theorist extraordinaire, C. Pomerance, The Notices of the Amer. Math. Soc. 45 (1998), 19-23.

115. Rigorous discrete logarithm computations in finite fields via smooth polynomials, R. Lovorn Bender and C. Pomerance, AMS/IP Studies in Advanced Mathematics 7 (1998), 221-232.

116. Euler's function in residue classes, T. Dence and C. Pomerance, The Ramanujan Journal 2 (1998), 7-20.

117. On the distribution of champs, A. Ivic and C. Pomerance, Proceedings of the Fifth Conference of the Canadian Number Theory Association, R. Gupta and K.S. Williams, eds., CRM Proc. 19 (1999), 133-139.

118. Residue classes free of values of Euler's function, K. Ford, S. Konyagin and C. Pomerance, Number Theory in Progress, K. Gyory, H. Iwaniec, and J. Urbanowicz, eds., vol. 2, de Gruyter, Berlin and New York, 1999, pp. 805-812.

119. On the solutions to phi(n) = phi(n+k), S.W. Graham, J.J. Holt and C. Pomerance, Number Theory in Progress, K. Gyory, H. Iwaniec, and J. Urbanowicz, eds., vol. 2, de Gruyter, Berlin and New York, 1999, pp. 867-882.

120. Primes and factorization, J. Grantham and C. Pomerance, Handbook of Discrete Mathematics, K.H. Rosen, ed., CRC Press, 1999.

121. Small values of the Carmichael function and cryptographic applications, J. Friedlander, C. Pomerance and I. E. Shparlinski, Proc. Workshop on Cryptography and Computational Number Theory (CCNT'99), K.-Y. Lam, I. E. Shparlinski, H. Wang, and C. Xing, eds., Birkhäuser, 2001, pp. 25-32.

122. Prime numbers: a computational perspective, R. Crandall and C. Pomerance, 545 + xvi pages, Springer-Verlag, New York, 2001.

123. The expected number of random elements to generate a finite abelian group, C. Pomerance, Periodica Mathematica Hungarica 43 (2001), 191-198.

124. Period of the power generator and small values of the Carmichael function, J. Friedlander, C. Pomerance and I. E. Shparlinski, Math. Comp., 70 (2001), 1591-1605. Corrigendum, op. cit., 71 (2002), 1803-1806.

125. Two contradictory conjectures concerning Carmichael numbers, A. Granville and C. Pomerance, Math. Comp., 71 (2001), 883-908.

126. On the problem of uniqueness for the maximal Stirling number(s) of the second kind, E.R. Canfield and C. Pomerance, Integers, 2 (2002), paper A1, 13 pp.

127. On some problems of Makowski-Schinzel and Erdös concerning the arithmetical functions phi and sigma, F. Luca and C. Pomerance, Colloq. Math., 92 (2002), 111-130.

128. Smooth orders and cryptographic applications, C. Pomerance and I.E. Shparlinski, Proc. ANTS-V, Sydney, Australia, Springer Lecture Notes in Computer Science 2369, (2002), pp. 338-348.

129. A hyperelliptic smoothness test. II, H. W. Lenstra, Jr., J. Pila and C. Pomerance, Proc. London Math. Soc., (3) 84 (2002), 105-146.

130. Ruth-Aaron numbers revisited, C. Pomerance, to appear in Proc. Conference Paul Erdös and his Mathematics.

131. Smooth numbers and the quadratic sieve, C. Pomerance, to appear in the proceedings of an MSRI workshop, J. Buhler and P. Stevenhagen, eds.

132. Primality testing: variations on a theme of Lucas, C. Pomerance, to appear in the proceedings of an MSRI workshop, J. Buhler and P. Stevenhagen, eds.

133. Elementary thoughts on discrete logarithms, C. Pomerance, to appear in the proceedings of an MSRI workshop, J. Buhler and P. Stevenhagen, eds.

134. On generalizing Artin's conjecture on primitive roots to composite moduli, S. Li and C. Pomerance, to appear in J. Reine Angew. Math.

135. Primitive roots: a survey, S. Li and C. Pomerance, to appear in New Aspects of Analytic Number Theory (RIMS Kokyuroku No. 1274) (Y. Tanigawa, ed.), and also in Number Theoretic Methods---Future Trends, C. Jia and S. Kanemitsu, eds., Kluwer Academic Publishers.