Related papers: On Certain Sums Related to the Largest Odd Divisor
Consider the representation of a rational number as a continued fraction, associated with "odd" Euclidean algorithm. In this paper we prove certain properties for the limit distribution function for sequences of rationals with bounded sum…
We give an upper bound on the number of perfect matchings in simple graphs with a given number of vertices and edges. We apply this result to give an upper bound on the number of 2-factors in a directed complete bipartite balanced graph on…
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…
In this paper we investigate some strong convergence theorems for partial sums with respect to Vilenkin system.
An upper bound of composition series of groups of finite order is obtained. The bound is a nontrivial bound and so far best possible.
We address the "sums of dilates problem" by looking for non-trivial lower bounds on sumsets of the form $k \cdot X + l \cdot X$, where $k$ and $l$ are non-zero integers and $X$ is a subset of a possibly non-abelian group $G$ (written…
We construct a new tail bound for the sum of independent random variables for situations in which the expected value of the sum is known and each random variable lies within a specified interval, which may be different for each variable.…
We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…
The lambda-dilate of a set A is lambda*A={lambda a : a \in A}. We give an asymptotically sharp lower bound on the size of sumsets of the form lambda_1*A+...+lambda_k*A for arbitrary integers lambda_1,...,lambda_k and integer sets A. We also…
We obtain the general k-correlations for a short divisor sum related to primes.
In this paper we compute the exact divisibility of exponential sums associated to binomials $F(X)=aX^{d_1} +b X^{d_2}$. In particular, for the case where $\max\{d_1,d_2\}\leq\sqrt{p-1}$, the exact divisibility is computed. As a byproduct of…
We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.
This paper investigates the Erd\H{o}s distinct subset sums problem in $\mathbb{Z}^k$. Beyond the classical variance method, using alternative statistical quantities like $\mathbb{E}[\|X\|_1]$ and $\mathbb{E}[\|X\|_3^3]$ can yield better…
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…
Much recent progress has been made concerning the probable existence of Odd Perfect Numbers, forming part of what has come to be known as Sylvester's Web Of Conditions. This paper proves some results concerning certain properties of the…
We consider the upper bound of Piltz divisor problem over number fields. Piltz divisor problem is known as a generalization of the Dirichlet divisor problem. We deal with this problem over number fields and improve the error term of this…
In this paper, we investigate the distribution of the maximum of partial sums of certain cubic exponential sums, commonly known as "Birch sums". Our main theorem gives upper and lower bounds (of nearly the same order of magnitude) for the…
For a nonempty finite set $A$ of positive integers, let $\gcd\left(A\right)$ denote the greatest common divisor of the elements of $A$. Let $f\left(n\right)$ and $\Phi\left(n\right)$ denote, respectively, the number of subsets $A$ of…
In this paper, we find the sums in closed form of certain type of Lucas-related convergent series. More precisely, we generalize the results already obtained by the author in his arXiv paper entitled: "Summation of certain infinite…
We improve the known upper bound for short exponential sums and increase the range on which a sharp upper bound is known.