Related papers: On the number of representations of n as a linear …

In this paper we generalize the idea of "essentially unique" representations by ternary quadratic forms. We employ the Siegel formula, along with the complete classification of imaginary quadratic fields of class number less than or equal…

Let $\mathbb{N}$ be the set of all nonnegative integers. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_S(n)$ denote the number of solutions of the equation $n=s_1+s_2$, $s_1,s_2\in S$ and $s_1<s_2$. Let $A$ be the set of all…

The aim of the present article is to explore the possibilities of representing positive integers as sums of other positive integers and highlight certain fundamental connections between their multiplicative and additive properties. In…

Lagrange's four squares theorem is a classical theorem in number theory. Recently, Z.-W. Sun found that it can be further refined in various ways. In this paper we study some conjectures of Sun and obtain various refinements of Lagrange's…

Integer iteration rules such as n |-> {a n + b, c n +d} are studied as minimal examples of the general process of multicomputation. Despite the simplicity of such rules, their multiway graphs can be complex, exhibiting, for example,…

In 1957 N.C. Ankeny provided a new proof of the three squares theorem using geometry of numbers. This paper generalizes Ankeny's technique, proving exactly which integers are represented by $x^2 + 2y^2 + 2z^2$ and $x^2 + y^2 + 2z^2$ as well…

Let $\mathbb{Z}_n$ be the ring of residue classes modulo $n$, and let $\mathbb{Z}_n^{\ast}$ be the group of its units. 90 years ago, Brauer obtained a formula for the number of representations of $c\in \mathbb{Z}_n$ as the sum of $k$ units.…

In the present paper we prove that every sufficiently large odd integer $N$ can be represented in the form \begin{equation*} N=p_1+p_2+p_3\,, \end{equation*} where $p_1,p_2,p_3$ are primes, such that $p_1=x^2 + y^2 +1$, $p_2=[n^c]$.

In this paper we present a new proof of the following 2010 result of Dubickas, Novikas, and Siurys: Let $(a,b)\in \mathbb{Z}^2$ and let $(x_n)_{n\ge 0}$ be the sequence defined by some initial values $x_0$ and $x_1$ and the second order…

Let $m\neq n$. An $m\times n\times p$ {\it proper array} is a three-dimensional rectangular array composed of directed cubes that obeys certain constraints. Because of these constraints, the $m\times n\times p$ proper arrays may be…

In this note, we give an elementary proof of the following classical fact. Any positive definite ternary quadratic form over the rational numbers fails to represent infinitely many positive integers. For any ternary quadratic form (positive…

Recently, Jha (arXiv:2007.04243, arXiv:2011.11038) has found identities that connect certain sums over the divisors of $n$ to the number of representations of $n$ as a sum of squares and triangular numbers. In this note, we state a…

Computational approaches to finding non-trivial integer solutions of the equation in the title are discussed. We summarize previous work and provide several new solutions.

By an $abc$ triple, we mean a triple $(a,b,c)$ of relatively prime positive integers $a,b,$ and $c$ such that $a+b=c$ and $\operatorname{rad}(abc)<c$, where $\operatorname{rad}(n)$ denotes the product of the distinct prime factors of $n$.…

We study whether sufficiently large integers can be written in the form cp+T_x, where p is either zero or a prime congruent to r mod d, and T_x=x(x+1)/2 is a triangular number. We also investigate whether there are infinitely many positive…

We evaluate the convolution sum $\displaystyle W_{a,b}(n):= \sum_{al+bm=n} \hspace{-3mm} \sigma(l) \sigma(m)$ for $(a,b)=(1,28), (4,7), (2,7)$ for all positive integers $n$. We use a modular form approach. We also re-evaluate the known sums…

We show that there are at most two solutions in positive integers $(x,y,z)$ to the equation $a^x+b^y=c^z$ for positive integers $a$, $b$, and $c$ all greater than one, with just one exceptional case when $\gcd(a,b)=1$, and just one…

We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.

We prove that there are exactly five sequences, including the triangular numbers, that satisfy the product rule $T(mn) = T(m) T(n) + T(m-1) T(n-1)$ for all $m, n \ge 1$.

Let $F$ be a binary form with integer coefficients, non-zero discriminant and degree $d \geq 3$. Let $R_F(Z)$ denote the number of integers of absolute value at most $Z$ which are represented by $F$. In 2019 Stewart and Xiao proved that…