On sums involving divisor function, Euler's totient function, and floor function

26 June 2023, Version 2
This content is an early or alternative research output and has not been peer-reviewed by Cambridge University Press at the time of posting.

Abstract

Every positive integer $l \in \mathbb{N}$ can be formed $l = (m + n)d$, provided $gcd(m,n)=1$. From this point of view, the next formulas $n=\sum_{d|l} \varphi(d)$ and $\frac{n(n+1)}{2}=\sum_{k=1}^{n} \varphi(k)[\frac{n}{k}]$, and these equivalence had been proved. In this paper on an extension of these results, the next identity is proved: $\sum_{k=1}^{n} \sum_{\substack{(a+b)c=k \\ gcd(a,b)=1}} f(a,b)\cdot g(c) = \sum_{k=1}^{n} \sum_{\substack{a+b=k \\ gcd(a,b)=1}} f(a,b) \sum_{i\leq [\frac{n}{k}]} g(i) = \sum_{a+b \leq n} f(\frac{a}{gcd(a,b)},\frac{b}{gcd(a,b)})\cdot g(gcd(a,b))$. We also show the next formulas are corollaries of it: $\sum_{k=1}^{n} \tau(k)=\sum_{k=1}^{n} [\frac{n}{k}] = \sum_{a+b \leq n} \frac{1}{\varphi(\frac{a+b}{gcd(a,b)})}$, $\sum_{d|n} f(d)\cdot g(\frac{n}{d}) = \sum_{k = 1}^{n} f(gcd(k,n))\cdot\frac{g(\frac{n}{gcd(k,n)})}{\varphi(\frac{n}{gcd(k,n)})}$, $\tau(n)=\sum_{a+b = n} \frac{1}{\varphi(\frac{a+b}{gcd(a,b)})}$, $\sum_{\substack{a+b=n \\ gcd(a,b)=1}} gcd(a-1,b+1) = \sum_{a+b=n} \frac{\varphi(n)}{\varphi(\frac{n}{gcd(a,b)})}$, and so on. In addition to it, we evaluate a sequence $\sum_{k=1}^{n} \varphi(k)\tau(k)$.

Keywords

divisor function
Euler’s totient function
floor function
divisor summatory function
arithmetic function

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting and Discussion Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.