Related papers: Every integer can be written as a square plus a sq…

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…

Let R be the ring of S-integers of an algebraic function field (in one variable) over a perfect field, where S is finite and not empty. It is shown that for every positive integer N there exist elements of R that can not be written as a sum…

We give an asymptotic formula for the mean value of the number of representations of an integer as sum of two squares known as the Gauss circle problem.

It is proved that all sufficiently large integers $n$ can be represented as $$n=x_1^2+x_2^3+\cdots+x_{13}^{14},$$ where $x_1,\ldots,x_{13}$ are positive integers. This improves upon the current record with $14$ variables in place of $13$.

In this paper, we consider representations of integers as sums of generalized heptagonal numbers with a prescribed number of repeats of each heptagonal number appearing in the sum. In particular, we investigate the classification of such…

We examine the representation of numbers as the sum of two squares in $\mathbb{Z}_n$ for a general positive integer $n$. Using this information we make some comments about the density of positive integers which can be represented as the sum…

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…

Assuming the Riemann Hypothesis we obtain asymptotic estimates for the mean value of the number of representations of an integer as a sum of two primes. By proving a corresponding Omega-term, we prove that our result is essentially the best…

Using Fermat's two squares theorem and properties of cyclotomic polynomials, we prove assertions about when numbers of the form $a^{n}+1$ can be expressed as the sum of two integer squares. We prove that $a^n + 1$ is the sum of two 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)+…

The well-known Lagrange's four-square theorem states that any integer $n\in\mathbb{N}=\{0,1,2,...\}$ can be written as the sum of four squares. Recently, Z.-W. Sun investigated the representations of $n$ as $x^2+y^2+z^2+w^2$ with certain…

We prove a conjecture posted in the Online Encyclopedia of Integer Sequences, namely that there are exactly five positive integers that can be written in more than one way as the sum of a nonnegative power of 2 and a nonnegative power of 3.…

The representation of any integer as the sum of two cubes to a fixed modulus is always possible if and only if the modulus is not divisible by seven or nine. For a positive non-prime integer N there is given an inductive way to find its…

Let $F$ be a binary form with integer coefficients, non-zero discriminant and degree $d$ with $d$ at least $3$. Let $R_F(Z)$ denote the number of integers of absolute value at most $Z$ which are represented by $F$. We prove that there is a…

Erdos conjectured that every odd number greater than one can be expressed as the sum of a squarefree number and a power of two. Subsequently, Odlyzko and McCranie provided numerical verification of this conjecture up to $10^7$ and $1.4\cdot…

A new polynomial sieve is presented and used to show that almost all integers have at most one representation as a sum of two values of a given polynomial of degree at least 3.

In the present paper we show that there exist infinitely many consecutive square-free numbers of the form $n^2+1$, $n^2+2$. We also establish an asymptotic formula for the number of such square-free pairs when $n$ does not exceed given…

In this paper, we study partitions of positive integers with restrictions involving squares. We mainly establish the following two results (which were conjectured by Sun in 2013): (i) Each positive integer $n$ can be written as $n=x+y+z$…

In the present paper we show that there exist infinitely many consecutive square-free numbers of the form $x^2+y^2+1$, $x^2+y^2+2$. We also give an asymptotic formula for the number of pairs of positive integers $x, y \leq H$ such that…

The paper presents a discussion on the asymptotic formula for the number of plane partitions of a large positive integer.