Related papers: Factorials and Legendre's three-square theorem

We show the 3 by 3 magic square of squares problem equivalent to solving quartic polynomials with certain factorization constraints over an abelian extension of the rationals. We analyze a particular case in which said extension is assumed…

We re-examine previous constructions of infinite binary words containing few distinct squares with the goal of finding the "simplest", in a certain sense. We exhibit several new constructions. Rather than using tedious case-based arguments…

We present a constructive proof of Jacobi's identity for the sum of two squares. We present a combinatorial proof of the Jacobi Triple Product and combine with a proof of Hirschhorn to define an algorithm. The input is a factorization…

Let $\tau_3(n)$ be the triple divisor function which is the number of solutions of the equation $d_1d_2d_3=n$ in natural numbers. It is shown that $$ \sum_{1\leq n_1,n_2,n_3\leq \sqrt{x}}\tau_3(n_1^2+n_2^2+n_3^2)=c_1x^{\frac{3}{2}}(\log…

Motivated by two Legendre-type formulas for overpartitions, we derive a variety of their companions as Legendre theorems for overpartition pairs. This leads to equalities of subclasses of overpartitions and overpartition pairs.

Lagrange's four-square theorem asserts that any $n\in\mathbb N=\{0,1,2,\ldots\}$ can be written as the sum of four squares. This can be further refined in various ways. We show that any $n\in\mathbb N$ can be written as $x^2+y^2+z^2+w^2$…

We examine what integers are representable as sums of three cubes. We also provide formulas for the number of representations of $x^3+y^3+z^3=n$ under the condition $x+y+z=t$. Also we show how the problem of three cubes is related to…

Let $x_1,...,x_n$ be a list of real numbers, let $s :=\sum_{i=1}^{n}x_i$ and let $h:\mathbb{N} \rightarrow \mathbb{R}$ be a function. We gave a necessary and sufficient condition for $s>h(n)$ (respectively, $s<h(n)$). Let $G=(V,E)$ be a…

For non-negative integers $a,b,$ and $n$, let $N(a, b; n)$ be the number of representations of $n$ as a sum of squares with coefficients $1$ or $3$ ($a$ of ones and $b$ of threes). Let $N^*(a,b; n)$ be the number of representations of $n$…

We construct families of explicit polynomials f with rational coefficients that are sums of squares of polynomials over the real numbers, but not over the rational numbers. Whether or not such examples exist was an open question originally…

In the paper, we first prove a sufficient condition for the Riemann hypothesis which involves the order of magnitude of the partial sum of the Liouville function. Then we show a formula which is curiously related to the proved sufficient…

We consider the sum of squares function in the ring $\mathbb{Z}_{n}$. We determine formulae in a number of cases when $n$ is a power of a prime.

Legendre's Conjecture is one of the most elegant open problems in Number Theory, which states that there is a prime between consecutive two perfect squares. In this note, we prove the conjecture holds true and also discuss the related…

We connect the existence of a ternary classical universal quadratic form over a totally real number field $K$ with the property that all totally positive multiples of 2 are sums of squares (if $K$ does not contain $\sqrt 2$ or contains a…

We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and…

The product of any number of Legendre functions, under a restricted domain, can be expanded by the corresponding Legendre polynomials, with the coefficient being the sinc function. While an analogous expansion can be made for any number of…

This paper presents necessary and sufficient conditions for a positive bounded operator on a separable Hilbert space to be the sum of a finite or infinite collection of projections (not necessarily mutually orthogonal), with the sum…

Can any element in a sufficiently large finite field be represented as a sum of two $d$th powers in the field? In this article, we recount some of the history of this problem, touching on cyclotomy, Fermat's last theorem, and diagonal…

As is well-known, a generalization of the classical concept of the factorial $n!$ for a real number $x\in {\mathbb R}$ is the value of Euler's gamma function $\Gamma(1+x)$. In this connection, the notion of a binomial coefficient naturally…

The aim of this paper is to establish various factorization results and then to derive estimates for linear functionals through the use of a generalized Taylor theorem. Additionally, several error bounds are established including…