Related papers: An infinitary Zero sum theorem
We study random exponential sums of the form $\sum_{k=1}^nX_k\times\ex p\{i(\lambda_k^{(1)}t_1+...+\lambda_k^{(s)}t_s)\}$, where $\{X_n\}$ is a sequence of random variables and $\{\lambda_n^{(i)}:1\leq i\leq s\}$ are sequences of real…
Let $\sigma(n)$ be the sum of the divisors of $n$. Kalita and Saikia defined a number $n$ to be near superperfect if $2n+d=\sigma(\sigma(n))$ for some positive divisor $d$ of $n$. We extend some of their results about near superperfect…
In this paper, we apply the power-partible reduction to study arithmetic properties of sums involving Delannoy numbers $D_k$ and polynomials $D_k(z)$. Let $v\in\bN$ and $p$ be an odd prime. It is proved that, for any…
The theorem of Jentzsch--Szeg\H{o} describes the limit measure of a sequence of discrete measures associated to the zeroes of a sequence of polynomials in one variable. Following the presentation of this result by Andrievskii and Blatt in…
We prove a convergence theorem for partial sums of sectorial forms with vertex zero and a common semi-angle. As an example we prove an absorption theorem for sectorial forms.
We discuss several questions concerning sum-free sets in groups, raised by Erd\H{o}s in his survey "Extremal problems in number theory" (Proceedings of the Symp. Pure Math. VIII AMS) published in 1965. Among other things, we give a…
In this paper we derive uniform asymptotic expansions for the partial sums of the exponential series. We indicate how this information will be used in a later publication to obtain full and explicitly computable asymptotic expansions with…
A positive integer $n$ is said to be a Zumkeller number or an integer-perfect number if the set of its positive divisors can be partitioned into two subsets of equal sums. In this paper, we prove several results regarding Zumkeller numbers.…
Motivated by the telescoping proofs of two identities of Andrews and Warnaar, we find that infinite q-shifted factorials can be incorporated into the implementation of the q-Zeilberger algorithm in the approach of Chen, Hou and Mu to prove…
Let $C_n$ be the cyclic group of order $n$. In this paper, we provide the exact values of some zero-sum constants over $C_n \rtimes_s C_2$ where $s \not\equiv \pm1 \pmod n$, namely $\eta$-constant, Gao constant, and Erd\H{o}s-Ginzburg-Ziv…
Using the expansion in a Fourier-Gegenbauer series, we prove several identities that extend and generalize known results. In particular, it is proved among other results, that \begin{equation*}…
The idea of generating integrals analogous to generating functions is first introduced in this paper. A new proof of the well-known Finite Harmonic Series Theorem in Analysis and Analytical Number Theory is then obtained by the method of…
We give a new proof of Tietze Theorem on the convergence of infinite semi-regular continued fractions.
Goodstein sequences are numerical sequences in which a natural number m, expressed as the complete normal form to a given base a, is modified by increasing the value of the base a by one unit and subtracting one unit from the resulting…
Zeckendorf's theorem states that every positive integer can be uniquely decomposed as a sum of nonconsecutive Fibonacci numbers. The distribution of the number of summands converges to a Gaussian, and the individual measures on gaps between…
By using nonstandard analysis, and in particular iterated hyper-extensions, we give foundations to a peculiar way of manipulating ultrafilters on the natural numbers and their pseudo-sums. The resulting formalism is suitable for…
In their seminal paper from 1983, Erd\H{o}s and Szemer\'edi showed that any $n$ distinct integers induce either $n^{1+\epsilon}$ distinct sums of pairs or that many distinct products, and conjectured a lower bound of $n^{2-o(1)}$. They…
We study distribution of zeros of a complex polynomial whose coefficients has been modified. We give a new proof of the theorem of Rubinstein, and with similar method we prove a new theorem that is not generalization of the previous…
In this paper we mainly employ the Zeilberger algorithm to study congruences for sums of terms involving products of three binomial coefficients. Let $p>3$ be a prime. We prove that…
Let $s(n)$ denote the sum of the proper divisors of the natural number $n$. We show that the number of $n \leq x$ such that $s(n)$ is a sum of two squares has order of magnitude $x/\sqrt{\log x}$, which agrees with the count of $n \leq x$…