We prove in this article that almost all large integers have a representation as the sum of a cube, a biquadrate, ..., and a tenth power.

Bringmann, Lovejoy, and Osburn (2009, 2010) showed that the generating functions of the spt-overpartition functions $\overline{spt}\left(n\right)$, ${\overline{spt}}_1\left(n\right)$, ${\overline{spt}}_2\left(n\right)$, and M2spt(n) are quasimock theta functions, and satisfy a number of simple Ramanujan-like congruences. Andrews, Garvan, and Liang (2012) defined an spt-crank in terms of weighted vector partitions which combinatorially explain simple congruences modulo 5 and 7 for spt(n). Chen, Ji, and Zang (2013) were able to define this spt-crank in terms of ordinary partitions. In this...

We study the sum τ of divisors of the quadratic form m₁² + m₂² + m₃². Let $S₃\left(X\right)={\sum }_{1\le m₁,m₂,m₃\le X}\tau (m₁²+m₂²+m₃²)$. We obtain the asymptotic formula S₃(X) = C₁X³logX + C₂X³ + O(X²log⁷X), where C₁,C₂ are two constants. This improves upon the error term $O_{\epsilon }\left(X^{8/3+\epsilon }\right)$ obtained by Guo and Zhai (2012).

The object of this paper is to present new proofs of the classical ternary theorems of additive prime number theory. Of these the best known is Vinogradov's result on the representation of odd numbers as the sums of three primes; other results will be discussed later. Earlier treatments of these problems used the Hardy-Littlewood circle method, and are highly analytical. In contrast, the method we use here is a (technically) elementary deduction from the Siegel-Walfisz Prime Number Theory. It uses...

For a large odd integer N and a positive integer r, define b = (b₁,b₂,b₃) and $(N,r)=b\in \mathbb{N}³:1\le b_j\le r,(b_j,r)=1andb₁+b₂+b₃\equiv N\left(modr\right).$It is known that    $(N,r)=r²{\prod }_{p|r}p|N((p-1)(p-2)/p²){\prod }_{p|r}p\nmid N((p²-3p+3)/p²)$. Let ε > 0 be arbitrary and $R=N^{1/8-\epsilon }$. We prove that for all positive integers r ≤ R, with at most $O\left(Rlo{g}^{-A}N\right)$ exceptions, the Diophantine equation ⎧N = p₁+p₂+p₃, ⎨ $p_j\equiv b_j\left(modr\right),$ j = 1,2,3,$$⎩ with prime variables is solvable whenever b ∈ (N,r), where A > 0 is arbitrary.