Related papers: Continuants and some decompositions into squares

This work is devoted to the proof of the statement about the existence of palindromic continued fractions in an arbitrary dimension. In addition, it is proved the criterion that an algebraic continued fraction has proper cyclic palindromic…

A natural number N is said to be palindromic if its binary representation reads the same forwards and backwards. In this paper we study the quotients of two palindromic numbers and answer some basic questions about the resulting sets of…

A method of constructing specific polynomial representations $f(x)$ over the finite field $\mathbb{F}_p$ of the square roots function modulo a prime $p = 2^kn + 1$, $n$ odd, is presented. The formulas for the cases $k = 2$, $3$ and $4$ are…

Sylvester doubles sums, introduced first by Sylvester are symmetric expressions of the roots of two polynomials. Sylvester's definition of double sums makes no sense in the presence of multiple roots, since the definition involves…

We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.

Many homogeneous polynomials that arise in the study of sums of squares and Hilbert's 17th problem come from monomial substitutions into the arithmetic-geometric inequality. In 1989, the second author gave a necessary and sufficient…

We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…

A frequently cited theorem says that for n > 0 and prime p, the sum of the first p n-th powers is congruent to -1 modulo p if p-1 divides n, and to 0 otherwise. We survey the main ingredients in several known proofs. Then we give an…

Given an odd prime number p, we describe a continued fraction in the field F(p) of power series in 1/T with coefficients in the finite field F_p, where T is a formal indeterminate. This continued fraction satisfies an algebraic equation of…

In this paper, it is proved that, for any $\gamma_1,\gamma_2,\gamma_3,\gamma_4,\gamma_5\in(\frac{28}{29},1)$, every sufficiently large integer $n$ subject to $n\equiv5\pmod{24}$ can be represented as the sum of five squares of primes, i.e.,…

Update: This work reproduces an earlier result of Peck, which the author was initially unaware of. The method of the proof is essentially the same as the original work of Peck. There are no new results. We show that the sum of squares of…

We propose a method for determining which integers can be written as a sum of two integral squares for quadratic fields $\Q(\sqrt{\pm p})$, where $p$ is a prime.

We show that there are infinitely many primes $p$ such that $p-1$ is divisible by a square $d^2 \geq p^\theta$ for $\theta=1/2+1/2000.$ This improves the work of Matom\"aki (2009) who obtained the result for $\theta=1/2-\varepsilon$ (with…

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…

We develop a theory of $p$-adic continued fractions for a quaternion algebra $B$ over $\mathbb Q$ ramified at a rational prime $p$. Many properties holding in the commutative case can be proven also in this setting. In particular, we focus…

Polignac [1] conjectured that for every even natural number $2k (k\geq1)$, there exist infinitely many consecutive primes $p_n$ and $p_{n+1}$ such that $p_{n+1}-p_n=2k$. A weakened form of this conjecture states that for every $k\geq1$,…

Motivated by the necessities of the invariant theory of binary forms J. J. Sylvester constructed in 1878 for each graph with possible multiple edges but without loops its symmetrized graph monomial which is a polynomial in the vertex labels…

A classical theorem in number theory due to Euler states that a positive integer $z$ can be written as the sum of two squares if and only if all prime factors $q$ of $z$, with $q\equiv 3 \pmod{4}$, have even exponent in the prime…

For a square-free bivariate polynomial $p$ of degree $n$ we introduce a simple and fast numerical algorithm for the construction of $n\times n$ matrices $A$, $B$, and $C$ such that $\det(A+xB+yC)=p(x,y)$. This is the minimal size needed to…

In 1853 Sylvester introduced a family of double sum expressions for two finite sets of indeterminates and showed that some members of the family are essentially the polynomial subresultants of the monic polynomials associated with these…