Related papers: On sums of three squares

We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…

Some class of sums which naturally include the sums of powers of integers is considered. A number of conjectures concerning a representation of these sums is made.

We use a function field version of the circle method to prove that a positive proportion of elements in $\mathbb{F}_q[t]$ are representable as a sum of three cubes of minimal degree from $\mathbb{F}_q[t]$, assuming a suitable form of the…

We give an asymptotic for the number of prime solutions to $Q(x_1,\dots, x_8) = N$, subject to a mild non-degeneracy condition on the homogeneous quadratic form $Q$. The argument initially proceeds via the circle method, but this does not…

We establish a lower bound for the frequency with which an irreducible monic cubic polynomial with negative discriminant can be expressed as a sum of two squares ($\square_{2}$). This provides a quantitative answer to a question posed by…

In this paper, we study universal sums of triangular numbers and squares. Specifically, we prove that a sum of triangular numbers and squares is universal if and only if it represents…

We consider the sum-of-digits functions $s_2$ and $s_3$ in bases $2$ and $3$. These functions just return the minimal numbers of powers of two (resp. three) needed in order to represent a nonnegative integer as their sum. A result of the…

We study the number $\nu(n)$ of representations of a positive integer $n$ by the form $x^3+y^3+z^3-3xyz$ in the conditions $0\leq x\leq y\leq z; z\geq x+1.$ We proved the following results: (i) for every positive $n,$ except for…

We investigate the frequency of positive squareful numbers x,y,z for which x+y=z.

The number of solid partitions of a positive integer is an unsolved problem in combinatorial number theory. In this paper, solid partitions are studied numerically by the method of exact enumeration for integers up to 50 and by Monte Carlo…

Let k>2 be a fixed integer exponent and let \theta > 9/10. We show that a positive integer N can be represented as a non-trivial sum or difference of 3 k-th powers, using integers of size at most B, in O(B^{\theta}N^{1/10}) ways, providing…

Let $E(N)$ denote the number of positive integers $n \le N$, with $n \equiv 4 \pmod{24}$, which cannot be represented as the sum of four squares of primes. We establish that $E(N)\ll N^{11/32}$, thus improving on an earlier result of Harman…

We consider the linear vector space formed by the elements of the finite fields $\mathbb{F}_q$ with $q=p^r$ over $\mathbb{F}_p$. Let $\{a_1,\ldots,a_r\}$ be a basis of this space. Then the elements $x$ of $\mathbb{F}_q$ have a unique…

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

We show that when projecting an edge-transitive N-dimensional polytope onto anM-dimensional subspace of R^N, the sums of the squares of the original and projected edges are in the ratio N=M.

We study the sum of divisors of the quadratic form $m_1^2+m_2^2+m_3^2$. Let $$S_3(X)=\sum_{1\le m_1,m_2,m_3\le X}\tau(m_1^2+m_2^2+m_3^2).$$ We obtain the asymptotic formula $$S_3(X)=C_1X^3\log X+ C_2X^3+O(X^2\log^7 X),$$ where $C_1,C_2$ are…

Well-known results of Lagrange and Jacobi prove that the every $m \in \mathbb N$ can be expressed as a sum of four integer squares, and the number $r(m)$ of such representations can be given by an explicit formula in $m$. In this paper, we…

We show that the number of cycles in a random permutation chosen according to generalized Ewens measure is normally distributed and compute asymptotic estimates for the mean and variance.

Euler had considered the problem of finding three integers whose sum, product, and also the sum of the products of the integers, taken two at a time, are all perfect squares. Euler's methods of solving the problem lead to parametric…

We show that every sum of squares in the three-variable Laurent series field $\mathbb{R}((x,y,z))$ is a sum of 4 squares, as was conjectured in a paper of Choi, Dai, Lam and Reznick in the 1980's. We obtain this result by proving that every…