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

三个立方体问题的一种新解法

A New Method in the Problem of Three Cubes

Armen Avagyan, Gurgen Dallakyan

摘要:

在本文中,我们用最高可能次数的整系数整系数多项式求P1(y)、P2(y)、P3(y),用最低可能次数的多项式求Q(y),使得P1(y)^3+P2(y)^3+P3(y)^3=Q(y)。实际上,这个问题的解与三个立方的和问题a^3+b^3+c^3=d有密切的关系,因为deg Q(y)=0的情形与上述问题相吻合。它已被认为是最小化度Q(y)的可能性的估计。作为结论,对于特定的d值,我们调查了一个新的算法,寻找整数解a^3+b^3+c^3=d。

英文摘要:

In the current paper we are seeking P1(y),P2(y),P3(y) with the highest possible degree polynomials with integer coefficients, and Q(y) via the lowest possible degree polynomial, such that P1(y)^3+P2(y)^3+P3(y)^3=Q(y). Actually, the solution of this problem has close relation with the problem of the sum of three cubes a^3+b^3+c^3=d, since deg Q(y)=0 case coincides with above mentioned problem. It has been considered estimation of possibility of minimization of deg Q(y). As a conclusion, for specific values of d we survey a new algorithm for finding integer solutions of a^3+b^3+c^3=d.

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

↑