Трета задача

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

//Доколку ја има некој втората задача, нека ми пише

<<Combinatorica`;
f=CompleteGraph[7,2]
ShowGraph[f]
f=DeleteVertex[f,1]
f=DeleteVertex[f,1]
f=DeleteEdge[f,{1,6}]
f=DeleteEdge[f,{1,7}]
ShowGraph[f,VertexColor->Green]
TableForm[ToAdjacencyMatrix[f]]

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

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