Related papers: On sums of three squares

We prove that the greatest positive integer that is not expressible as a linear combination with integer coefficients of elements of the set $\{n^2,(n+1)^2,\ldots \}$ is asymptotically $O(n^2)$, verifying thus a conjecture of Dutch and…

We show that there are short intervals $[x,x+y]$ containing $\gg y^{1/10}$ numbers expressible as the sum of two squares, which is many more than the average when $y=o( (\log{x})^{5/9})$. We obtain similar results for sums of two squares in…

Let $m\ge3$ be an integer. The polygonal numbers of order $m+2$ are given by $p_{m+2}(n)=m\binom n2+n$ $(n=0,1,2,\ldots)$. A famous claim of Fermat proved by Cauchy asserts that each nonnegative integer is the sum of $m+2$ polygonal numbers…

Every integer greater than two can be expressed as the sum of a prime and a square-free number. Expanding on recent work, we provide explicit and asymptotic results when divisibility conditions are imposed on the square-free number. For…

We describe a method for bounding the set of exceptional integers not represented by a given additive form in terms of the exceptional set corresponding to a subform. Illustrating our ideas with examples stemming from Waring's problem for…

Let P be a finite set of at least two prime numbers, and A the set of positive integers that are products of powers of primes from P. Let F(k) denote the smallest positive integer which cannot be presented as sum of less than k terms of A.…

In this paper, we prove a conjecture of Chan and Chua for the number of representations of integers as sums of 8s integral squares. The proof uses a theorem of Imamo\={g}lu and Kohnen, and the double shuffle relations satisfied by the…

Let $n$ be a nonzero integer. A set of $m$ positive integers is called a $D(n)$-$m$-tuple if the product of any two of its distinct elements increased by $n$ is a perfect square. Let $k$ be a positive integer. By elementary means, we show…

We give a bijective parameter representation for a sum of squares of numbers being equal to another sum of squares of numbers.

A convex form of degree larger than one is always nonnegative since it vanishes together with its gradient at the origin. In 2007, Parrilo asked if convex forms are always sums of squares. A few years later, Blekherman answered the question…

Let $k$ be a positive integer and $S_{2k}={\tt x}+{\tt x}^4+...+{\tt x}^{4^{2k-1}}\in\Bbb F_2[{\tt x}]$. It was recently conjectured that ${\tt x}+S_{2k}^{4^{2k}}+S_{2k}^{4^k+3}$ is a permutation polynomial of $\Bbb F_{4^{3k}}$. In this…

We prove that every integer greater than two may be written as the sum of a prime and a square-free number.

Hardy and Littlewood conjectured that every sufficiently large integer is either a square or the sum of a prime and a square. Let $E(x)$ be the number of positive integers up to $x\ge4$ which does not satisfy this condition. We prove…

Let $\Bbb Z$ and $\Bbb N$ be the set of integers and the set of positive integers, respectively. For $a,b,c,d,n\in\Bbb N$ let $t(a,b,c,d;n)$ be the number of representations of $n$ by $ax(x-1)/2+by(y-1)/2+cz(z-1)/2 +dw(w-1)/2$…

Let $k$ and $n$ be positive integers, $n>k$. Define $r(n,k)$ to be the minimum positive value of $$ |\sqrt{a_1} + ... + \sqrt{a_k} - \sqrt{b_1} - >... -\sqrt{b_k} | $$ where $ a_1, a_2, ..., a_k, b_1, b_2, ..., b_k $ are positive integers…

In the paper we can prove that every integer can be written as the sum of two integers, one perfect square and one squarefree. We also establish the asympotic formula for the number of representations of an integer in this form. The result…

Let $\bar{S}$ denote the set of integers $n$ such that $n!$ cannot be written as a sum of three squares. Let $\bar{S}(n)$ denote $\bar{S} \cap [1, n]$. We establish an exact formula for $\bar{S}(2^k)$ and show that $\bar{S}(n) = 1/8*n +…

We represent the sums $\sum_{k=0}^{n-1}{n \choose k}^{-2}$, $\sum_{k=0}^m{m\choose k}^{-1}{a\choose n-k}^{-1}$, $\sum_{k=0}^{n-1}\frac{q^{-k(k-1)}}{{\genfrac{[}{]}{0pt}{}{n}{k}}_q}$, and the sum of the reciprocals of the summands in Dixon's…

Recently the author used certain quaternion orders to demonstrate the universality of some quaternary quadratic forms. Here a further study is done on one of these orders analogous to Hurwitz's proof of the formula for the number of…

Suppose that $p$ is an odd prime and $m$ is an integer not divisible by $p$. Sun and Tauraso [Adv. in Appl. Math., 45(2010), 125--148] gave $\sum_{k=0}^{n-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=0}^{n-1}\binom{2k}{k+d}/(km^k)$ modulo $p$ for…