Decomposing 40 billion integers by four tetrahedral numbers
HTML articles powered by AMS MathViewer
- by Chung-Chiang Chou and Yuefan Deng PDF
- Math. Comp. 66 (1997), 893-901 Request permission
Abstract:
Based upon a computer search performed on a massively parallel supercomputer, we found that any integer $n$ less than $40$ billion ($40$B) but greater than $343,867$ can be written as a sum of four or fewer tetrahedral numbers. This result has established a new upper bound for a conjecture compared to an older one, $1$B, obtained a year earlier. It also gives more accurate asymptotic forms for partitioning. All this improvement is a direct result of algorithmic advances in efficient memory and cpu utilizations. The heuristic complexity of the new algorithm is $O(n)$ compared with that of the old, $O(n^{5/3}\log n)$.References
- Yue-Fan Deng and Chen Ning Yang, Waring’s problem for pyramidal numbers, Sci. China Ser. A 37 (1994), no. 3, 277–283. MR 1275806
- Herbert E. Salzer and Norman Levine, Table of integers not exceeding $10\,00000$ that are not expressible as the sum of four tetrahedral numbers, Math. Tables Aids Comput. 12 (1958), 141–144. MR 99756, DOI 10.1090/S0025-5718-1958-0099756-3
- Christopher Hooley, On the representations of a number as the sum of two cubes, Math. Z. 82 (1963), 259–266. MR 155808, DOI 10.1007/BF01111429
Additional Information
- Chung-Chiang Chou
- Affiliation: Department of Mathematics, National ChangHua University of Education, ChangHua 50058, Taiwan
- Yuefan Deng
- Affiliation: Center for Scientific Computing, State University of New York at Stony Brook, Stony Brook, New York 11794
- Received by editor(s): February 20, 1995
- Received by editor(s) in revised form: May 22, 1995, and March 27, 1996
- © Copyright 1997 American Mathematical Society
- Journal: Math. Comp. 66 (1997), 893-901
- MSC (1991): Primary 11P05, 65Y05, 68Q25
- DOI: https://doi.org/10.1090/S0025-5718-97-00818-1
- MathSciNet review: 1397442