
Four functions counting the number of subsets of $\{1, 2, ..., n\}$ having particular properties are defined by Nathanson and generalized by many authors. They derive explicit formulas for all four functions. In this paper, we point out that we need to compute only one of them as the others will follow as a consequence. Moreover, our method is simpler and leads to more general results than those in the literature.
Mathematics - Number Theory, Other combinatorial number theory, Arithmetic functions; related numbers; inversion formulas, FOS: Mathematics, relatively prime sets, Number Theory (math.NT), Euler phi function, Möbius-inversion formula, combinatorial
Mathematics - Number Theory, Other combinatorial number theory, Arithmetic functions; related numbers; inversion formulas, FOS: Mathematics, relatively prime sets, Number Theory (math.NT), Euler phi function, Möbius-inversion formula, combinatorial
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
