Abstract. For integers m ≥ 2 and d ≥ 1, we study the set S m of m consecutive integers which satisfies the property that for each x ∈ S m there exists y ∈ S m such that gcd(x, y) > d. This problem was first posed and studied by S. S. Pillai for the case d = 1. In this article, we elaborate on an argument of T. Vijayaraghavan for d = 1 and of Y.For an integer m ≥ 2, let S m be a set of m consecutive integers. Let d ≥ 1 be an integer. We say that the set S m has property P d if there exists an element x ∈ S m such that gcd(x, y) ≤ d for all y ∈ S m with y = x. In this case, we also say that the element x has property P d . When no such element exists, we say that S m does not have property P d . Thus, if d = 1, S m has property P 1 means that there exists x ∈ S m which is co-prime to all other elements in S m .In 1940, S. S. Pillai (in [12]) and, independently, Szekeres (see for instance, [9]) first studied the problem of finding sets S m having property P 1 . Pillai was motivated by this problem while trying to solve a folklore conjecture that a product of two or more consecutive integers is never a perfect power.This remarkable result was proved by P. Erdős and J. L. Selfridge (in [6]) in 1975. Pillai (in [12]) showed that S m has property P 1 for m < 17. Thus, any set of consecutive integers having less than 17 elements has property P 1 . Further, Pillai succeeded in proving that for 17 ≤ m ≤ 430, there exist infinitely many sets S m for which property P 1 does not hold. To prove this result, he used sieving techniques and introduced numbers known as gap numbers.
For any integer nX3; by gðZ n "Z n Þ we denote the smallest positive integer t such that every subset of cardinality t of the group Z n "Z n contains a subset of cardinality n whose sum is zero. Kemnitz (Extremalprobleme fu¨r Gitterpunkte, Ph.D. Thesis, Technische Universita¨t Braunschweig, 1982) proved that gðZ p "Z p Þ ¼ 2p À 1 for p ¼ 3; 5; 7: In this paper, as our main result, we prove that gðZ p "Z p Þ ¼ 2p À 1 for all primes pX67: r 2004 Elsevier Inc. All rights reserved. MSC: primary 11B75; secondary 20K99
Let G be a finite abelian group. By OlðGÞ; we mean the smallest integer t such that every subset ACG of cardinality t contains a non-empty subset whose sum is zero. In this article, we shall prove that for all primes p44:67 Â 10 34 ; we have OlðZ p "Z p Þ ¼ p þ OlðZ p Þ À 1 and hence we have OlðZ p "Z p Þpp À 1 þ J ffiffiffiffiffi 2p p þ 5 log pn: This, in particular, proves that a conjecture of Erdo +s (stated below) is true for the group Z p "Z p for all primes p44:67 Â 10 34 : r
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.