AbstractLet x1,…,xr be a sequence of elements of Zn, the integers modulo n. How large must r be to guarantee the existence of a subsequence xi1,…,xin and units α1,…,αn with α1xi1+⋯+αnxin=0? Our main aim in this paper is to show that r=n+a is large enough, where a is the sum of the exponents of primes in the prime factorisation of n. This result, which is best possible, could be viewed as a unit version of the Erdős–Ginzberg–Ziv theorem. This proves a conjecture of Adhikari, Chen, Friedlander, Konyagin and Pappalardi.We also discuss a number of related questions, and make conjectures which would greatly extend a theorem of Gao
AbstractAn Erdös-Kac type theorem is proved for the set S(x, y) = {n ≤ x: pβn ⇒ p ≤ y}, with a unifo...
AbstractLet p1,p2,… be the sequence of all primes in ascending order. The following result is proved...
If given n ∈ N and Γ, a multiplicatively closed subset of Zn, then the set HΓ = {n ∈ Z: x ∈ N: x+ nZ...
AbstractLet x1,…,xr be a sequence of elements of Zn, the integers modulo n. How large must r be to g...
A prototype of zero-sum theorems, the well-known theorem of Erdős, Ginzburg and Ziv says that for an...
A prototype of zero-sum theorems, the well-known theorem of Erdős, Ginzburg and Ziv says that for an...
A prototype of zero-sum theorems, the well-known theorem of Erdős, Ginzburg and Ziv says that for an...
In this paper, we study the linear independence between the distribution of the number of prime fact...
AbstractGiven a set A⊂N let σA(n) denote the number of ordered pairs (a,a′)∈A×A such that a+a′=n. Th...
AbstractLet n be a natural number. Erdös, Ginzburg and Ziv proved that every sequence of elements of...
Abstract. A prototype of zero–sum theorems, the well–known theorem of Erdős, Ginzburg and Ziv says ...
A primitive set is one in which no element of the set divides another. Erdős conjectured that the su...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
AbstractThe condition Σk<x|Σn<x (χ(n) − z)4Ω(n)n| = o(√logx), where Ω(n) stands for the number of pr...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
AbstractAn Erdös-Kac type theorem is proved for the set S(x, y) = {n ≤ x: pβn ⇒ p ≤ y}, with a unifo...
AbstractLet p1,p2,… be the sequence of all primes in ascending order. The following result is proved...
If given n ∈ N and Γ, a multiplicatively closed subset of Zn, then the set HΓ = {n ∈ Z: x ∈ N: x+ nZ...
AbstractLet x1,…,xr be a sequence of elements of Zn, the integers modulo n. How large must r be to g...
A prototype of zero-sum theorems, the well-known theorem of Erdős, Ginzburg and Ziv says that for an...
A prototype of zero-sum theorems, the well-known theorem of Erdős, Ginzburg and Ziv says that for an...
A prototype of zero-sum theorems, the well-known theorem of Erdős, Ginzburg and Ziv says that for an...
In this paper, we study the linear independence between the distribution of the number of prime fact...
AbstractGiven a set A⊂N let σA(n) denote the number of ordered pairs (a,a′)∈A×A such that a+a′=n. Th...
AbstractLet n be a natural number. Erdös, Ginzburg and Ziv proved that every sequence of elements of...
Abstract. A prototype of zero–sum theorems, the well–known theorem of Erdős, Ginzburg and Ziv says ...
A primitive set is one in which no element of the set divides another. Erdős conjectured that the su...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
AbstractThe condition Σk<x|Σn<x (χ(n) − z)4Ω(n)n| = o(√logx), where Ω(n) stands for the number of pr...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
AbstractAn Erdös-Kac type theorem is proved for the set S(x, y) = {n ≤ x: pβn ⇒ p ≤ y}, with a unifo...
AbstractLet p1,p2,… be the sequence of all primes in ascending order. The following result is proved...
If given n ∈ N and Γ, a multiplicatively closed subset of Zn, then the set HΓ = {n ∈ Z: x ∈ N: x+ nZ...