Paul Erdös has proposed the following problem: (1) “Is it true that lim n max m n (m d(m)) n?, where d(m) represents the number of all positive divisors of m.” We clearly have: Lemma 1. * 1 ( ) \ 0,1,2, ()! , ()!,..., , 0s sn sN N N, such that n p1 1 ps s 1, where p1, p2,... constitute the increasing sequence of all positive primes. Lemma 2. Let s *. We define the subsequence ns (i) p1 1 ps s 1, where 1,..., s are arbitrary elements of, such that s 0 and 1... s and we order it such that ns(1) ns(2)... (increasing sequence). We find an infinite number of subsequences ()sn i, when s traverses * , with the properties: a) lim i ns (i) for all s b
Let a1, a2,. be a sequence of integers and let D = {d1…d2} be a fixed finite set of integers. For ea...
An arithmetic progression is a sequence of numbers such that the difference between the consecutive ...
Let a 1 < a 2 < … be an infinite sequence of positive integers and denote by R 2 (...
Let n, d, k ≥ 2, b, y and l ≥ 3 be positive integers with the greatest prime factor of b not exceedi...
AbstractAn elementary construction of a sequence of positive integers is given. The sequence settles...
AbstractLet x1,…,xr be a sequence of elements of Zn, the integers modulo n. How large must r be to g...
AbstractLet p1,p2,… be the sequence of all primes in ascending order. The following result is proved...
concerning the upper est’imate of.&f(n) = max N(12,x) = max j 2 p(d) /. * t din d<z Previo...
AbstractIn 1997 Berend proved a conjecture of Erdős and Graham by showing that for every positive in...
We study the set D of positive integers d for which the equation $\phi(a)-\phi(b)=d$ has infinitely ...
A new conjecture in prime number theory is established. Namely, if 0 < α < 1 then the followin...
Sequence, increasing, bounded, supremumThe supremum (or least upper bound) of a sequence an is a num...
AbstractIn this paper, we study a combinatorial problem originating in the following conjecture of E...
In this paper we consider an analogue of the problem of Erdos and Woods for arithmetic progressions....
AbstractWe define h(n) to be the largest function of n such that from any set of n nonzero integers,...
Let a1, a2,. be a sequence of integers and let D = {d1…d2} be a fixed finite set of integers. For ea...
An arithmetic progression is a sequence of numbers such that the difference between the consecutive ...
Let a 1 < a 2 < … be an infinite sequence of positive integers and denote by R 2 (...
Let n, d, k ≥ 2, b, y and l ≥ 3 be positive integers with the greatest prime factor of b not exceedi...
AbstractAn elementary construction of a sequence of positive integers is given. The sequence settles...
AbstractLet x1,…,xr be a sequence of elements of Zn, the integers modulo n. How large must r be to g...
AbstractLet p1,p2,… be the sequence of all primes in ascending order. The following result is proved...
concerning the upper est’imate of.&f(n) = max N(12,x) = max j 2 p(d) /. * t din d<z Previo...
AbstractIn 1997 Berend proved a conjecture of Erdős and Graham by showing that for every positive in...
We study the set D of positive integers d for which the equation $\phi(a)-\phi(b)=d$ has infinitely ...
A new conjecture in prime number theory is established. Namely, if 0 < α < 1 then the followin...
Sequence, increasing, bounded, supremumThe supremum (or least upper bound) of a sequence an is a num...
AbstractIn this paper, we study a combinatorial problem originating in the following conjecture of E...
In this paper we consider an analogue of the problem of Erdos and Woods for arithmetic progressions....
AbstractWe define h(n) to be the largest function of n such that from any set of n nonzero integers,...
Let a1, a2,. be a sequence of integers and let D = {d1…d2} be a fixed finite set of integers. For ea...
An arithmetic progression is a sequence of numbers such that the difference between the consecutive ...
Let a 1 < a 2 < … be an infinite sequence of positive integers and denote by R 2 (...