完整後設資料紀錄
DC 欄位語言
dc.contributor.author段俊旭en_US
dc.contributor.authorTuan, Chun-Hsuen_US
dc.contributor.author張書銘en_US
dc.contributor.authorChang, Shu-Mingen_US
dc.date.accessioned2014-12-12T01:40:30Z-
dc.date.available2014-12-12T01:40:30Z-
dc.date.issued2010en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#GT079722529en_US
dc.identifier.urihttp://hdl.handle.net/11536/45083-
dc.description.abstract本論文主要研究一個有名的數學問題:克拉茲猜想。雖然克拉茲猜想的形式與意義容易被理解,但它仍然尚未被證明。也因為如此,引發了我們對克拉茲猜想的興趣,也希望藉著研究對它有更多的了解。首先,我們會對克拉茲猜想做個簡單的介紹,並且整理一些其他人對克拉茲猜想做的研究。接下來,我們會建構一個特別的圖,也就是逆推網絡,開始我們對克拉茲猜想的研究,同時我們也得到一些逆推網絡的特性。最後,我們嘗試建構一個模擬逆推網絡,去模擬實際的逆推網絡,根據兩者相互比較的數值結果做出分析結論。zh_TW
dc.description.abstract3n+1 problem is one of the most famous conjectures in mathematics. It can be easily understood even younger children who just know how to divide by 2 and multiply by 3. However, the 3n+1 problem still can not be proved yet. Therefore, we are so interestedin this problem and hope to understand it completely. First, our study gives a brief introduction of the 3n + 1 problem, and we list some results in many research of the 3n+1 problem. Then, we use a graph, a backward iteration net, to examine the 3n+1 problem and obtain some properties in the backward iteration net. Finally, we simulate the backward iteration net and compare the numerical results with the net.en_US
dc.language.isoen_USen_US
dc.subject克拉茲猜想zh_TW
dc.subject逆推網絡zh_TW
dc.subject模擬逆推網絡zh_TW
dc.subject3n+1 problemen_US
dc.subjectbackward iteration neten_US
dc.subjectsimulation backward iteration neten_US
dc.title應用逆推網絡在克拉茲猜想的探討zh_TW
dc.titleStudy 3n+1 Problem in a Backward Iteration Neten_US
dc.typeThesisen_US
dc.contributor.department應用數學系所zh_TW
顯示於類別:畢業論文


文件中的檔案:

  1. 252901.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。