> On 22 August 2016 at 16:37, Wiebe van der Worp <[email protected]> wrote:
>> There is a group of ~100 people (n). In 5 time slots they visit 5
rooms in
>> 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
room
>> 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:
https://productforums.google.com/forum/#!topic/docs/EMlF95NfI5o
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 protected]
Problems? http://www.libreoffice.org/get-help/mailing-lists/how-to-unsubscribe/
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
