Services & Resources / Wolfram Forums
MathGroup Archive
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2006

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

Search the Archive

programming problem about elements taken

  • To: mathgroup at
  • Subject: [mg72470] programming problem about elements taken
  • From: "Barrow" <GRseminar at>
  • Date: Sat, 30 Dec 2006 05:39:44 -0500 (EST)

Dear all,
  I have a list of numbers (A),in fact, they are numbers distributed
over [0,1].  Given parameter \epsilon, I have to choose elements from A
such that their distances are larger than \epsilon, so the elements are
"distringuishable". My goal is to find the maximum number of elements
from A to meet the above "distinct criterion".
  How to do it with the functions build-in in mathematica ??
  Thanks in advence.           Sincerely           Barrow

  • Prev by Date: webMathematica problem
  • Next by Date: Re: Why doesn't DSolve find all the solutions of this pde
  • Previous by thread: RE: A problem in calculus
  • Next by thread: Re: programming problem about elements taken