All, I'm sorry my description of my problem wasn't very clear. I actually wasn't worried about the exact number of generations of 6 random numbers. I just wanted to understand how I could generate multiple sets of 6 random integers without having to type them all out one at a time, as I had done in my initial example, or have to write explicit loops.
Actually, several respondents provided exactly what I wanted, so thanks to all for those solutions. Those solutions showed me several language concepts that I need to investigate further. To me, Don Kelly's solution of (5#6)?55 was the most understandable to me, given my limited expertise in the J language. Skip On Wed, Mar 25, 2020 at 1:51 PM Hauke Rehr <hauke.r...@uni-jena.de> wrote: > That’s what ;/6 (? $~) 55 (amoung others) does. > We wondered mainly how many repetitions you actually wanted to get. > > There were 5 in your example and you wanted something extended 50 times. > None knew what it was you wanted extended and if it was to be counted. > > Did you intend to get > • 50 > • 51 > • 55 > • 250 > • 255 > runs of 6 elements each? > > Am 25.03.20 um 06:47 schrieb Skip Cave: > > The original requirement was to have the integers in each set of 6 be > > unique in that set. Zeros are OK. > > > > Skip > > > >> > >> > > ---------------------------------------------------------------------- > > For information about J forums see http://www.jsoftware.com/forums.htm > > > > -- > ---------------------- > mail written using NEO > neo-layout.org > > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm