No label defined (Q4936059)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1391718
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1391718 |
Statements
20 January 2000
0 references
Euler totient function
0 references
Jordan totient function
0 references
Möbius inversion
0 references
generating functions
0 references
0.8550763726234436
0 references
0.8176677823066711
0 references
0.8157317638397217
0 references
0.8090863227844238
0 references
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.
0 references