Related papers: Tomaszewski's problem on randomly signed sums, rev…

In this paper, we develop machinery which makes it much easier to prove sum of squares lower bounds when the problem is symmetric under permutations of $[1,n]$ and the unsatisfiability of our problem comes from integrality arguments, i.e.…

Chebyshev famously observed empirically that more often than not, there are more primes of the form $3 \bmod 4$ up to $x$ than of the form $1 \bmod 4$. This was confirmed theoretically much later by Rubinstein and Sarnak in a logarithmic…

Every natural number greater than $2$ can be written as the sum of a prime and a square-free number, and recent work has imposed additional divisibility conditions on the square-free number. We overcome limitations in these works to prove…

A string $s$ is called a parameterized square when $s = xy$ for strings $x$, $y$ and $x$ and $y$ are parameterized equivalent. Kociumaka et al. showed the number of parameterized squares, which are non-equivalent in parameterized…

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

In this paper, it is established that every sufficiently large positive integer $n$ subject to $n\equiv0\pmod2$ can be represented as a sum of one square of prime and seventeen fifth powers of primes, which gives an enhancement upon the…

We prove that every sufficiently large integer $n$ can be written as the sum of a prime and an integer that is not square-free. In addition, we expect this result holds for every $n > 24$ and prove two results to support this claim. First,…

Let $s_1, s_2, \ldots$ be the sequence of positive integers, arranged in increasing order, that are representable by any binary quadratic form of fixed discriminant $D$. We show that \[ \limsup_{n \rightarrow \infty} \frac{s_{n+1}-s_n}{\log…

We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…

Recently, the authors showed that for every irrational number $\alpha$, there exist infinitely many positive integers $n$ represented by any given positive definite binary quadratic form $Q$, satisfying $||\alpha n||<n^{-(1/2-\varepsilon)}$…

Let $\bX=\{X_n\}_{n\geq 1}$ and $\bY=\{Y_n\}_{n\geq 1}$ be two independent random sequences. We obtain rates of convergence to the normal law of randomly weighted self-normalized sums $$ \psi_n(\bX,\bY)=\sum_{i=1}^nX_iY_i/V_n,\quad…

The average properties of the well-known Subset Sum Problem can be studied by the means of its randomised version, where we are given a target value $z$, random variables $X_1, \ldots, X_n$, and an error parameter $\varepsilon > 0$, and we…

This paper is concerned with the problem of finding $n$ distinct squares such that, on excluding any one of them, the sum of the remaining $n-1$ squares is a square. While parametric solutions are known when $n=3$ and $n=4$, when $n > 4$,…

Given $n$ real numbers $0\leq x_1,...,x_n<1$ and a permutation~$\sigma$ of $\{1,...,n\}$, we can always find $\xbar_1,...,\xbar_n\in\{0,1\}$ so that the partial sums $\xbar_1+... +\xbar_k$ and $\xbar_{\sigma 1}+... +\xbar_{\sigma k}$ differ…

We study the representations of large integers $n$ as sums $p_1^2 + ... + p_s^2$, where $p_1,..., p_s$ are primes with $| p_i - (n/s)^{1/2} | \le n^{\theta/2}$, for some fixed $\theta < 1$. When $s = 5$ we use a sieve method to show that…

Let $S_n^{(2)}$ denote the iterated partial sums. That is, $S_n^{(2)}=S_1+S_2+ ... +S_n$, where $S_i=X_1+X_2+ ... s+X_i$. Assuming $X_1, X_2,....,X_n$ are integrable, zero-mean, i.i.d. random variables, we show that the persistence…

Erdos conjectured that every odd number greater than one can be expressed as the sum of a squarefree number and a power of two. Subsequently, Odlyzko and McCranie provided numerical verification of this conjecture up to $10^7$ and $1.4\cdot…

Let $A=\{a_{1},\ldots,a_{k}\}$ be a nonempty finite subset of an additive abelian group $G$. For a positive integer $h$, the $h$-fold signed sumset of $A$, denoted by $h_{\pm}A$, is defined as $$h_{\pm}A=\left\lbrace \sum_{i=1}^{k}…

Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

In his book "250 Problems in Elementary Number Theory", W.Sierpinski shows that the numbers 1+2^(2^n)+2^(2^n+1) are divisible by 21; for n=1,2,.... In this paper, we prove a similar but more general result.Consider the natural numbers of…