How to Generate Randomnumbers Without duplicating any 3 numbers?

Hello sem,

See this link:http://www.google.co.za/url?sa=t&rct...52434380,d.d2k

Hello sem,

I don't think what you are asking, is possible. Firstly, you specify a minimum level of 1, with a maximum of 40, within a range of 40 Cells. Within each of the fifteen sets, all of the 40 Cells will be populated with 40 Random Numbers between 1 and 40. To then check for duplicates in these 15 sets of data, would require Coding to allow for +-1800 permutations, making it just about impossible.

In your example presented to the Forum, you show in red, "Duplicates" as numbers, 2, 5, 24 and, 14,15 and 22. Yet you have numbers in Green as, 8, 17, 30 and 34, which you don't consider as "Duplicates". I don't know how the system should ignore either, numbers 8, 17 and 30, or 17, 30 and 34, as not being "Duplicates". The same goes for many other permutations of those very same numbers,i.e: 8, 30 and 34, or 8, 17 and 34, etc.

Maybe you should rethink this issue first, and consider a totally different approach.

I hope you get the "picture"

Hello sem,

Again,

I don't know how the system should ignore either, numbers 8, 17 and 30, or 17, 30 and 34, as not being "Duplicates". The same goes for many other permutations of those very same numbers,i.e: 8, 30 and 34, or 8, 17 and 34, etc.

I am afraid that I cannot help you with this request. It just will not be possible to Code in such a way where the system should decide what are pairs,that are okay and, which "Triplicates" are "Duplicates" and what not.

Regards

Hello sem,

...but i can not find to check and prevent duplicate trios

And you will never be able to. As I have said in my previous posts, it is impossible to Code in such a way, where the system has to identify "Trios" as duplicates, while you want to allow "Pairs" as not being seen as duplicates. For every two pairs of numbers, there are multiple combinations of "Trios", which the system will identify as "Duplicates". Thus defeating your objective.

If ever, which a strongly doubt, you do find a solution for this, then I would love to see it.