Related papers: On Certain Sums Related to the Largest Odd Divisor
The aim of the present work is to show that recent results of the authors on the approximation of distributions of sums of independent summands by the infinitely divisible laws on convex polyhedra can be shown via an alternative class of…
We study the systems of ordinary differential equations which are implicit with respect to the higher derivatives, appearing in the linear form, and their solutions near the singular points. The invertibility of the higher derivatives…
Given a positive rational number $n/d$ with $d$ odd, its odd greedy expansion starts with the largest odd denominator unit fraction at most $n/d$, adds the largest odd denominator unit fraction so the sum is at most $n/d$, and continues as…
We take an $L_1$-dense class of functions $\Cal F$ on a measurable space $(X,\Cal X)$ together with a sequence of independent, identically distributed $X$-space valued random variables $\xi_1,\dots,\xi_n$ and give a good estimate on the…
We show asymptotic upper and lower bounds for the greatest common divisor of N and $\sigma(N)$. We also show that there are infinitely many integers N with fairly large g.c.d. of N and $\sigma(N)$.
Sums of the form $\sum_{N_m=q}^{n}{\cdots \sum_{N_1=q}^{N_2}{a_{(m);N_m}\cdots a_{(1);N_1}}}$ where the $a_{(k);N_k}$'s are same or distinct sequences appear quite often in mathematics. We will refer to them as recurrent sums. In this…
We investigate strong divisibility sequences and produce lower and upper bounds for the density of integers in the sequence which only have (somewhat) large prime factors. We focus on the special cases of Fibonacci numbers and elliptic…
We present several sequences of Euler sums involving odd harmonic numbers. The calculational technique is based on proper two-valued integer functions, which allow to compute these sequences explicitly in terms of zeta values only.
An open problem concerning Riemann sums, posed by O. Furdui, is considered.
We use an estimate of Aksoy Yazici, Murphy, Rudnev and Shkredov (2016) on the number of solutions of certain equations involving products and differences of sets in prime finite fields to give an explicit upper bound on trilinear…
We obtain nontrivial bounds for character sums with multiplicative and additive characters over finite fields over elements with restricted coordinate expansion. In particular, we obtain a nontrivial estimate for such a sum over a finite…
We present a common ground for infinite sums, unordered sums, Riemann/Lebesgue integrals, arc length and some generalized means. It is based on extending functions on finite sets using Hausdorff metric in a natural way.
We give bounds for exponential sums over curves defined over Galois rings. We first define summation subsets as the images of lifts of points from affine opens of the reduced curve, and we give bounds for the degrees of their coordinate…
This note provides new closed forms evaluations of a few classes of exponential sums associated with elliptic curves and hyperelliptic curves.
We describe the explicit form of a left greatest common divisor and a least common multiple of solutions of a solvable linear matrix equation over a commutative elementary divisor domain. We prove that these left greatest common divisor and…
This paper discusses the distributions of missing sums and differences.
The work of this paper is devoted to obtaining strong laws for intermediately trimmed sums of random variables with infinite means. Particularly, we provide conditions under which the intermediately trimmed sums of independent but not…
Maximal inequalities refer to bounds on expected values of the supremum of averages of random variables over a collection. They play a crucial role in the study of non-parametric and high-dimensional estimators, and especially in the study…
We propose a simple derivation of an upper bound for the perimeter of an ellipse. The procedure, which relies on the use of elliptic integrals, consists in introducing, via inequalities and convexity properties, specific integrals which can…
We use the circle method to obtain tight bounds on the $L^p$ norm of an exponential sum involving the divisor function for $p > 2$.