Прва група

Module[{f}, f = Input["Vnesete ja funkcijata f"]; Print[BooleanTable[f] // TableForm]; Print[BooleanConvert[f, "NAND"]]; Print[BooleanMinimize[f, "DNF"]] ]

Module[{M,MT,L, f, n, m}, f = Input["Vnesete ja funkcijata f"]; m = Input["m"]; n = Input["n"]; M = Table[f, {x, m}, {y, n}];MT=Transpose[M];L=LowerTriangularize[M]; Print[ M // MatrixForm]; Print[MT // MatrixForm]; Print[L // MatrixForm] ]

<<Combinatorica`;
f=CompleteGraph[3, 4]
ShowGraph[f]
f=DeleteVertex[f,1]
f=DeleteEdge[f,{1,4}]
f=DeleteEdge[f,{2,4}]
f=DeleteEdge[f,{3,4}]
ShowGraph[f,VertexColor->Red]
TableForm[ToAdjacencyMatrix[f]]

list={"a","b","c","d","e"}
permutations=Permutations[list,{3}]
Select[permutations, !MatchQ[#, {___, "b", ___, "a", ___}] &]

array= RecurrenceTable[{a[n + 1] == 7*a[n], a[1] == 7},  a, {n, 1, 20}]
Select[array, DigitCount[#, 10, 5] == 0 &, 7]