MathGroup Archive 1995

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Re: Unique List

Here is a nonrecursive solution to the Lotto problem:

l = Table[k, {k, 42}];
m = l; Table[j = Random[Integer, {l, Length[m]}];
             k = m[[j]];
             m = Delete[m, j]; k,

  • Next by Date: Re: Re: Suggestions needed for Mathematica course
  • Next by thread: Re: Unique List