An upper bound of for primitive sequences
David A. Clark
Proc. Amer. Math. Soc. 123 (1995), 363-365
Full-text PDF Free Access
Similar Articles |
Abstract: A sequence of positive integers is called primitive if no term of the sequence divides any other. Erdös conjectures that, for any primitive sequence A, where the sum is over all primes less than or equal to n. We show that where is Euler's constant.
- P. Erdös and Z. Zhang, Upper bound of for primitive sequences, Proc. Amer. Math. Soc. 117 (1993), 891-895.
- J. B. Rosser and L. Schoenfield, Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), 64-94. MR 0137689 (25:1139)
Retrieve articles in Proceedings of the American Mathematical Society
Retrieve articles in all journals
© Copyright 1995
American Mathematical Society