> On 22 August 2016 at 16:37, Wiebe van der Worp <firstname.lastname@example.org> wrote:
>> There is a group of ~100 people (n). In 5 time slots they visit 5
>> groups of ~20 people (n/5). The composition of the groups should be as
>> different as possible for each time slot. One person may not visit a
>> more than once.
On 22-08-16 17:17, Dries Feys wrote:
> I wouldn't use random numbers, but work with primes below 20. So,
> always starting with 1, and then increasing with the prime number
> until you reach 100.
> It might be even more unique when you use even higher primes, but I
> guess this methodogy will be fair enough.
Dries, thank you very much. Unfortunately I don't understand your
intentions, other than that you created a list of unique numbers, right?
I am still curious if there is a smart approach. The question looks like
what is described here:
For now I did some copy paste work with calculation of last values in
order to get 120 unique combinations, should work.
1 2 3 4 5
1 2 3 5 4
1 2 4 3 5
1 2 4 5 3
5 4 2 1 3
5 4 2 3 1
5 4 3 1 2
5 4 3 2 1
To unsubscribe e-mail to: email@example.com
Posting guidelines + more: http://wiki.documentfoundation.org/Netiquette
List archive: http://listarchives.libreoffice.org/global/users/
All messages sent to this list will be publicly archived and cannot be deleted
Impressum (Legal Info)
: Unless otherwise specified, all text and images
on this website are licensed under the
Creative Commons Attribution-Share Alike 3.0 License
This does not include the source code of LibreOffice, which is
licensed under the Mozilla Public License (MPLv2
"LibreOffice" and "The Document Foundation" are
registered trademarks of their corresponding registered owners or are
in actual use as trademarks in one or more countries. Their respective
logos and icons are also subject to international copyright laws. Use
thereof is explained in our trademark policy