prikaz prve stranice dokumenta Reducibilnost i ireducibilnost polinoma
Access restricted to students and staff of home institution
undergraduate thesis
Reducibilnost i ireducibilnost polinoma
2016. urn:nbn:hr:211:347235
Kos, Marko
University of Zagreb
Faculty of Organization and Informatics

Cite this document

Kos, M. (2016). Reducibilnost i ireducibilnost polinoma (Undergraduate thesis). Varaždin: University of Zagreb, Faculty of Organization and Informatics. Retrieved from https://urn.nsk.hr/urn:nbn:hr:211:347235

Kos, Marko. "Reducibilnost i ireducibilnost polinoma." Undergraduate thesis, University of Zagreb, Faculty of Organization and Informatics, 2016. https://urn.nsk.hr/urn:nbn:hr:211:347235

Kos, Marko. "Reducibilnost i ireducibilnost polinoma." Undergraduate thesis, University of Zagreb, Faculty of Organization and Informatics, 2016. https://urn.nsk.hr/urn:nbn:hr:211:347235

Kos, M. (2016). 'Reducibilnost i ireducibilnost polinoma', Undergraduate thesis, University of Zagreb, Faculty of Organization and Informatics, accessed 20 April 2024, https://urn.nsk.hr/urn:nbn:hr:211:347235

Kos M. Reducibilnost i ireducibilnost polinoma [Undergraduate thesis]. Varaždin: University of Zagreb, Faculty of Organization and Informatics; 2016 [cited 2024 April 20] Available at: https://urn.nsk.hr/urn:nbn:hr:211:347235

M. Kos, "Reducibilnost i ireducibilnost polinoma", Undergraduate thesis, University of Zagreb, Faculty of Organization and Informatics, Varaždin, 2016. Available at: https://urn.nsk.hr/urn:nbn:hr:211:347235

Please login to the repository to save this object to your list.
Metadata
TitleReducibilnost i ireducibilnost polinoma
Title (english)Reducibility and ireducibility of polinoms
AuthorMarko Kos
MentorMarija Jakuš (mentor)
MBZ: 291753
Committee memberBlaženka Divjak
MBZ: 210830
GranterUniversity of Zagreb
Faculty of Organization and Informatics
Varaždin
Defense date and country2016-07-14, Croatia
Scientific / art field,
discipline and subdiscipline		SOCIAL SCIENCES
Information and Communication Sciences
Organization and Informatics
Abstract
Na početku rada prikazani su neki primjeri polinoma te je dana općenita definicija polinoma. Zatim slijedi opis prstena polinoma, teorem o nulpolinomu te teorem o jednakosti polinoma. Nakon toga prikazano je dijeljenje polinoma te su dani koraci u provedbi Hornerovog algoritma. Slijedi primjena Euklidovog algoritma, odnosno računanje najveće zajedničke mjere polinoma. Nakon toga prelazimo na rješenja algebarske jednadžbe, a veliku važnost kod toga ima Osnovni teorem algebre koji je iskazan u radu. Obrađena su cjelobrojna, racionalna i kompleksna rješenja algebarske jednadžbe. U sklopu pronalaženja nultočaka polinoma predstavljena je metoda Newton – Bairstow-a koja služi za pronalaženje kompleksnih nultočaka polinoma. Na kraju rada objašnjena je reducibilnost i ireducibilnost polinoma nad ℂ, ℝ i ℚ.
Keywords
Languagecroatian
URN:NBNurn:nbn:hr:211:347235
Study programmeTitle: Business Systems
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) informatike (sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) informatike)
Type of resourceText
File originBorn digital
Access conditionsAccess restricted to students and staff of home institution
Terms of useLicence Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0) icon
Created on2017-01-26 07:29:04