I believe wikipedia refers to these as k-permutations (of n) and the
example given by Ric agrees with my memory of what I learned as
permutations of n items taken k at a time.

https://en.wikipedia.org/wiki/Permutation#k-permutations_of_n

On Sat, Aug 25, 2018 at 11:07 PM 'Pascal Jasmin' via Programming <
[email protected]> wrote:

> I agree that previous dyadic result was non-sensical.  New behaviour is
> reasonable.  Though the name perm(utations) is not perfect.  "permutations
> of the combinations x of y".  Could be seperate dyadic verb "permcomb"
>
>
>
>
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm

Reply via email to