Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- Module[{f}, f = Input["Vnesete ja funkcijata f"]; Print
- [BooleanTable[f] // TableForm]; Print[BooleanConvert[f, "NOR"]];
- Print[BooleanMinimize[f, "DNF"]] ]
- Module[{M, MT, L, f, n}, f = Input["Vnesete ja funkcijata f"];
- n = Input["n"]; M = Table[f, {i, n}, {j, n}]; MT = Transpose[M];
- L = UpperTriangularize[M]; Print[M // MatrixForm];
- Print[TM // MatrixForm]; Print[L // MatrixForm]]
- //Третата задача работи само во Mathematica 10 (останатите се пишувани во 8)
- Module[{W, M}, Print[W = WheelGraph[6]];
- Print[M =
- VertexDelete[EdgeDelete[W, {2 <-> 3, 4 <-> 3, 1 <-> 3}], 3]];
- TableForm[AdjacencyMatrix[M]]]
- Select[Permutations[Reverse@{1, 2, 3, 4, 5}, {3}],
- GreaterEqual @@ # &]
- array= RecurrenceTable[{a[n + 1] == 7+3*a[n], a[1] == 6}, a, {n, 1, 25}]
- Select[array, DigitCount[#, 10, 5] == 0 &, 5]
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement