On primality testing

Tepeli, Murat

Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/3686

Full metadata record

DC Field	Value	Language
dc.contributor.advisor	Koltuksuz, Ahmet Hasan	en
dc.contributor.author	Tepeli, Murat	-
dc.date.accessioned	2014-07-22T13:52:09Z	-
dc.date.available	2014-07-22T13:52:09Z	-
dc.date.issued	2000	en
dc.identifier.uri	http://hdl.handle.net/11147/3686	-
dc.description	Thesis (Master)--Izmir Institute of Technology, Computer Engineering, Izmir, 2000	en
dc.description	Includes bibliographical references (leaves: 37)	en
dc.description	Text in English; Abstract: Turkish and English	en
dc.description	x, 55leaves	en
dc.description.abstract	In this study, prime numbers and primality, which IS one of the most important topics in number theory is analyzed.Subject of primality of a number has been the focus of many scientific studies and several different theories has been developed for many years. Based on these theorems, primality of large numbers has been investigated. There are also computer based algorithms to test large numbers.In this work, five different testing methods have been studied and computer programs have been developed. Best method was determined by comparing the test results from different methods.	en
dc.language.iso	en	en_US
dc.publisher	Izmir Institute of Technology	en
dc.rights	info:eu-repo/semantics/openAccess	en_US
dc.subject.lcc	QA246 .T47 2000	en
dc.subject.lcsh	Numbers, Prime	en
dc.subject.lcsh	Number theory--Data processing	en
dc.title	On primality testing	en_US
dc.type	Master Thesis	en_US
dc.institutionauthor	Tepeli, Murat	-
dc.department	Thesis (Master)--İzmir Institute of Technology, Computer Engineering	en_US
dc.relation.publicationcategory	Tez	en_US
item.fulltext	With Fulltext	-
item.grantfulltext	open	-
item.languageiso639-1	en	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.cerifentitytype	Publications	-
item.openairetype	Master Thesis	-
Appears in Collections:	Master Degree / Yüksek Lisans Tezleri