2
Considering the numbers:
01,02,03,04,05,06,07,08,09,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25
How do I generate lists of 15 items (numbers cited above), and they need to have at least 2 items of difference between them. For example:
01,02,03,04,05,06,07,08,09,10,11,12,13,14,15
01,02,03,04,05,06,07,08,09,10,11,12,13,17,18
01,02,03,04,05,06,07,08,09,10,11,12,13,20,22
01,02,03,04,05,06,07,08,09,10,11,12,13,21,25
Notice at the end, I changed only the last 2 items of each list, they are unique, do not exist in the other lists. How to do this in practice, where the 2 difference items can be in any position?
Search about Combinatorial Analysis and Enumerative Functions. Link that talks about a similar problem: How to list combinations of a simple binomial
– Gomiero