Opis predmeta

Opis predmeta je na voljo samo v hrvaščini.

Uvod u propozicionalni račun, formula, interpretacija (istinosna vrijednost formule)
Predikatni račun, modeli, glavni test – provjera je li formula ispunjiva, oboriva… 1. kolokvij
Kongruencije
Euklidov algoritam, linearna
Diofantova jednadžba
Moebiusova i
Eulerova funkcija
Polugrupa, grupa, prsten, polje 2. kolokvij
Rekurzivne relacije
Fibonaccijevi brojevi, linearne rekurzije s konstantnim koeficijentima 3. kolokvij nema nastave nema nastave nema nastave nema nastave nema nastave nema nastave nema nastave

Učni izidi

Učni izidi so prikazani v angleščini.

ability to establish the algebra of statements truth value of predefined variable values
ability to find if a given formula of the algebra of statements is a tautology
ability to find if a given formula of a predicate calculus is a valid one
Boole´s algebra
ability to find if a structure is a semi-group, a group, a ring or a field
divisibility, using the remainder theorem
ability to find the final value of Euclid's algorithm for a given data input
ability to find the values of both Möbius and Euler functions for given arguments
ability to find solutions to linear Diofant equations
ability to understand the implementation of variations, permutations and combinations in combinatorics; to to understand the implementation of the inclusion/exclusion formula
ability to establish the generating functions and Dirchlet principle
ability to understand recursive relations, Fibonacci sequence, linear and inhomogenous recursive relations
relations

Roki za to študijsko leto še niso objavljeni. Lani so bili:

do 10 dni do 30 dni pozneje izvedeni
Vir: ISVU. Klik na rok odpre Studomat za prijavo na izpit; tam preveri tudi morebitne spremembe.