论文标题
partitio numerorum：质量和许多$ k $ - th powers的总和
Partitio Numerorum: sums of a prime and a number of $k$-th powers
论文作者
论文摘要
令$ k $为天然数字，让$ c = 2.134693 \ ldots $是等式$ 2C = 2+\ log（5c-1）$的独特真实解决方案，in $ [1，\ infty）$。然后，当$ s \ ge ck+4 $时，我们建立了一个预期的渐近下限，用于预期的数量级，用于大型正整数的表示数，作为一个prime和$ s $ s $ sugport $ k $ k $ th powers的总和。
Let $k$ be a natural number and let $c=2.134693\ldots$ be the unique real solution of the equation $2c=2+\log (5c-1)$ in $[1,\infty)$. Then, when $s\ge ck+4$, we establish an asymptotic lower bound of the expected order of magnitude for the number of representations of a large positive integer as the sum of one prime and $s$ positive integral $k$-th powers.
