MathGroup Archive 2011

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

Search the Archive

Re: 1-liner wanted

  • To: mathgroup at
  • Subject: [mg121656] Re: 1-liner wanted
  • From: "andre.robin3" <andre.robin3 at>
  • Date: Sat, 24 Sep 2011 22:32:57 -0400 (EDT)
  • Delivered-to:
  • References: <j5hdfe$7j5$>

ReplaceList[Givenlist, {___, {a_, b_, x0___}, ___, {b_, c_, x1___}, ___, 
{a_, c_,
x2___}, ___} :> {{a, b, x0}, {b, c, x1}, {a, c, x2}}]

"Kent Holing" <KHO at> a écrit dans le message de news: 
j5hdfe$7j5$1 at
> Let's assume we have a list of elements of the type {x,y,z} for x, y and z 
> integers. And, if needed we assume x < y < z. We also assume that the list 
> contains at least 3 such triples.
> Can Mathematica easily solve the following problem? To detect at least 
> three elements from the list of the type {a,b,.}, {b,c,.} and {a,c,.}? I 
> am more intereseted in an elegant 1-liner than computational efficient 
> solutions.
> Example:
> Givenlist ={1,2,3},{2,4,5],{6,7,8},{1,4,6},{7,8,9},{11,12,13}};
> should return
> {{1,2,3},{2,4,5},{1,4,6}}
> Kent Holing,
> Norway

  • Prev by Date: problem opening mathematica
  • Next by Date: Re: help with integration
  • Previous by thread: Re: 1-liner wanted
  • Next by thread: Re: 1-liner wanted