Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



On factorisation, with a suggested new approach

Author: J. C. P. Miller
Journal: Math. Comp. 29 (1975), 155-172
MSC: Primary 10A25; Secondary 10-04
MathSciNet review: 0366796
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: This paper gives a brief survey of methods based mainly on Fermat's Theorem, for testing and establishing primality of large integers. It gives an extension of the Fermat-Lucas-Lehmer Theorems which allows us to establish primality, or to factorise composites, in cases where the Carmichael $ \lambda $-exponent is known (or a multiple or submultiple of it, by a moderate factor). The main part of the paper is concerned with describing a method for determining the $ \lambda $-exponent in cases where the Fermat test is not satisfied. This method is a variation of A. E. Western's method for finding indices and primitive roots, based on congruences $ N = a + b$, where N is the number whose exponent is required, and both a and b are $ {A_k}$-numbers, that is, having no factor larger than $ {p_k}$, the kth prime. The most onerous problem lies in the finding of a sufficient number of congruences (at least k) and in the choice of a suitable value of k. The determination of the approximate number of $ {A_k}$-splittings available is considered, to allow an estimate of the amount of labour (human or electronic) needed to be made.

The final suggestion, rather inconclusive, is that the method has possibilities worth exploring further and may be as economical, after development, as existing methods, and possibly more so when N is large.

References [Enhancements On Off] (What's this?)

  • [J] BRILLHART & J. L. SELFRIDGE 1967, "Some factorizations of $ {2^n} \pm 1$ and related results," Math. Comp., v. 21, 1967, pp. 87-96; Corrigendum, ibid., v. 21, 1967, p. 751. MR 37 #131. MR 0224532 (37:131)
  • [N] G. DE BRUIJN 1951, "On the number of positive integers $ \leqslant x$ and free of prime factors $ > y$," Nederl. Akad. Wetensch. Proc. Ser. A, v. 54, 1951, pp. 50-60. MR 13, 724. MR 0046375 (13:724e)
  • [R] CARMICHAEL 1914, The Theory of Numbers.
  • [G] H. HARDY 1940, Ramanujan, Cambridge Univ. Press, Cambridge. MR 3, 71.
  • [D] G. HAZLEWOOD 1973, Bull. London Math. Soc., v. 5, 1973, pp. 159-163. MR 0337846 (49:2615)
  • [D] H. LEHMER 1933, "Some new factorizations of $ {2^n} \pm 1$," Bull. Amer. Math. Soc., v. 39, 1933, pp. 105-108. MR 1562560
  • [D] H. LEHMER 1936, Amer. Math. Monthly, v. 43, 1936, pp. 347-354. MR 1523680
  • [D] H. LEHMER 1939, "A factorization theorem applied to a test for primality," Bull. Amer. Math. Soc., v. 45, 1939, pp. 132-137. MR 1563926
  • [P] POULET 1928, Sphinx-Oedipe, 23, 1928.
  • [A] E. WESTERN & J. C. P. MILLER 1968, Tables of Indices and Primitive Roots, Roy. Soc. Math. Tables, vol. 9, Cambridge Univ. Press, London. MR 39 #7792. MR 0246488 (39:7792)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 10A25, 10-04

Retrieve articles in all journals with MSC: 10A25, 10-04

Additional Information

Keywords: Factorisation of integers, indices, exponents
Article copyright: © Copyright 1975 American Mathematical Society

American Mathematical Society