AbstractWe solve a problem of Filaseta by proving, that if N is sufficiently large, A ⊆ [N], |A| > N/9 and A + Adoes not contain any squarefree integer then all elements of A are congruent to 0 (mod 4) or 2 (mod 4). In order to show the main result we characterize the structure of all dense sets, whose elements sum to no squarefree number
AbstractFor any subsets A and B of an additive group G, define A + B = { a + b: a ϵ A and b ϵ B} and...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
AbstractWe solve a problem of Filaseta by proving, that if N is sufficiently large, A ⊆ [N], |A| > N...
AbstractA subset of the natural numbers isk-sum-free if it contains no solutions of the equationx1+…...
AbstractA subset A of integers is said to be sum-free if a+b∉A for any a,b∈A. Let s(n) be the number...
If $k$ is a positive integer, we say that a set $A$ of positive integers is $k$-sum-free if there do...
Cameron and Erdös have considered the question: how many sum-free sets are contained in the first n...
We give a brief survey on sum-free subsets of the natural numbers, highlighting recent results which...
AbstractIn this paper we develop a method for determining the number of integers without large prime...
AbstractWe show that any sum-free subset A⊆F3r (with an integer r⩾3), satisfying |A|>5·3r-3, is cont...
AbstractErdős and Sárkőzy proposed the problem of determining the maximal density attainable by a se...
Abstract. In this paper we study sum-free subsets of the set {1,..., n}, that is, subsets of the fir...
We study the equidistribution of multiplicatively defined sets, such as the squarefree integers, qua...
Abstract. In this paper we study sum-free subsets of the set {1,..., n}, that is, subsets of the fir...
AbstractFor any subsets A and B of an additive group G, define A + B = { a + b: a ϵ A and b ϵ B} and...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
AbstractWe solve a problem of Filaseta by proving, that if N is sufficiently large, A ⊆ [N], |A| > N...
AbstractA subset of the natural numbers isk-sum-free if it contains no solutions of the equationx1+…...
AbstractA subset A of integers is said to be sum-free if a+b∉A for any a,b∈A. Let s(n) be the number...
If $k$ is a positive integer, we say that a set $A$ of positive integers is $k$-sum-free if there do...
Cameron and Erdös have considered the question: how many sum-free sets are contained in the first n...
We give a brief survey on sum-free subsets of the natural numbers, highlighting recent results which...
AbstractIn this paper we develop a method for determining the number of integers without large prime...
AbstractWe show that any sum-free subset A⊆F3r (with an integer r⩾3), satisfying |A|>5·3r-3, is cont...
AbstractErdős and Sárkőzy proposed the problem of determining the maximal density attainable by a se...
Abstract. In this paper we study sum-free subsets of the set {1,..., n}, that is, subsets of the fir...
We study the equidistribution of multiplicatively defined sets, such as the squarefree integers, qua...
Abstract. In this paper we study sum-free subsets of the set {1,..., n}, that is, subsets of the fir...
AbstractFor any subsets A and B of an additive group G, define A + B = { a + b: a ϵ A and b ϵ B} and...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
DOI
Add to ORKG