prikaz prve stranice dokumenta Linearne kongruencije, linearne diofantske jednadžbe i programska podrška
No public access
undergraduate thesis
Linearne kongruencije, linearne diofantske jednadžbe i programska podrška
Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing, 2020. urn:nbn:hr:168:299664
Seletković, Nikola
University of Zagreb
Faculty of Electrical Engineering and Computing

Institutional repository: FER Repository

Cite this document

Seletković, N. (2020). Linearne kongruencije, linearne diofantske jednadžbe i programska podrška (Undergraduate thesis). Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing. Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:299664

Seletković, Nikola. "Linearne kongruencije, linearne diofantske jednadžbe i programska podrška." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2020. https://urn.nsk.hr/urn:nbn:hr:168:299664

Seletković, Nikola. "Linearne kongruencije, linearne diofantske jednadžbe i programska podrška." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2020. https://urn.nsk.hr/urn:nbn:hr:168:299664

Seletković, N. (2020). 'Linearne kongruencije, linearne diofantske jednadžbe i programska podrška', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 02 December 2024, https://urn.nsk.hr/urn:nbn:hr:168:299664

Seletković N. Linearne kongruencije, linearne diofantske jednadžbe i programska podrška [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2020 [cited 2024 December 02] Available at: https://urn.nsk.hr/urn:nbn:hr:168:299664

N. Seletković, "Linearne kongruencije, linearne diofantske jednadžbe i programska podrška", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2020. Available at: https://urn.nsk.hr/urn:nbn:hr:168:299664

Metadata
TitleLinearne kongruencije, linearne diofantske jednadžbe i programska podrška
Title (english)Linear Congruences, Linear Diophantine Equations and Software Support
AuthorNikola Seletković
MentorMario Krnić (mentor)
Committee memberMario Krnić (predsjednik povjerenstva)
Committee memberLenka Mihoković (član povjerenstva)
Committee memberAnamari Nakić (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Electrical Engineering and Computing
Zagreb
Defense date and country2020-07-03, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Ključni pojmovi iz elementarne teorije brojeva koji su obrađeni u ovom radu su djeljivost, kongruencije i diofantske jednadžbe. U kontekstu djeljivosti, bitno je spomenuti pojam najvećeg zajedničkog djelitelja koji se računa pomoću Euklidovog algoritma te osnovni teorem aritmetike. Kineski teorem o ostatcima, Gaussova definicija kongruencije i diofantske jednadžbe pokazale su se ključnima za razvoj kriptografije. Njen temelj čine veliki prosti brojevi koji predstavljaju ključeve pomoću kojih se kodira i dekodira poruka, a to je u praksi rješavanje linearnih kongruencija te sustava linearnih kongruencija pomoću Kineskog teorema o ostatcima. Diofantske se jednadžbe koriste za traženje rješenja polinoma u skupu cijelih brojeva.
Abstract (english)
The main terms from the elemental number theory that have been mentioned in this thesis are divisibility, congruence and diophantine equations. Within the context of divisibility, it is important to mention the term of the greatest common divisor that is being calculated by the Euclidian algorithm, as well as the Fundamental Theorem of Arithmetic. The Chinese Remainder Theorem, Gauss' definition of congruence and diophantine equations have proved to be key for the development of cryptography. Its foundation consists of large prime numbers that represent the keys by which the messages are coded and decoded. In practice, this means solving linear congruences and the systems of linear congruences by applying the Chinese Remainder Theorem. Diophantine equations are used to determine whether or not polynomial equation has integer solutions.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:168:299664
Study programmeTitle: Computing
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsClosed access
Terms of useLicence In copyright icon
Public note
Created on2023-01-14 09:54:51