A characterization of covering equivalence
Page 1 Next
Hao Pan, Zhi-Wei Sun (2007)
Acta Arithmetica
János Barát, Péter P. Varjú (2005)
Journal de Théorie des Nombres de Bordeaux
Let the collection of arithmetic sequences be a disjoint covering system of the integers. We prove that if for some primes and integers , then there is a such that . We conjecture that the divisibility result holds for all moduli.A disjoint covering system is called saturated if the sum of the reciprocals of the moduli is equal to . The above conjecture holds for saturated systems with such that the product of its prime factors is at most .
Ron Graham, Kevin O'Bryant (2005)
Acta Arithmetica
Tom Sanders (2009)
Annales de l’institut Fourier
Suppose that is a locally compact abelian group with a Haar measure . The -ball of a continuous translation invariant pseudo-metric is called -dimensional if for all . We show that if is a compact symmetric neighborhood of the identity with for all , then is contained in an -dimensional ball, , of positive radius in some continuous translation invariant pseudo-metric and .
Yahya Ould Hamidoune, Alain Plagne (2002)
Acta Arithmetica
Polách, I. (1994)
Acta Mathematica Universitatis Comenianae. New Series
J. Van de Lune (1979)
Acta Arithmetica
Campbell, Garikai (2003)
Journal of Integer Sequences [electronic only]
Ulas, Maciej (2005)
Journal of Integer Sequences [electronic only]
Enrico Bombieri, Umberto Zannier (2002)
Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni
We show that the number of squares in an arithmetic progression of length is at most , for certain absolute positive constants , . This improves the previous result of Bombieri, Granville and Pintz [1], where one had the exponent in place of our . The proof uses the same ideas as in [1], but introduces a substantial simplification by working only with elliptic curves rather than curves of genus as in [1].
Brown, Tom C. (2005)
Integers
Michael Filaseta, Joshua Harrington (2012)
Acta Arithmetica
Melvyn B. Nathanson, Kevin O'Bryant (2015)
Acta Arithmetica
A geometric progression of length k and integer ratio is a set of numbers of the form for some positive real number a and integer r ≥ 2. For each integer k ≥ 3, a greedy algorithm is used to construct a strictly decreasing sequence of positive real numbers with a₁ = 1 such that the set contains no geometric progression of length k and integer ratio. Moreover, is a maximal subset of (0,1] that contains no geometric progression of length k and integer ratio. It is also proved that there is...
Tao, Terence (2006)
The Electronic Journal of Combinatorics [electronic only]
Štefan Znám (1969)
Colloquium Mathematicae
Katalin Gyarmati, Imre Z. Ruzsa (2012)
Acta Arithmetica
Foo, Timothy (2007)
Integers
Sun, Z.W. (1991)
Acta Mathematica Universitatis Comenianae. New Series
Yahya Ould Hamidoune, Øystein J. Rødseth (2000)
Acta Arithmetica
José del Carmen Alberto-Domínguez, Gerardo Acosta, Maira Madriz-Mendoza (2023)
Commentationes Mathematicae Universitatis Carolinae
We consider the Golomb and the Kirch topologies in the set of natural numbers. Among other results, we show that while with the Kirch topology every arithmetic progression is aposyndetic, in the Golomb topology only for those arithmetic progressions with the property that every prime number that divides also divides , it follows that being connected, being Brown, being totally Brown, and being aposyndetic are all equivalent. This characterizes the arithmetic progressions which are aposyndetic...
Page 1 Next