AbstractLet A be an infinite subset of natural numbers, n∈N and X a positive real number. Let r(n) denotes the number of solution of the equation n=a1+a2 where a1⩽a2 and a1, a2∈A. Also let |A(X)| denotes the number of natural numbers which are less than or equal to X and belong to A. For those A which satisfy the condition that for all sufficiently large natural numbers n we have r(n)≠1, we improve the lower bound of |A(X)| given by Nicolas et. al. [NRS98]. The bound which we obtain is essentially best possible
AbstractWe show that the analogue of the Erdős–Turán conjecture, for the number of representations b...
AbstractWe prove: Let n > 0 be an integer. Then we have for all real numbers r > 0: where both boun...
AbstractLet L = {l1, l2, …, lk} be a collection of k positive integers, let A be a family of subsets...
AbstractLet A be an infinite subset of natural numbers, n∈N and X a positive real number. Let r(n) d...
AbstractDenote by k = k(N) the least integer for which there exists integers b1, b2, …, bk satisfyin...
AbstractDenote by A a set of x different natural numbers. The following two results are obtained: 1....
AbstractLet Fh(N) be the maximum number of elements that can be selected from the set {1, …, N} such...
AbstractWe prove a lemma that is useful for obtaining upper bounds for the number of partitions with...
AbstractFor a set A of nonnegative integers the representation functions R2(A,n), R3(A,n) are define...
Let A, B be sets of positive integers such that A + B contains all but finitely many positive intege...
AbstractLetAbe a set of nonnegative integers,dAits lower asymptotic density, andA+A={a+a′ :a,a′∈A}. ...
AbstractErdös and Reddy (Adv. Math. 21 (1976) 78) estimated the lower bound in question to be 2.75−1...
AbstractFor a set A of positive integers and any positive integer n, let R1(A,n), R2(A,n) and R3(A,n...
AbstractLet kq(n) denote the minimal cardinality of a q-ary code C of length n and covering radius o...
AbstractIt is conjectured that all sufficiently large integers satisfying some necessary congruence ...
AbstractWe show that the analogue of the Erdős–Turán conjecture, for the number of representations b...
AbstractWe prove: Let n > 0 be an integer. Then we have for all real numbers r > 0: where both boun...
AbstractLet L = {l1, l2, …, lk} be a collection of k positive integers, let A be a family of subsets...
AbstractLet A be an infinite subset of natural numbers, n∈N and X a positive real number. Let r(n) d...
AbstractDenote by k = k(N) the least integer for which there exists integers b1, b2, …, bk satisfyin...
AbstractDenote by A a set of x different natural numbers. The following two results are obtained: 1....
AbstractLet Fh(N) be the maximum number of elements that can be selected from the set {1, …, N} such...
AbstractWe prove a lemma that is useful for obtaining upper bounds for the number of partitions with...
AbstractFor a set A of nonnegative integers the representation functions R2(A,n), R3(A,n) are define...
Let A, B be sets of positive integers such that A + B contains all but finitely many positive intege...
AbstractLetAbe a set of nonnegative integers,dAits lower asymptotic density, andA+A={a+a′ :a,a′∈A}. ...
AbstractErdös and Reddy (Adv. Math. 21 (1976) 78) estimated the lower bound in question to be 2.75−1...
AbstractFor a set A of positive integers and any positive integer n, let R1(A,n), R2(A,n) and R3(A,n...
AbstractLet kq(n) denote the minimal cardinality of a q-ary code C of length n and covering radius o...
AbstractIt is conjectured that all sufficiently large integers satisfying some necessary congruence ...
AbstractWe show that the analogue of the Erdős–Turán conjecture, for the number of representations b...
AbstractWe prove: Let n > 0 be an integer. Then we have for all real numbers r > 0: where both boun...
AbstractLet L = {l1, l2, …, lk} be a collection of k positive integers, let A be a family of subsets...