MathGroup Archive 2011

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

Search the Archive

efficiently testing a list

  • To: mathgroup at
  • Subject: [mg122514] efficiently testing a list
  • From: zb <zaeem.burq at>
  • Date: Sun, 30 Oct 2011 04:25:09 -0500 (EST)
  • Delivered-to:

Consider the list of pairs:

List = Table[ {a[i],b[i]} , {i,1,N} ].


List = { {a[1],b[1]} , {a[2],b[2]} , {a[3],b[3]} , ... ,
{a[N],b[N]} },

and a given function f[a].

What is the quickest way of testing if all elements of List satisfy
f[a[i]] < b[i].

  • Prev by Date: Re: Problem with Solve and NSolve
  • Next by Date: Simple question about inverse of a function
  • Previous by thread: Re: I cant get step by step solution @ this diferantial equation
  • Next by thread: Re: efficiently testing a list