Arithmetic progressions with common difference divisible by small primes
N. Saradha, R. Tijdeman (2008)
Acta Arithmetica
Similarity:
Displaying similar documents to “Perfect powers in arithmetic progression. A note on the inhomogeneous case”
Arithmetic progressions with common difference divisible by small primes
A generalization of Freiman's 3k-3 Theorem
Yahya Ould Hamidoune, Alain Plagne (2002)
Acta Arithmetica
Similarity:
On the structure of sets with many k-term arithmetic progressions
(2009)
Acta Arithmetica
Similarity:
Sums of multiplicative function in special arithmetic progressions
Bin Feng (2019)
Czechoslovak Mathematical Journal
Similarity:
We find, via the Selberg-Delange method, an asymptotic formula for the mean of arithmetic functions on certain APs. It generalizes a result due to Cui and Wu (2014).
Arithmetic progressions in sums of subsets of sparse sets
Tomasz Schoen (2011)
Acta Arithmetica
Similarity:
Some results on Oppenheim's "Factorisatio Numerorum" function
Florian Luca, Anirban Mukhopadhyay, Kotyada Srinivas (2010)
Acta Arithmetica
Similarity:
On disjoint arithmetic progressions
Yong-Gao Chen (2005)
Acta Arithmetica
Similarity:
Some remarks on bicommutability
M. Artigue, E. Isambert, M. Perrin, A. Zalc (1978)
Fundamenta Mathematicae
Similarity:
On non-intersecting arithmetic progressions
Régis de la Bretèche, Kevin Ford, Joseph Vandehey (2013)
Acta Arithmetica
Similarity:
We improve known bounds for the maximum number of pairwise disjoint arithmetic progressions using distinct moduli less than x. We close the gap between upper and lower bounds even further under the assumption of a conjecture from combinatorics about Δ-systems (also known as sunflowers).
The Elements of Arithmetic
Augustus DeMorgan
Similarity:
Algebra with Arithmetic and Mensuration
Brahmagupta
Similarity:
Some proofs of undecidability of arithmetic
Andrzej Grzegorczyk (1956)
Fundamenta Mathematicae
Similarity:
On the lonely runner conjecture
Ram Krishna Pandey (2010)
Mathematica Bohemica
Similarity:
Suppose runners having nonzero distinct constant speeds run laps on a unit-length circular track. The Lonely Runner Conjecture states that there is a time at which a given runner is at distance at least from all the others. The conjecture has been already settled up to seven () runners while it is open for eight or more runners. In this paper the conjecture has been verified for four or more runners having some particular speeds using elementary tools.