We say that a set S is additively decomposed into two sets A and B if S = {a+b: a ∈ A, b ∈ B}. A. Sárközy has recently conjectured that the set Q of quadratic residues modulo a prime p does not have nontrivial decompositions. Although various partial results towards this conjecture have been obtained, it is still open. Here we obtain a nontrivial upper bound on the number of such decompositions.5 page(s
For infinitely many primes $p=4k+1$ we give a slightly improved upper bound for the maximal cardinal...
We use the Burgess bound and combinatorial sieve to obtain an upper bound on the number of primes p ...
Using A. Weil’s estimates the authors have given bounds for the largest prime P0 such that all prime...
We say that a set ${\mathcal S}$ is additively decomposed into two sets ${\mathcal A}$ and ${\mathca...
Abstract. It has been conjectured by Sárközy that with finitely many exceptions, the set of quadra...
In 1952, Perron showed that quadratic residues in a field of prime order satisfy certain additive pr...
Abstract. In this article, we shall study a problem of the following nature. Given a natural number ...
In 1952, Perron showed that quadratic residues in a field of prime order satisfy certain additive pr...
AbstractIf S is a nonempty, finite subset of the positive integers, we address the question of when ...
AbstractIf S is a nonempty finite set of positive integers, we find a criterion both necessary and s...
If an element in a given field can be expressed as a product of two equivalent elements that are als...
Using the group consisting of the eight Möbius transformations x, – x, 1/x,−1/x, (x−1)/(x+1),(x+1)/(...
Using the group consisting of the eight Möbius transformations x, – x, 1/x,−1/x, (x−1)/(x+1),(x+1)/(...
We study the equidistribution of multiplicatively defined sets, such as the squarefree integers, qua...
Using the group consisting of the eight Möbius transformations x, – x, 1/x,−1/x, (x−1)/(x+1),(x+1)/(...
For infinitely many primes $p=4k+1$ we give a slightly improved upper bound for the maximal cardinal...
We use the Burgess bound and combinatorial sieve to obtain an upper bound on the number of primes p ...
Using A. Weil’s estimates the authors have given bounds for the largest prime P0 such that all prime...
We say that a set ${\mathcal S}$ is additively decomposed into two sets ${\mathcal A}$ and ${\mathca...
Abstract. It has been conjectured by Sárközy that with finitely many exceptions, the set of quadra...
In 1952, Perron showed that quadratic residues in a field of prime order satisfy certain additive pr...
Abstract. In this article, we shall study a problem of the following nature. Given a natural number ...
In 1952, Perron showed that quadratic residues in a field of prime order satisfy certain additive pr...
AbstractIf S is a nonempty, finite subset of the positive integers, we address the question of when ...
AbstractIf S is a nonempty finite set of positive integers, we find a criterion both necessary and s...
If an element in a given field can be expressed as a product of two equivalent elements that are als...
Using the group consisting of the eight Möbius transformations x, – x, 1/x,−1/x, (x−1)/(x+1),(x+1)/(...
Using the group consisting of the eight Möbius transformations x, – x, 1/x,−1/x, (x−1)/(x+1),(x+1)/(...
We study the equidistribution of multiplicatively defined sets, such as the squarefree integers, qua...
Using the group consisting of the eight Möbius transformations x, – x, 1/x,−1/x, (x−1)/(x+1),(x+1)/(...
For infinitely many primes $p=4k+1$ we give a slightly improved upper bound for the maximal cardinal...
We use the Burgess bound and combinatorial sieve to obtain an upper bound on the number of primes p ...
Using A. Weil’s estimates the authors have given bounds for the largest prime P0 such that all prime...