arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.00400math.NT
收藏

关于丢番图方程$(x+1)^{k}+(x+2)^{k}+...+(2x)^{k}=y^n$

On the Diophantine equation $(x+1)^{k}+(x+2)^{k}+...+(2x)^{k}=y^n$

Attila Bérczes, István Pink, Gamze SavaŞ, Gökhan Soydan

摘要:

在这项工作中,我们给出了上界的$n$的标题方程。我们的结果依赖于断言描述的精确指数$2$和$3$出现在素分解的$T_{k}(x)=(x+1)^{k}+(x+2)^{k}+...+(2x)^{k}$。进一步,结合Baker方法和多项式指数同余的显式解(例如参见BHMP),我们证明了对于$2 \leq x \leq 13, k \geq 1, y \geq 2$和$n \geq 3$,标题方程无解.

英文摘要:

In this work, we give upper bounds for $n$ on the title equation. Our results depend on assertions describing the precise exponents of $2$ and $3$ appearing in the prime factorization of $T_{k}(x)=(x+1)^{k}+(x+2)^{k}+...+(2x)^{k}$. Further, on combining Baker's method with the explicit solution of polynomial exponential congruences (see e.g. BHMP), we show that for $2 \leq x \leq 13, k \geq 1, y \geq 2$ and $n \geq 3$ the title equation has no solutions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑