相关论文: On sums of three squares

In an earlier paper [4], we derived asymptotic formulas for the number of representations of zero and of large positive integers by the cubic forms in seven variables which can be written as $L_1(x_1,x_2,x_3) Q_1(x_1,x_2,x_3)+…

In this article, we study the representability of integers as sums of pentagonal numbers, where a pentagonal number is an integer of the form $P_5(x)=\frac{3x^2-x}{2}$ for some non-negative integer $x$. In particular, we prove the…

The problem of representing a given positive integer as a sum of four squares of integers has been widely concerned for a long time, and for a given positive odd $n$ one can find a representation by doing arithmetic in a maximal order of…

We establish the validity of asymptotic limits for the general transportation problem between random i.i.d. points and their common distribution, with respect to the squared Euclidean distance cost, in any dimension larger than three.…

We prove that suitable asymptotic formulae in short intervals hold for the problems of representing an integer as a sum of a prime square and a square, or a prime square. Such results are obtained both assuming the Riemann Hypothesis and in…

We bound the Pythagoras number of a real projective subvariety: the smallest positive integer $r$ such that every sum of squares of linear forms in its homogeneous coordinate ring is a sum of at most $r$ squares. Enhancing existing methods,…

Let Q(N;q,a) denotes the number of squares in the arithmetic progression qn+a, for n=0, 1,...,N-1, and let Q(N) be the maximum of Q(N;q,a) over all non-trivial arithmetic progressions qn + a. Rudin's conjecture asserts that Q(N)=O(Sqrt(N)),…

We prove the strong form of the Gaussian product conjecture in dimension three. Our purely analytical proof simplifies previously known proofs based on combinatorial methods or computer-assisted methods, and allows us to solve the case of…

We conjecture that the asymptotic behavior of the numbers of solid (three-dimensional) partitions is identical to the asymptotics of the three-dimensional MacMahon numbers. Evidence is provided by an exact enumeration of solid partitions of…

We explore some of the properties of consecutive, equally-summed arithmetic progressions of odd numbers, particularly their offsets and sums, before using them to prove that no $3\times3$ magic squares of distinct square integers exist.

Uniformly for small $q$ and $(a,q)=1$, we obtain an estimate for the weighted number of ways a sufficiently large integer can be represented as the sum of a prime congruent to $a$ modulo $q$ and a square-free integer. Our method is based on…

We study sums with multiplicative functions that take values over a non-homogenous Beatty sequence. We then apply our result in a few special cases to obtain asymptotic formulas such as the number of integers in a Beatty sequence…

In this paper, we prove some results of restricted sums of four squares using arithmetic of quaternions in the ring of Lipschitz integers. For example, we show that every nonnegative integer $n$ can be written as $x^{2}+y^{2}+z^{2}+t^{2}$…

In a paper published by this author in www.academia.edu(see reference[3]), it was established that there exist no three positive integers which are consecutive terms of an arithmetic progression; and whose sum of squares is a perfect or…

A representation number is a function which expresses the number of ways an integer can be written as a sum of elements of chosen sets. One of the oldest number-theoretic results on representation numbers is Fermat's theorem which says that…

We prove that every integer $n \geq 10$ such that $n \not\equiv 1 \text{mod} 4$ can be written as the sum of the square of a prime and a square-free number. This makes explicit a theorem of Erd\H{o}s that every sufficiently large integer of…

In previous work of this author it was conjectured that the sum of power sums $p_\lambda,$ for partitions $\lambda$ ranging over an interval $[(1^n), \mu]$ in reverse lexicographic order, is Schur-positive. Here we investigate this…

The general formulas for finding the quantity of all primitive and nonprimitive triples generated by the given number x have been proposed. Also the formulas for finding the complete quantity of the representations of the integers as a…

A short and elementary proof, and a finite-form generalization, are given of Jacobi's formula for the number of ways of writing an integer as a sum of four squares (that implies Lagrange's famous 1777 theorem.)

Let $k\ge 2$ be an integer and let $A$ be a set of nonnegative integers. The representation function $R_{A,k}(n)$ for the set $A$ is the number of representations of a nonnegative integer $n$ as the sum of $k$ terms from $A$. Let $A(n)$…