National Changhua University of Education Institutional Repository : Item 987654321/15816
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 6507/11669
造訪人次 : 29716728      線上人數 : 432
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 進階搜尋

請使用永久網址來引用或連結此文件: http://ir.ncue.edu.tw/ir/handle/987654321/15816

題名: Decomposing 40 Billion Integers by Four Tetrahedral Numbers
作者: Chou, Chung-Chiang;Deng, Yuefan
貢獻者: 數學系
關鍵詞: Asymptotic form;Parallel computing;Waring's problem
日期: 1997-04
上傳時間: 2013-03-12T04:07:55Z
出版者: American Mathematical Society
摘要: Based upon a computer search performed on a massively parallel supercomputer, we found that any integer n less than 40 billion (40B) 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, 1B, 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(n5/3 log n).
關聯: Mathematics of Computation, 66(218): 893-901
顯示於類別:[數學系] 期刊論文

文件中的檔案:

檔案 大小格式瀏覽次數
index.html0KbHTML717檢視/開啟


在NCUEIR中所有的資料項目都受到原著作權保護.

 


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋