A new function associated with the prime factors of
E. F. Ecklund, P. Erdös and J. L. Selfridge
Math. Comp. 28 (1974), 647-649
Similar Articles |
Abstract: Let denote the least integer so that all the prime factors of are greater than k. The irregular behavior of is studied, obtaining the following bounds: Numerical values obtained for with are listed.
F. Ecklund Jr., On prime divisors of the binomial coefficient,
Pacific J. Math. 29 (1969), 267–270. MR
P. Erdös, "Some problems in number theory," in Computers in Number Theory, Academic Press, London, 1971, pp. 405-414.
- E. F. Ecklund, Jr., "On prime divisors of the binomial coefficient," Pacific J. Math., v. 29, 1969, pp. 267-270. MR 39 #5465. MR 0244148 (39:5465)
- P. Erdös, "Some problems in number theory," in Computers in Number Theory, Academic Press, London, 1971, pp. 405-414.
Retrieve articles in Mathematics of Computation
Retrieve articles in all journals
© Copyright 1974
American Mathematical Society