MathGroup Archive 2004

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

Search the Archive

Searching algorithm


Hello,

A =  2x2 matrix {{1,8,9,4,6,3},{1,7,9,11,8,54},{73,2,1,61,8,9},...}

Is there any algorithm which can find the most frequent subset of three
numbers ( like {1,8,9} ) that appears in  A ?

Thanks,

Amir





  • Prev by Date: how can I solve a transcendantale function?
  • Next by Date: Re: Maclaurin Series
  • Previous by thread: Re: how can I solve a transcendantale function?
  • Next by thread: Re: Searching algorithm