We make several improvements to methods for finding integer solutions to [Formula: see text] for small values of k. We implemented these improvements on Charity Engine's global compute grid of 500,000 volunteer PCs and found new representations for several values of k, including 3 and 42. This completes the search begun by Miller and Woollett in 1954 and resolves a challenge posed by Mordell in 1953.
On a question of Mordell.
关于莫德尔的问题
阅读：5
作者：Booker Andrew R, Sutherland Andrew V
| 期刊： | Proceedings of the National Academy of Sciences of the United States of America | 影响因子： | 9.100 |
| 时间： | 2021 | 起止号： | 2021 Mar 16; 118(11):e2022377118 |
| doi： | 10.1073/pnas.2022377118 | ||
特别声明
1、本文转载旨在传播信息，不代表本网站观点，亦不对其内容的真实性承担责任。
2、其他媒体、网站或个人若从本网站转载使用，必须保留本网站注明的“来源”，并自行承担包括版权在内的相关法律责任。
3、如作者不希望本文被转载，或需洽谈转载稿费等事宜，请及时与本网站联系。
4、此外，如需投稿，也可通过邮箱info@biocloudy.com与我们取得联系。