Regular coverings of the integers by arithmetic progressions
In the study of the -adic sum of digits function , the arithmetical function and for plays a very important role. In this paper, we firstly generalize the relation between and to a bijective relation between arithmetical functions. And as an application, we investigate some aspects of the sum of digits functions induced by binary infinite Gray codes . We can show that the difference of the sum of digits function, , is realized by an automaton. And the summation formula of the sum...
In this paper we investigate Ramanujan’s inequality concerning the prime counting function, asserting that for sufficiently large. First, we study its sharpness by giving full asymptotic expansions of its left and right hand sides expressions. Then, we discuss the structure of Ramanujan’s inequality, by replacing the factor on its right hand side by the factor for a given , and by replacing the numerical factor by a given positive . Finally, we introduce and study inequalities analogous...
This paper is closely related to an earlier paper of the author and W. Narkiewicz (cf. [7]) and to some papers concerning ratio sets of positive integers (cf. [4], [5], [12], [13], [14]). The paper contains some new results completing results of the mentioned papers. Among other things a characterization of the Steinhaus property of sets of positive integers is given here by using the concept of ratio sets of positive integers.