Re: math combinations
- Posted by tone.skoda at siol.net May 26, 2002
- 464 views
I figured it out now after I searched mailing list archives. for i = 1 to 10 do ? Permutation({1, 2, 3}, 3, i) end for Still an example for every function would be very nice. ----- Original Message ----- From: <tone.skoda at siol.net> To: "EUforum" <EUforum at topica.com> Subject: Re: math combinations > > Thanks, but I really don't know how to use that function. > It would help if it had examples cause with examples you can see the > most clear what something does. > > Here it is with all its documentation: > > Permutation(sequence set, integer size, integer which) > --Returns a sequence containing the permutation with size 'size', > -- numbered 'which', from the set 'set'. > --The set is any sequence of objects, and so is the result. > --'which' starts at 1 and goes to the number of existing permutations > -- of this size. > --In case 'which' is out of bounds, an atom containing -1 is returned. > > ----- Original Message ----- > From: "Derek Parnell" <Derek.Parnell at SYD.RABOBANK.COM> > To: "EUforum" <EUforum at topica.com> > Sent: Monday, May 27, 2002 4:13 AM > Subject: RE: math combinations > > > > > > Have a look at Ricardo Forno's general utility package in th contributions > > page. It has a Permutations function in it which sounds like it might work > > for you. > > > > is uitsluitend bestemd voor de geadresseerde. Indien u dit bericht > > onterecht ontvangt wordt u verzocht de inhoud niet te gebruiken en > > de afzender direct te informeren door het bericht te retourneren. > > and is intended to be exclusively for the addressee. Should you > > receive this message unintentionally, please do not use the contents > > herein and notify the sender immediately by return e-mail. > > > > > > > > >