相关论文: Proofs, generalizations and analogs of Menon's ide…

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 $\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.

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.…

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…

In this article, we present relations for the Euler totient function $\varphi(n)$ and the number of divisors $\tau(n)$ in terms of finite sums of integer parts of rational numbers or greatest common divisors of pairs of integers. Some of…

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…

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…

We generalize Menon's identity by considering sums representing arithmetical functions of several variables. As an application, we give a formula for the number of cyclic subgroups of the direct product of several cyclic groups of arbitrary…

The $k$-dimensional generalized Euler function $\varphi_k(n)$ is defined to be the number of ordered $k$-tuples $(a_1,a_2,\ldots, a_k) \in \mathbb{N}^k$ with $1\leq a_1,a_2,\ldots, a_k \leq n$ such that both the product $a_1a_2\cdots a_k$…

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…

The aim of this article is to present in a self-contained way identities arising in elementary number theory, among which the following one: $$ \sum_{d\mid n}\frac{\mu^2(d)}{\varphi(d)\,d^s}=\prod_{p\mid n}\left(1+\frac{1}{(p-1)p^s}\right).…

For a function $f\colon \mathbb{N}\to\mathbb{N}$, define $N^{\times}_{f}(x)=\#\{n\leq x: n=kf(k) \mbox{ for some $k$} \}$. Let $\tau(n)=\sum_{d|n}1$ be the divisor function, $\omega(n)=\sum_{p|n}1$ be the prime divisor function, and…

The discrete Fourier transform of the greatest common divisor is a multiplicative function that generalises both the gcd-sum function and Euler's totient function. On the one hand it is the Dirichlet convolution of the identity with…

Euler's totient function, $\varphi(n)$, which counts how many of $0,1,\dots,n-1$ are coprime to $n$, has an explicit asymptotic lower bound of $n/\log \log n$, modulo some constant. In this note, we generalise $\varphi$; given an…

For a function $f\colon \mathbb{N}\to\mathbb{N}$, let $$ N^+_f(x)=\{n\leq x: n=k+f(k) \mbox{ for some } k\}. $$ Let $\tau(n)=\sum_{d|n}1$ be the divisor function, $\omega(n)=\sum_{p|n}1$ be the prime divisor function, and…

Let $M(x)$ denote the largest cardinality of a subset of $\{n \in \mathbf{N}: n \leq x\}$ on which the Euler totient function $\varphi(n)$ is non-decreasing. We show that $M(x) = (1+O(\frac{(\log\log x)^5}{\log x})) \pi(x)$ for all $x \geq…

We obtain an upper bound for the sum $\sum_{n\leq N} (a_{n}/\varphi (a_{n}))^{s}$, where $\varphi$ is Euler's totient function, $s\in \mathbb{N}$, and $a_{1},\ldots, a_{N}$ are positive integers (not necessarily distinct) with some…

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…

For a given real number $a$ we define the sequence $\{E_{n,a}\}$ by $E_{0,a}=1$ and $E_{n,a}=-a\sum_{k=1}^{[n/2]} \binom n{2k}E_{n-2k,a}$ $(n\ge 1)$, where $[x]$ is the greatest integer not exceeding $x$. Since $E_{n,1}=E_n$ is the n-th…