Related papers: Maximizing the number of rational-value sums or ze…

We give a sharpened form of Siegel Lemma's w. r. t. the maximum norm. This implies a new lower bound on the greatest element of a sum-distinct set of positive integers (Erd\"os-Moser problem). The main tools are Minkowski's theorem on…

Let $n$ be a positive integer and let $S$ be a sequence of $n$ integers in the interval $[0,n-1]$. If there is an $r$ such that any nonempty subsequence with sum $\equiv 0$ $\pmod n$ has length $=r,$ then $S$ has at most two distinct…

Disproving a conjecture of Bleicher and Erd\H{o}s, we show that there exists a lacunary sequence of positive integers such that finite sums of reciprocals of its terms attain all rational numbers from a non-empty open interval. We also…

Cotangent sums play a significant role in the Nyman-Beurling criterion for the Riemann Hypothesis. Here we investigate the maximum of the values of these cotangent sums over various sets of rational numbers in short intervals.

Let $n$ and $r$ be two integers such that $0 < r \le n$; we denote by $\gamma(n,r)$ [$\eta(n,r)$] the minimum [maximum] number of the non-negative partial sums of a sum $\sum_{1=1}^n a_i \ge 0$, where $a_1, \cdots, a_n$ are $n$ real numbers…

We study a generalization of the Random Energy Model to the case when the number of exponential factors varies at random. Also a relation between REM and the Erd"os-R'enyi limit theorem for maximums of partial sums is considered.

The weighted binomial sum $f_m(r)=2^{-r}\sum_{i=0}^r\binom{m}{i}$ arises in coding theory and information theory. We prove that,for $m\not \in\{0,3,6,9,12\}$, the maximum value of $f_m(r)$ with $0\leqslant r\leqslant m$ occurs when…

We generalise the Erdos-Renyi limit theorem on the maximum of the partial sums of random variables to the case when the number of terms in these sums is randomly distributed. Certain relations between the limiting theorems of this type and…

For a set of positive integers $A \subseteq [n]$, an $r$-coloring of $A$ is rainbow sum-free if it contains no rainbow Schur triple. In this paper we initiate the study of the rainbow Erd\H{o}s-Rothchild problem in the context of sum-free…

The Erd\H{o}s-Ginzburg-Ziv theorem states that every sequence of 2n - 1 integers contains a subsequence of length n whose sum is divisible by n. Choi, Kang, and Lim gave a simple deterministic O(n log n) algorithm for finding such a…

The maximum segment sum problem is to compute, given a list of integers, the largest of the sums of the contiguous segments of that list. This problem specification maps directly onto a cubic-time algorithm; however, there is a very elegant…

The maximal degree over rational numbers that an n-dimensinonal Kloosterman sum defined over a finite field of characteristic p can achieve is known to be (p-1)/d where d=gcd(p-1,n+1). Wan has shown that this maximal degree is always…

We determine, within 1, the value of N for which sum (s1 choose i)(s2 choose N)(s1 choose N-i)(N choose i) achieves its maximum value. Here s1 and s2 are fixed integers. This problem arises in studying the most likely value for the size of…

Extending a result from the paper of D. Khavinson and G. Swiatek, we show that the rational harmonic function $\bar{r(z)} - z$, where r(z) is a rational function of degree n > 1, has no more than 5n - 5 complex zeros. Applications to…

In this note, we use integral binary cubic forms to study the rational cube sum problem. We prove (unconditionally) that for any positive integer $d$, infinitely many primes in each of the residue classes $ 1 \pmod {9d}$ as well as $ -1…

In the present paper and as an application of Roth's theorem concerning the rational approximation of algebraic numbers, we give a sufficient condition that will assure us that a series of positive rational terms is a transcendental number.…

Erd\H{o}s-Ginzburg-Ziv theorem is a famous theorem in additive number theory, which states any sequence of $2n-1$ integers contains a subsequence of $n$ elements, with their sum being a multiple of $n$. In this article, we provide an…

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…

The greatest lower bound of the real parts of the roots of a partial sum of the Dirichlet series of Riemann's zeta function is asymptotically equivalent to the opposite of the number of terms of this sum, multiplied by the Napierian…

The Erd\H{o}s-Ginzburg-Ziv theorem states that for any sequence of $2n-1$ integers, there exists a subsequence of $n$ elements whose sum is divisible by $n$. In this article, we provide a simple, practical $O(n\log\log n)$ algorithm and a…