Results 1 to 2 of 2

Thread: Choosing pairs of numbers with a sum-bound

  1. #1
    Jan 2010

    Choosing pairs of numbers with a sum-bound

    Dear Forum,

    I have the following question:

    How can one write up a closed formula for computing the number of possible pairs of numbers in a set, whose sum is lees than or equal to a constraint?

    For example: if we have the numbers from 1 to 100 what is the number of cases when the sum of the two numbers in a pair is less than 10. Here, the 1, 100 and 10 values are not important at all, I just wanted make it easier to demonstrate the problem. Of course, I would need a so called closed formula for that, I am not sure whether it exists. (Iterative solution is unfortunately not an option).

    Any help would be appreciated!

    Your sincerely,

    Follow Math Help Forum on Facebook and Google+

  2. #2
    Aug 2008


    Let's denote what you called a "constraint" as n. Now, you can only make pairs of numbers a_1 and a_2, such that a_1+a_2<n, when a_1,a_2\in [1,n-2]. Therefore, there are n-2 pairs you can make with 1, n-3 pairs with 2, n-4 pairs with 3, ... , and 1 pair with the (n-2) number: (n-2)+(n-3)+...+2+1=\frac{(n-2)(n-1)}{2} is the numbers of pairs you seek.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Choosing numbers from a bag without replacement
    Posted in the Statistics Forum
    Replies: 3
    Last Post: Apr 23rd 2010, 02:16 PM
  2. Complex numbers-finding real number pairs
    Posted in the Calculus Forum
    Replies: 9
    Last Post: Mar 20th 2010, 11:36 PM
  3. Do sets of all pairs of real numbers form fields?
    Posted in the Advanced Algebra Forum
    Replies: 20
    Last Post: Jan 6th 2010, 08:37 PM
  4. ratio of rational numbers to natural pairs
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: Jul 29th 2008, 10:58 AM
  5. pairs of numbers
    Posted in the Algebra Forum
    Replies: 3
    Last Post: Mar 1st 2007, 01:48 PM

Search Tags

/mathhelpforum @mathhelpforum