Related papers: Kempner-like harmonic series

In this paper, we establish some expressions of Mneimneh-type binomial sums involving multiple harmonic-type sums in terms of finite sums of Stirling numbers, Bell numbers and some related variables. In particular, we present some new…

Let $A_1$ and $A_2$ be randomly chosen subsets of the first $n$ integers of cardinalities $s_2\geq s_1 = \Omega(s_2)$, such that their sumset $A_1+A_2$ has size $m$. We show that asymptotically almost surely $A_1$ and $A_2$ are almost fully…

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…

Let $\Lambda$ be the von Mangoldt function and $r_{\textit{HL}}(n) = \sum_{m_1 + m_2^2 = n} \Lambda(m_1),$ be the counting function for the Hardy-Littlewood numbers. Let $N$ be a sufficiently large integer. We prove that…

Let $\mathcal S^2$ be the Stepanov space and let $ \lambda_n\uparrow\infty$. Let $(a_n)_{n\ge 1}$ be satisfying Wiener's condition $A:= \sum_{n\ge 1} \big(\sum_{k\, :\, n\le \lambda_k \le n+1}|a_k|\big)^2 <\infty$. We prove that $\big\|…

We give conditions under which certain digit-restricted integer sets avoid $k$-term arithmetic progressions. These sets and their harmonic sums can be computed efficiently. Through large-scale search, we identify integer sets avoiding…

The binary sum-of-digits function $s$ counts the number of ones in the binary expansion of a nonnegative integer. For any nonnegative integer $t$, T.~W.~Cusick defined the asymptotic density $c_t$ of integers $n\geq 0$ such that…

We are looking for integer sets that resemble classical Cantor set and investigate the structure of their sum sets. Especially we investigate $FS(B)$ the subset sum of sequence type $B=\{\lfloor p^n\alpha\rfloor\}^\infty_{n=0}$. When $p=2$,…

We generalize the asymptotic estimates by Bubboloni, Luca and Spiga (2012) on the number of $k$-compositions of $n$ satisfying some coprimality conditions. We substantially refine the error term concerning the number of $k$-compositions of…

We prove a folklore conjecture concerning the sum-of-digits functions in bases two and three: there are infinitely many positive integers $n$ such that the sum of the binary digits of $n$ equals the sum of the ternary digits of $n$.

We study convergence properties of sparse averages of partial sums of Fourier series of continuous functions. By sparse averages, we are considering an increasing sequences of integers $n_0 < n_1 < n_2 < ...$ and looking at…

In this shortnote, a series expansion technique introduced recently by Dancs and He for generating Euler-type formulae for odd zeta values $\:\zeta{(2 k +1)}$, $\zeta{(s)}$ being the Riemann zeta function and $k$ a positive integer, is…

Assuming the generalized Riemann hypothesis and a bound for the negative discrete moments of the Riemann zeta function (resp. Dirichlet $L$-functions), we prove the existence of a logarithmic limiting distribution for the normalized partial…

The binary sum-of-digits function $\mathsf{s}$ returns the number of ones in the binary expansion of a nonnegative integer. Cusick's Hamming weight conjecture states that, for all integers $t\geq 0$, the set of nonnegative integers $n$ such…

Let $r_{k}(n)$ denote the number of representations of the positive integer $n$ as the sum of $k$ squares. We prove a generalization of a summation formula already proved by us [Advances in Applied Mathematics, 175 (2026) 103201], which…

The aim of this short note is that if $\{ a_{n}\}$ and $\{ b_{n}\}$ are two sequences of positive real numbers such that $a_{n}\to +\infty$ and $b_n$ satisfying the asymptotic formula $b_n\sim k\cdot a_{n}$, where $k>0$, then…

A generalization of the well--known Fibonacci sequence is the $k$--Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,\ldots,0,1$, and each term afterwards is the sum of the preceding $k$ terms.…

The coefficients c(n,k) defined by (1-k^2x)^(-1/k) = sum c(n,k) x^n reduce to the central binomial coefficients for k=2. Motivated by a question of H. Montgomery and H. Shapiro for the case k=3, we prove that c(n,k) are integers and study…

For a positive integer $n$ let $H_n=\sum_{k=1}^{n}1/n$ be the $n$th harmonic number. In this note we prove that for any prime $p\ge 7$, $$ \sum_{k=1}^{p-1}\frac{H_k}{k^2}\equiv \sum_{k=1}^{p-1}\frac{H_k^2}{k}…

We use elementary arguments to prove results on the order of magnitude of certain sums concerning the gcd's and lcm's of $k$ positive integers, where $k\ge 2$ is fixed. We refine and generalize an asymptotic formula of Bordell\`{e}s (2007),…