Reda.Kebbaj
• Member for 2 years, 8 months
• Last seen more than a week ago

G = {{a, b, c}, {d, e, f}, {g, h, i}}; s = Normal[SparseArray[Band[{1, 1}] -> {G, G, G}, {12, 12}]] // MatrixForm  \left( \begin{array}{cccccccccccc} a & b & c & 0 & 0 & 0 &...

a = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}}; b = {{1, 2}, {3, 4}}; SparseArray[Band[{1, 1}] -> {a, b}] // MatrixForm

Select[Select[c=Sort[lis],#!=Last[c] &],#==Last[Select[c,#!=Last[c] &]]&]

Format       Option Inspector                  Show option values : Global Preferences                  + NoteBook Option                     .....File Optiins   x NotebookAutoSave True.               ...

Description Program : The code is using 3 modules after the Intialisation: 1- Torus module 2- Rules module: 3- Excution Module: n generation module using Torus and Rules modules. Initialisations : n = ...

Module III : optimization the Challange September October 2019, Probabilty Value of BankNotes selected. AliceBob = Permutations[Range[0, 99], {2}]; HyBankNotes = 65; BankNote = {}; BankNotes = ...

I don't know if what you want is this: PathGraph[Range[11], GraphLayout -> {"CircularEmbedding"}, VertexSize -> Large]

Representing n generations: n=16, and the workspace imposed in the puzzle as a (11 $\times$ 11) matrix such that all the live cells are represented by 1 and the dead ones by 0. Also in this ...

Module 1 "Functions" : The First optimization problem is to find Functions called "Notes1,Notes2... " such that Functions Minimize All the possibility for diffferentes Banknotes. And prepare ...

The September question was extended on october 2019: http://www.research.ibm.com/haifa/ponderthis/challenges/October2019.html: Let's assume that Alice and Bob have two (possibly the same) integer ...