English

Relatively Prime Sets, Divisor Sums, and Partial Sums

Number Theory 2013-06-21 v1

Abstract

For a nonempty finite set AA of positive integers, let gcd(A)\gcd\left(A\right) denote the greatest common divisor of the elements of AA. Let f(n)f\left(n\right) and Φ(n)\Phi\left(n\right) denote, respectively, the number of subsets AA of {1,2,,n}\left\{1, 2, \ldots, n\right\} such that gcd(A)=1\gcd\left(A\right) = 1 and the number of subsets AA of {1,2,,n}\left\{1, 2, \ldots, n\right\} such that gcd(A{n})=1\gcd\left(A\cup\left\{n\right\}\right) =1. Let D(n)D\left(n\right) be the divisor sum of f(n)f\left(n\right). In this article, we obtain partial sums of f(n)f\left(n\right), Φ(n)\Phi\left(n\right) and D(n)D\left(n\right). We also obtain a combinatorial interpretation and a congruence property of D(n)D\left(n\right). We give open questions concerning Φ(n)\Phi\left(n\right) and D(n)D\left(n\right) at the end of this article.

Keywords

Cite

@article{arxiv.1306.4891,
  title  = {Relatively Prime Sets, Divisor Sums, and Partial Sums},
  author = {Prapanpong Pongsriiam},
  journal= {arXiv preprint arXiv:1306.4891},
  year   = {2013}
}

Comments

submitted

R2 v1 2026-06-22T00:37:34.602Z