scientific article; zbMATH DE number 1391718

From MaRDI portal
Publication:4936059





Consider the following generalizations and variants of the Euler and Jordan totient functions: \[ S^k_m(n)= \sum_{\substack{ 1 \leq a_1, \ldots ,a_m \leq n\\ (a_1, \ldots , a_m,k)=1}} 1,\quad L^k_m(n)= \sum_{\substack{ 1 \leq a_1 \leq a_2 \leq \cdots \leq a_m \leq n\\ (a_1, \ldots, a_m,k)=1}} 1,\quad T^k_m(n) = \sum_{\substack{ 1 \leq a_1<a_2< \cdots <a_m \leq n\\ (a_1, \ldots, a_m, k)=1}} 1, \] where \((a_1, \ldots, a_m, k)\) denotes the greatest common divisor of \(a_1, \ldots, a_m,\) and \(k.\) The author proves the following formulas for \( S^k_m(n), L^k_m(n),\) and \(T^k_m(n):\) \[ S^k_m(n)= \sum_{ d \mid k}\mu(d)[n/d]^m,\quad L^k_m(n)= \sum_{ d \mid k} \mu(d) \binom {[n/d]+m-1} {m},\quad T^k_m(n)= \sum_{ d \mid k} \mu(d)\binom {[n/d]} {m}, \] where \([ ]\) and \(\mu(\cdot)\) denote the greatest integer function and the Möbius function, respectively.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4936059)