prikaz prve stranice dokumenta Brzi algoritmi za traženje prostih brojeva
  Download
PDF 758.37 KB
master's thesis
Brzi algoritmi za traženje prostih brojeva
Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2017. urn:nbn:hr:200:931924
Kovač, Dubravka
Josip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Department of Core Courses
Chair of Mathematics, Physics and Mechanical Engineering

Cite this document

Kovač, D. (2017). Brzi algoritmi za traženje prostih brojeva (Master's thesis). Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek. Retrieved from https://urn.nsk.hr/urn:nbn:hr:200:931924

Kovač, Dubravka. "Brzi algoritmi za traženje prostih brojeva." Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2017. https://urn.nsk.hr/urn:nbn:hr:200:931924

Kovač, Dubravka. "Brzi algoritmi za traženje prostih brojeva." Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2017. https://urn.nsk.hr/urn:nbn:hr:200:931924

Kovač, D. (2017). 'Brzi algoritmi za traženje prostih brojeva', Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 21 March 2025, https://urn.nsk.hr/urn:nbn:hr:200:931924

Kovač D. Brzi algoritmi za traženje prostih brojeva [Master's thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2017 [cited 2025 March 21] Available at: https://urn.nsk.hr/urn:nbn:hr:200:931924

D. Kovač, "Brzi algoritmi za traženje prostih brojeva", Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2017. Available at: https://urn.nsk.hr/urn:nbn:hr:200:931924

Please login to the repository to save this object to your list.
Metadata
TitleBrzi algoritmi za traženje prostih brojeva
Title (english)Fast algorithm for finding prime numbers
AuthorDubravka Kovač
MentorTomislav Rudec (mentor)
MentorAlfonzo Baumgartner (mentor)
Committee memberTomislav Rudec (predsjednik povjerenstva)
Committee memberMarinko Barukčić (član povjerenstva)
Committee memberAlfonzo Baumgartner (član povjerenstva)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
(Department of Core Courses)
(Chair of Mathematics, Physics and Mechanical Engineering)
Osijek
Defense date and country2017-10-02, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Process Computing
Abstract
U ovom radu su opisani i analizirani brzi algoritmi za pronalazak prostih brojeva. Definirani su prosti brojevi i objašnjena njihova matematička svojstva. Rad opisuje osnovni algoritam pronalaska prostih brojeva zasnovan na osnovnim pravilima djeljivosti. Nadalje, navedene su četiri njegove nadogradnje koje uvode dodatna pravila i mehanizme u implementaciji, čime se ubrzava rad osnovnog algoritma. Također su opisana i tri sita: Eratostenovo, Sundramovo i Atkinovo te nadogradnje za Eratostenovo... More i Atkinovo sito. Svi algoritmi su implementirani u C++ programskom jeziku te su analizirane njihove performanse. Analiza je pokazala da je optimirano Atkinovo sito najbrže. Less
Abstract (english)
This thesis describes and analyses fast algorithms for prime number detection. Prime numbers are defined and their mathematical properties described. Basic algorithm based on fundamental division principle is described. Furthermore, four augmentations are also described, they introduce additional rules and mechanisms which results in increased performance. Three sieves, Eratosten´s, Sundram´s, Atkin´s are also described as well as enhancements to Eratosten´s and Atkin´s sieves. All algorithms... More were implemented in C++ programming language and their performance analyzed. Enhanced Atkin´s sieve has shown to be the fastest. Less
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:200:931924
Study programmeTitle: Graduate University Study Programme in Computer Engineering
Study programme type: university
Study level: graduate
Academic / professional title: magistar/magistra inženjer/inženjerka računarstva (magistar/magistra inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
RepositoryFaculty of Electrical Engineering, Computer Science and Information Technology Osijek
Created on2017-11-13 15:01:56
accessibility

closeAccessibilityrefresh

If you wish to permanently save changes, click on Save, if not - your settings will be reset when you restart the browser.