On near relative prime number in a sequence of positive integers (Q971510): Difference between revisions

Let \(A\) be a sequence of integers. An element \(a\in A\) is said to be relprime of \(A\) when \((a,b)=1\) for all \(b\in A\setminus\{a\}\). One can show that any set of at most 16 consecutive positive integers always has a relprime. But \textit{S. S. Pillai} [Proc. Indian Acad. Sci., Sect. A 11, 6--12 (1940; Zbl 0023.10801)] showed that for \(l=17,18,\dots,430\), there exists a sequence of \(l\) consecutive integers which has no relprimes. Recently, some authors started to study related questions with respect to arithmetic progressions. \textit{M. Ohtomo} and \textit{F. Tamari} [J. Stat. Plann. Inference 106, No. 1--2, 509--515 (2002; Zbl 1004.11500)] proved the following: For every positive integer \(k\), there is a positive integer \(l_0(k)\) such that for all \(n>l_0(k)\), there exists a sequence \((a,a+k,\dots,a+(n-1)k)\) which has no relprimes. The present author investigates the so-called \(s\)-near relprime case. An element in \(A\) is \(s\)-near relprime, if it is relative prime to all but \(s\) elements of \(A\). The main theorem presented in the article is the following. For every positive integer \(k\), there is a positive integer \(l_0(k)\) such that for all \(n>l_0(k)\), there exists a sequence \((a,a+k,\dots,a+(n-1)k)\) which has no 1-near relprimes.