Solving Two Diophantine Equations Of The Vertex Sets Of Deltahedra

ASIA unversity > 資訊學院 > 資訊工程學系 > 博碩士論文 > Item 310904400/12749

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/12749

题名:	Solving Two Diophantine Equations Of The Vertex Sets Of Deltahedra
作者:	Wong, Hao-Hsuan
贡献者:	Department of Computer Science and Information Engineering Lu, Keh-Ming;Chen, Hsing-Chung
关键词:	deltahedra;diophantine equations;divide and conquer method;vertex sets
日期:	2012
上传时间:	2012-11-18 09:00:59 (UTC+0)
出版者:	Asia University
摘要:	We use Divide and Conquer (D&C) method to solve two Diophantine equations and show how to obtain all vertex sets of deltahedra. Having solved the problem by manually employed this method, we validated all of the solutions for n=4,6,…,22, with the results of the computer programming of the same algorithm. We then verify the integrity of the solutions by backtracking and nested loop search methods. The iterations of the two search methods obviously are multiply times of the same as the D&C method for n=4,6,…,100. Finally, we employed the D&C method to solve the problem and found the ratios of consecutive solutions for n=4,6,…,300 asymptotically approach to unity.
显示于类别:	[資訊工程學系] 博碩士論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	321	检视/开启

在ASIAIR中所有的数据项都受到原著作权保护.