Related papers: On Waring's problem: two squares, two cubes and tw…

Let $a_k(n)$ denotes the number of representations of a non-negative integer $n$ as sum of $k$ quadratic forms of the type $x^2+xy+y^2$ and $a_{\lambda_1,\lambda_2,\lambda_3\dots\lambda_k}(n)$ denotes the number of representations $n$ as a…

It is classically known that the circle method produces an asymptotic for the number of representations of a tuple of integers $(n_1,\ldots,n_R)$ by a system of quadratic forms $Q_1,\ldots, Q_R$ in $k$ variables, as long as $k$ is…

We improve a previous unconditional result about the asymptotic behavior of $\sum_{n\le x} r(n)r(n+m)$ with $r(n)$ the number of representations of $n$ as a sum of two squares when $m$ may vary with $x$.

In this note, we try to understand the recent development on the Waring-Goldbach problem involving cubes of primes. Especially, we want to determine whether integers that are either primes, squares of primes, cubes of primes, or a cube of…

In the paper we can prove that every integer can be written as the sum of two integers, one perfect square and one squarefree. We also establish the asympotic formula for the number of representations of an integer in this form. The result…

We find an asymptotic formula for the number of pairs of positive integers $x_1, x_2 \le H$ such that the product $x_1 x_2$ is a $k$-th power.

Using the circle method, we show that for a fixed positive definite integral quadratic form $A$, the expected asymptotic formula for the number of representations of a positive definite integral quadratic form $B$ by $A$ holds true,…

In this paper, we study a density version of Waring's problem. We prove that a positive density subset of $k$th-powers forms an asymptotic additive basis of order $O(k^2)$ provided that the relative lower density of the set is greater than…

In this note I give simple proofs of classical results of Euler, Legendre and Sylvester showing that for certain integers M there are no (or only a few) solutions of $x^3 + y^3 = M$, with $x$ and $y$ in $\mathbb{Q}$. The proofs all use a…

We establish two new Waring--Goldbach type representations: every sufficiently large odd integer $n$ can be expressed as \[ n = p_1^2 + p_2^2 + p_3^3 + p_4^3 + p_5^5 + p_6^6 + p_7^c, \] where each $p_i$ is prime and $c \in \{6,7\}$.

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…

The classical Waring problem deals with expressing every natural number as a sum of g(k) kth powers. Similar problems for finite simple groups have been studied recently, and in this paper we study them for finite quasisimple groups G. We…

We investigate a version of Waring's Problem over quaternion rings, focusing on cubes in quaternion rings with integer coefficients. We determine the global upper and lower bounds for the number of cubes necessary to represent all such…

We investigate the number $R_3(n)$ of representations of $n$ as the sum plus the product of three positive integers. On average, $R_3(n)$ is $\frac{1}{2}\log^2 n$. We give an upper bound for $R_3(n)$ and an upper bound for the number of $n…

In this paper we extend and improve all the previous results known in literature about weighted average, with Ces\`aro weight, of representations of an integer as sum of a positive arbitrary number of prime powers and a non-negative…

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$…

Which integers can be written as a quotient of sums of distinct powers of three? We outline our first steps toward an answer to this question, beginning with a necessary and almost sufficient condition. Then we discuss an algorithm that…

In this paper, we prove that every pair of sufficiently large odd integers can be represented in the form of a pair of one prime, four prime cubes and $48$ powers of $2$.

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that for every sufficiently large even integer $N$, the equation \begin{equation*}…

We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{3}+p_{2}^{3}+p_{3}^{3}+p_{4}^{3}$, where $p_1,p_2,p_3,p_4$ are prime numbers, holds in intervals shorter than the the ones…