In combinatorial analysis the possible combinations are all sets of elements that are admissible by hypothesis.

If we have an ordered set of cardinality N and we want to find all the groupings of M adjacent elements, the combinations will be NM and correspond to the shift of a block of length M which starts from element 1 to element M and moves of a position gradually.

Having to reach the last element in position N, he can travel NM positions.

0 0 votes
Article Rating
Inline Feedbacks
View all comments