Related papers: To answer a question of Professor Georges Rhin

For a set $A\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_A(n)$ denote the number of ordered pairs $(a,a')\in A\times A$ such that $a+a'=n$. The celebrated Erd\H{o}s-Tur\'an conjecture says that, if $R_A(n)\ge 1$ for all sufficiently…

Let $A$ be a nonempty finite set of $k$ integers. Given a subset $B$ of $A$, the sum of all elements of $B$, denoted by $s(B)$, is called the subset sum of $B$. For a nonnegative integer $\alpha$ ($\leq k$), let \[\Sigma_{\alpha}…

Let $r$ and $k$ be positive integers with $r \mid k$. Denote by $S_{\mathrm{\mathfrak{z}}}(k;r)$ the minimum integer $n$ such that every coloring $\chi:[1,n] \rightarrow \{0,1,\dots,r-1\}$ admits a solution to $\sum_{i=1}^{k-1} x_i = x_k$…

The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…

Let $\mathcal{S}$ be a commutative semigroup, and let $T$ be a sequence of terms from the semigroup $\mathcal{S}$. We call $T$ an (additively) {\sl irreducible} sequence provided that no sum of its some terms vanishes. Given any element $a$…

We study the Frobenius problem: given relatively prime positive integers a_1,...,a_d, find the largest value of t (the Frobenius number g(a_1,...,a_d)) such that m_1 a_1 + ... m_d a_d = t has no solution in nonnegative integers m_1,...,m_d.…

In this paper, we investigate the size of moments of quadratic character sums averaged over the family of fundamental discriminants. We obtain an asymptotic formula for all integer moments in a restricted range of parameters using a…

It was asked by E. Szemer\'edi if, for a finite set $A\subset\mathbb{Z}$, one can improve estimates for $\max\{|A+A|,|A\cdot A|\}$, under the constraint that all integers involved have a bounded number of prime factors -- that is, each…

For a finite abelian group $G$ and a positive integer $d$, let $\mathsf s_{d \mathbb N} (G)$ denote the smallest integer $\ell \in \mathbb N_0$ such that every sequence $S$ over $G$ of length $|S| \ge \ell$ has a nonempty zero-sum…

We show the existence of a constant $c > 0$ such that, for all positive integers $n$, there exist integers $1 \leq a_1 < \ldots < a_k \leq n$ such that there are at least $cn^2$ distinct integers of the form $\sum_{i=u}^{v}a_i$ with $1 \leq…

Given a compact subset $\Sigma$ of the real numbers obeying some technical conditions, we consider the set of algebraic integers whose conjugates all lie in $\Sigma$. The distribution of conjugates of such an integer defines a probability…

For a set $A$ of $k$ elements from an additive abelian group $G$ and a positive integer $r \leq k$, we consider the set of elements of $G$ that can be written as a sum of $h$ elements of $A$ with at least $r$ distinct elements. We denote…

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.…

For a set $A\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_A(n)$ denote the number of ordered pairs $(a,a')\in A\times A$ such that $a+a'=n$. The celebrated Erd\H{o}s-Tur\'{a}n conjecture says that, if $R_A(n)\ge 1$ for all…

For each $n$, let $\text{RD}(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In 1945, Segre called for a better understanding of the large…

Recently, we have established the generalized Li criterion equivalent to the Riemann hypothesis, viz. demonstrated that the sums over all non-trivial Riemann function zeroes k_n,a=Sum_(/rho)(1-(1-((/rho-a)/(/rho+a-1))^n) for any real a not…

A zero-sum sequence over ${\mathbb Z}$ is a sequence with terms in ${\mathbb Z}$ that sum to $0$. It is called minimal if it does not contain a proper zero-sum subsequence. Consider a minimal zero-sum sequence over ${\mathbb Z}$ with…

We consider integer programming problems in standard form $\max \{c^Tx : Ax = b, \, x\geq 0, \, x \in Z^n\}$ where $A \in Z^{m \times n}$, $b \in Z^m$ and $c \in Z^n$. We show that such an integer program can be solved in time $(m…

For any integer $r \geq 1$, the sequence of numbers $\{{c^{(r)}_{k}}\}_{k \geq 0} $ is defined implicitly by [\sum_k\binom{n}{k}^r\binom{n+k}{k}^r = \sum_k\binom{n}{k}\binom{n+k}{k}c^{(r)}_k,\quad n=0,1,2,...] Asmus Schmidt conjectured that…

The problem of expressing a selfadjoint element that is zero on every bounded trace as a finite sum (or a limit of sums) of commutators is investigated in the setting of C*-algebras of finite nuclear dimension. Upper bounds -- in terms of…