相关论文: Menon's identity and arithmetical sums representin…
Menon's identity is $\sum_{a \in A}^m (a-1,m) = d(m) \varphi(m)$, where $A$ is a reduced set of residues modulo $m$. This paper contains elementary proofs of some generalizations of this result.
In this note we give a generalization of the well-known Menon's identity. This is based on applying the Burnside's lemma to a certain group action.
In this note, we give a new formula for the number of cyclic subgroups of a finite abelian group. This is based on applying the Burnside's lemma to a certain group action. Also, it generalizes the well-known Menon's identity.
By considering even functions (mod $n$) we generalize a Menon-type identity by Li and Kim involving additive characters of the group ${\Bbb Z}_n$. We use a different approach, based on certain convolutional identities. Some other…
In this short note, we give a new Menon-type identity involving the sum of element orders and the sum of cyclic subgroup orders of a finite group. It is based on applying the weighted form of Burnside's lemma to a natural group action.
We give common generalizations of the Menon-type identities by Sivaramakrishnan (1969) and Li, Kim, Qiao (2019). Our general identities involve arithmetic functions of several variables, and also contain, as special cases, identities for…
Menon's identity is a classical identity involving gcd sums and the Euler totient function $\phi$. We derived the Menon-type identity $\sum\limits_{\substack{m=1\\(m.n^s)_s=1}}^{n^s} (m-1,n^s)_s=\Phi_s(n^s)\tau_s(n^s)$ in Czechoslovak Math.…
The classical Menon's identity [7] states that \begin{equation*}\label{oldbegin1} \sum_{\substack{a\in\Bbb Z_n^\ast }}\gcd(a -1,n)=\varphi(n) \sigma_{0} (n), \end{equation*} where for a positive integer $n$, $\Bbb Z_n^\ast$ is the group of…
Menon's identity is a classical identity involving gcd sums and the Euler totient function $\phi$. A natural generalization of $\phi$ is the Klee's function $\Phi_s$. In this paper we derive a Menon-type identity using Klee's function and a…
Menon's identity states that for every positive integer $n$ one has $\sum (a-1,n) = \varphi(n) \tau(n)$, where $a$ runs through a reduced residue system (mod $n$), $(a-1,n)$ stands for the greatest common divisor of $a-1$ and $n$,…
Menon's identity is a classical identity involving gcd sums and the Euler totient function $\phi$. In a recent paper, Zhao and Cao derived the Menon-type identity $\sum\limits_{\substack{k=1}}^{n}(k-1,n)\chi(k) = \phi(n)\tau(\frac{n}{d})$,…
The Menon-Sury's identity is as follows: \begin{equation*} \sum_{\substack{1 \leq a, b_1, b_2, \ldots, b_r \leq n\\\mathrm{gcd}(a,n)=1}} \mathrm{gcd}(a-1,b_1, b_2, \ldots, b_r,n)=\varphi(n) \sigma_r(n), \end{equation*} where $\varphi$ is…
A generalization of the Catalan numbers is considered. New results include binomial identities, recursive relations and a close formula for the multivariate generating function. A simple expression for the Catalan determinant is derived.
Let $\chi$ be a Dirichlet character (mod $n$) with conductor $d$. In a quite recent paper Zhao and Cao deduced the identity $\sum_{k=1}^n (k-1,n) \chi(k)= \varphi(n)\tau(n/d)$, which reduces to Menon's identity if $\chi$ is the principal…
Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…
We define the $k$-dimensional generalized Euler function $\varphi_k(n)$ as the number of ordered $k$-tuples $(a_1,\ldots,a_k)\in {\Bbb N}^k$ such that $1\le a_1,\ldots,a_k\le n$ and both the product $a_1\cdots a_k$ and the sum $a_1+\cdots…
The multiple zeta values are generalizations of the values of the Riemann zeta function at positive integers. They are known to satisfy a number of relations, among which are the cyclic sum formula. The cyclic sum formula can be stratified…
Several combinatorial identities are presented, involving Stirling functions of the second kind with a complex variable. The identities involve also Stirling numbers of the first kind, binomial coefficients and harmonic numbers.
Based on a generalized Newton's identity, we construct a family of symmetric functions which deform the modular Hall-Littlewood functions. We also give a determinant formula for the Macdonald functions.
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…