Related papers: Generalizations of Menon's arithmetic identity

The sequence of derangements is given by the formula $D_0 = 1, D_n = nD_{n-1} + (-1)^n, n>0$. It is a classical object appearing in combinatorics and number theory. In this paper we consider two classes of sequences: first class is given by…

In this paper, we obtain a generalization of an identity due to Carlitz on Bernoulli polynomials. Then we use this generalized formula to derive two symmetric identities which reduce to some known identities on Bernoulli polynomials and…

Using elementary means, we prove several identities involving the M\"obius function, generalizing in the multidimensional case well-known formulas coming from convolution arguments.

Let $m\ge 1$ be a rational integer. We give an explicit formula for the mean value $$\frac{2}{\phi(f)}\sum_{\chi (-1)=(-1)^m}\vert L(m,\chi )\vert^2,$$ where $\chi$ ranges over the $\phi (f)/2$ Dirichlet characters modulo $f>2$ with the…

This paper provides a mean value theorem for arithmetic functions $f$ defined by $$f(n)=\prod_{d|n}g(d),$$ where $g$ is an arithmetic function taking values in $(0, 1]$ and satisfying some generic conditions. As an application of our main…

We prove the identity \[ 2W_1(x) + \log 4 + \psi\left(\tfrac{1}{2} + x\right) + \psi\left(\tfrac{3}{2} - x\right) = 0, \] where $\psi$ is the digamma function and \[ W_1(x) = 2\int_0^\infty \Re\left( \frac{y}{(y^2+1)(e^{\pi(y+2ix)} - 1)}…

In this paper we extend the notion of Melham sum to the Pell and Pell-Lucas sequences. While the proofs of general statements rely on the binomial theorem, we prove some spacial cases by the known Pell identities. We also give extensions of…

This paper further generalizes a recent result of Shannon and Ollerton who resurrected an old identity due to Ledin. This paper generalizes the Ledin-Shannon-Ollerton result to all the metallic sequences. The results give closed formulas…

Let $s(m,n)$ denote the classical \DED sum, where $n$ is a positive integer and $m\in\{0,1,\ldots, n-1\}$, $(m,n)=1$. For a given positive integer $k$, we describe a set of at most $k^2$ numbers $m$ for which $s(m,n)$ may be $\ge s(k,n)$,…

The notion of a descent polynomial, a function in enumerative combinatorics that counts permutations with specific properties, enjoys a revived recent research interest due to its connection with other important notions in combinatorics,…

In this note we present a combinatorial proof of an identity involving poly-Bernoulli numbers and Genocchi numbers. We introduce the combinatorial objects, $m-$barred Callan sequences and show that the identity holds in a more general…

The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…

We consider a new identity involving integrals and sums of Bessel functions. The identity provides new ways to evaluate integrals of products of two Bessel functions. The identity is remarkably simple and powerful since the summand and…

A generalization of Newton's identity on symmetric functions is given. Using the generalized Newton identity we give a unified method to show the existence of Hall-Littlewood, Jack and Macdonald polynomials. We also give a simple proof of…

We investigate arithmetic properties of the sequence b(n) = B_MN(n) mod M obtained from the base-M to base-N shift map B_MN.We prove that b(n) is ultimately periodic exactly when every prime divisor of M also divides N; in that case we…

We extend the notion of generalised Cesaro summation/convergence developed previously to the more natural setting of what we call "remainder" Cesaro summation/convergence and, after illustrating the utility of this approach in deriving…

For a fixed positive integer $m$ and any partition $m = m_1 + m_2 + \cdots + m_e$ , there exists a sequence $\{n_{i}\}_{i=1}^{k}$ of positive integers such that $$m=\frac{1}{n_{1}}+\frac{1}{n_{2}}+\cdots+\frac{1}{n_{k}},$$ with the property…

A product difference equation is proved and used for derivation by elementary methods of four combinatorial identities, eight combinatorial identities involving generalized harmonic numbers and eight combinatorial identities involving…

We prove an identity [Eq. (1) below] among SU(2) 6j and 9j symbols that generalizes the Biedenharn-Elliott sum rule. We prove the result using diagrammatic techniques (briefly reviewed here), and then provide an algebraic proof. This…

An integer $k$ is called regular (mod $n$) if there exists an integer $x$ such that $k^2x\equiv k$ (mod $n$). This holds true if and only if $k$ possesses a weak order (mod $n$), i.e., there is an integer $m\ge 1$ such that $k^{m+1} \equiv…