相关论文: Bounds for the Number of Terms of Harmonic Sums

The lower and upper bounds are found for the leading term of summatory totient function $\sum_{k\leq N}k^u\phi^v(k)$ in various ranges of $u\in{\mathbb R}$ and $v\in{\mathbb Z}$.

We prove new upper bounds for the number of representations of an arbitrary rational number as a sum of three unit fractions. In particular, for fixed $m$ there are at most $\mathcal{O}_{\epsilon}(n^{3/5+\epsilon})$ solutions of…

In this article we present a new recurrence formula for a finite sum involving the Fibonacci sequence. Furthermore, we state an algorithm to compute the sum of a power series related to Fibonacci series, without the use of term-by-term…

This paper presents the evaluation of the Euler sums of generalized hyperharmonic numbers $H_{n}^{\left( p,q\right) }$ \[ \zeta_{H^{\left( p,q\right) }}\left( r\right) =\sum\limits_{n=1}^{\infty }\dfrac{H_{n}^{\left( p,q\right) }}{n^{r}}%…

The alternating multiple harmonic sums are partial sums of the infinite series defining the Euler sums which are the alternating version of the multiple zeta value series. In this paper, we present some systematic structural results of the…

An old conjecture of Erd\H{o}s and R\'enyi, proved by Schinzel, predicted a bound for the number of terms of a polynomial $g(x) \in \mathbb{C}[x]$ when its square $g(x)^2$ has a given number of terms. Further conjectures and results arose,…

In this paper, we establish two mean value theorems for the number of solutions of the Diophantine equation $\frac{a}{n}=\frac{1}{x}+\frac{1}{y}$, in the case when $a$ is fixed and $n$ varies and in the case when both $a$ and $n$ vary.

We present a method for calculating any (nested) harmonic sum to arbitrary accuracy for all complex values of the argument. The method utilizes the relation between harmonic sums and (derivatives of) Hurwitz zeta functions, which allows a…

We present explicit formulas for the following family of parametric binomial sums involving harmonic numbers for $p=0,1,2$ and $|t|\leq1$. $$ \sum_{k=1}^{\infty}\frac{H_{k-1}t^k}{k^p\binom{n+k}{k}}\quad \mbox{and}\quad…

The paper compares the asymptotic of the expressions $\frac {1} {x} \sum\limits_{n \leq x} {f(n)}$ and $\sum\limits_{n \leq x} {\frac {f(n)} {n}}$, $\frac {1} {x} \sum\limits_{p \leq x} {f(p)}$ and $\sum\limits_{p \leq x} {\frac {f(p)}…

For coprime positive integers $q$ and $e$, let $m(q,e)$ denote the least positive integer $t$ such that there exists a sum of $t$ powers of $q$ which is divisible by $e$. We prove an upper bound for $m(q.e)$ and investigate the case where…

We define recursive harmonic numbers as a generalization of harmonic numbers. The table of recursive harmonic numbers, which is like Pascal's triangle, is constructed. A formula for recursive harmonic numbers containing binomial…

Cameron and Erd\H{o}s asked whether the number of \emph{maximal} sum-free sets in $\{1, \dots , n\}$ is much smaller than the number of sum-free sets. In the same paper they gave a lower bound of $2^{\lfloor n/4 \rfloor }$ for the number of…

We continue work started in [1] concerning integer sequences q(n), n in N, defined by q(n) = q(n-q(n-1)) + f(n), with q(1) = 1. Here, f(n), with f(1) = 0, is a given sequence. We define F as the set of semi-infinite sequence f such that the…

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

The denominators $d_n$ of the harmonic number $1+\frac12+\frac13+\cdots+\frac1n$ do not increase monotonically with~$n$. It is conjectured that $d_n=D_n={\rm LCM}(1,2,\ldots,n)$ infinitely often. For an odd prime $p$, the set…

We provide a simple algorithm for finding the optimal upper bound for sums of products of matrix entries of the form S_pi(N) := sum_{j_1, ..., j_2m = 1}^N t^1_{j_1 j_2} t^2_{j_3 j_4} ... t^m_{j_2m-1 j_2m} where some of the summation indices…

We prove that any positive rational number is the sum of distinct unit fractions with denominators in $\{p-1 : p\textrm{ prime}\}$. The same conclusion holds for the set $\{p-h : p\textrm{ prime}\}$ for any $h\in\mathbb{Z}\backslash\{0\}$,…

We first introduce the Hamming distance between two strings. Then, we apply this concept to the representations of whole numbers in base n for all positive integers n > 2. We claim that a simple formula exists for the sum of all Hamming…

A \emph{square} is a word of the form $uu$, where $u$ is a nonempty finite word. Given a finite word $w$ of length $n$, let $[w]$ denote the corresponding \emph{circular word}, i.e., the set of all cyclic rotations of $w$. We study the…