On primality testing
| dc.contributor.advisor | Koltuksuz, Ahmet Hasan | en |
| dc.contributor.author | Tepeli, Murat | |
| dc.date.accessioned | 2023-11-13T09:27:31Z | |
| dc.date.available | 2023-11-13T09:27:31Z | |
| dc.date.issued | 2000 | en |
| 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.identifier.uri | http://standard-demo.gcris.com/handle/123456789/4124 | |
| 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 |
| dspace.entity.type | Publication | |
| gdc.author.institutional | Tepeli, Murat | |
| gdc.description.department | Chemistry | en_US |
| gdc.description.publicationcategory | Tez | en_US |