Втора група

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

f[a0_, b0_] :=
 Module[{a = Abs[a0], b = UpperTriangularize[b0]},
  If[a0Koloni == b0Redici, Print[MatrixForm[a.b]],
    Print["Matricite nemozat da se mnozat!"]];]
a0Redici = Input["Vnesi broj na redici na prvata matrica"]
a0Koloni = Input["Vnesi broj na koloni"]
a0 = Table[Input["Vnesi element:"], {i, a0Redici}, {j, a0Koloni}]
b0Redici = Input["Vnesi broj na redici na vtorata matrica"]
b0Koloni = Input["Vnesi broj na koloni"]
b0 = Table[Input["Vnesi element:"], {i, b0Redici}, {j, b0Koloni}]
f[a0, b0]

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

list={"x","y","z","w","t"}
permutations=Permutations[list,{4}]
Select[permutations, !MatchQ[#, {___, "t", ___, "z", ___}] &]

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