Solving Two Diophantine Equations Of The Vertex Sets Of Deltahedra

ASIAIR > College of Computer Science > Department of Computer Science and Information Engineering > Theses & dissertations > Item 310904400/12749

Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/12749

Title:	Solving Two Diophantine Equations Of The Vertex Sets Of Deltahedra
Authors:	Wong, Hao-Hsuan
Contributors:	Department of Computer Science and Information Engineering Lu, Keh-Ming;Chen, Hsing-Chung
Keywords:	deltahedra;diophantine equations;divide and conquer method;vertex sets
Date:	2012
Issue Date:	2012-11-18 09:00:59 (UTC+0)
Publisher:	Asia University
Abstract:	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.
Appears in Collections:	[Department of Computer Science and Information Engineering] Theses & dissertations

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	323	View/Open