Related papers: The largest values of Dedekind sums

This paper is concerned with the function $r_{k,s}(n)$, the number of (ordered) representations of $n$ as the sum of $s$ positive $k$-th powers, where integers $k,s\ge 2$. We examine the mean average of the function, or equivalently,…

We determine, within 1, the value of N for which sum (s1 choose i)(s2 choose N)(s1 choose N-i)(N choose i) achieves its maximum value. Here s1 and s2 are fixed integers. This problem arises in studying the most likely value for the size of…

For a fixed positive integer n, let S_n denote the symmetric group of n! permutations on n symbols, and let maj(sigma) denote the major index of a permutation sigma. For positive integers k<m not greater than n and non-negative integers i…

We employ the spectral theory of Eisenstein series to prove that the Hardy sums, integer-valued analogs of the classical Dedekind sums, are uniformly distributed in $\mathbf{Z} / m \mathbf{Z}$ for any integer $m > 1$.

We study a generalization of the classical Dedekind sum that incorporates two Dirichlet characters and develop properties that generalize those of the classical Dedekind sum. By calculating the Fourier transform of this generalized Dedekind…

A positive integer n is said to be perfect if sigma(n)=2n, where sigma denotes the sum of the divisors of n. In this article, we show that if n is an even perfect number, then any integer m<=n is expressed as a sum of some of divisors of n.

Let $n$ and $k$ be positive integers. We denote by $v_2(n)$ the 2-adic valuation of $n$. The Stirling numbers of the first kind, denoted by $s(n,k)$, counts the number of permutations of $n$ elements with $k$ disjoint cycles. In recent…

Let $S=(a_1)\cdots(a_k)$ be a minimal zero-sum sequence over a finite cyclic group $G$. The index conjecture states that if $k=4$ and $\gcd(|G|,6)=1$, then $S$ has index 1. In this note we study the index conjecture and connect it to a…

Let $f(n)=\min_{p} |n-p|$, where $p$ is a prime. We show that there is a positive constant $\delta$ such that for any large integer $N$ there exist two positive integers $n_1$ and $n_2$ such that $N=n_1 + n_2$ and $f(n_i)\gg \ln N (\ln\ln…

We define S(um)anD(ifference) numbers as ordered pairs $(m,\, m+\Delta)$ such that the digital-sum $DS(m(m+\Delta))=\Delta.$ We consider both the decimal and the binary case. If both $m$ and $m+\Delta$ are prime numbers, we refer to SanD…

In \cite{csc}, Cetin et al. defined a new special finite sum which is denoted by $B_{1}(h,k)$. In this paper, with the help of the Hardy and Dedekind sums we will give many properties of the sum $B_{1}(h,k).$ Then we will give the…

In this paper, we reveal an internal structure within Dedekind numbers, demonstrating that they can be expressed as polynomials of powers of 2. This discovery is based on innovative concepts and methods, offering a new perspective on the…

In this paper, we evaluate a smoothed sum of the form $\displaystyle \sideset{}{^*}\sum_{d \leq X}\left(\sum_{n \leq Y} \left(\frac{8d}{n} \right ) \right)^2$, where $\left ( \frac{8d}{\cdot} \right )$ is the Kronecker symbol and…

We call $n$ a spoof odd perfect number if $n$ is odd and $n=km$ for two integers $k,m>1$ such that $\sigma(k)(m+1)=2n$, where $\sigma$ is the sum-of-divisors function. In this paper, we show how results analogous to those of odd perfect…

Let $k$ be a natural number and let $c=2.134693\ldots$ be the unique real solution of the equation $2c=2+\log (5c-1)$ in $[1,\infty)$. Then, when $s\ge ck+4$, we establish an asymptotic lower bound of the expected order of magnitude for the…

The central Delannoy numbers $D_n=\sum_{k=0}^{n}\binom{n}{k}\binom{n+k}{k}$ and the little Schr\"oder number $s_n=\sum_{k=1}^{n}\frac{1}{n}\binom{n}{k}\binom{n}{k-1}2^{n-k}$ are important quantities. In this paper, we confirm…

For any $m,n\in\mathbb{N}$ we first give new proofs for the following well known combinatorial identities \begin{equation*} S_n(m)=\sum\limits_{k=1}^n\binom{n}{k}\frac{(-1)^{k-1}}{k^m}=\sum\limits_{n\geq r_1\geq r_2\geq...\geq r_m\geq…

Let $\{U_n\}$ be given by $U_0=1$ and $U_n=-2\sum_{k=1}^{[n/2]} \b n{2k}U_{n-2k}\ (n\ge 1)$, where $[\cdot]$ is the greatest integer function. In the paper we present a summation formula and several congruences involving $\{U_n\}$.

Let $d,n$ be positive integers and $S$ be an arbitrary set of positive integers. We say that $d$ is an $S$-divisor of $n$ if $d|n$ and gcd $(d,n/d)\in S$. Consider the $S$-convolution of arithmetical functions given by (1.1), where the sum…

Let A={a_s(mod n_s)}_{s=0}^k be a system of residue classes. With the help of cyclotomic fields we obtain a theorem which unifies several previously known results concerning system A. In particular, we show that if every integer lies in…