qwertyuiopasdfghjklzxcvbnmqw

ertyuiopasdfghjklzxcvbnmqwert
yuiopasdfghjklzxcvbnmqwertyui
opasdfghjklzxcvbnmqwertyuiopa
sdfghjklzxcvbnmqwertyuiopasdf
ghjklzxcvbnmqwertyuiopasdfghj
klzxcvbnmqwertyuiopasdfghjklz
xcvbnmqwertyuiopasdfghjklzxcv
bnmqwertyuiopasdfghjklzxcvbn
mqwertyuiopasdfghjklzxcvbnmq
wertyuiopasdfghjklzxcvbnmqwe
rtyuiopasdfghjklzxcvbnmqwerty
uiopasdfghjklzxcvbnmqwertyuio
pasdfghjklzxcvbnmqwertyuiopas
dfghjklzxcvbnmqwertyuiopasdfg
hjklzxcvbnmqwertyuiopasdfghjk
lzxcvbnmrtyuiopasdfghjklzxcvbn
mqwertyuiopasdfghjklzxcvbnmq
The Relationship Between the Means of Subsets of

The Relationship Between the Means of Subsets of

Size 2
from a Set of Size n and the Mean of the Parent Set
By Benjamin M. Wheeler
Thiel College

Advised by
Dr. Mervin Newton
and
Dr. Karl Oman
2006

Wheeler 1
Theorem.
Given a set S made up of unique elements a1 , a 2 , K , a n where n is even and is equal to the
number of elements in set S, their exist a maximum of

(n 1)(n 2)
2

subsets of size 2 of S

whose mean is greater than that of the overall set.

Proof.
The mean of set S will be represented as S . Additionally, the mean of a subset a x and
a y will be represented by the notation ( a x a y ) . It should be noted that every subset

considered in this proof will be of size 2.

As each element in S is unique, arrange the elements S in increasing order such that
a1 < a 2 < K < a n .

Before the remainder of the general discussion notice the case where n = 2 is a trivial,
where only one subset exists, (a1a 2 ) , which is also (S), and as such whose mean is
always equal to that of (S), leaving 0 subsets whose mean is greater than the overall, as
the formula supports,

(2 1)(2 2) = 1 0 = 0
2

Wheeler 2
To complete the proof we will first show that their exist n-1 subsets of S whose mean will
always be less than or equal to that of the overall mean. These subsets may be identified
by the n-1 inequalities produced using the following method,

set i = n
while i > 1 do
(a1 a i ) + (a 2 a i 1 ) + K + (a floor ( i ) a
2

)
i
i floor 1
2

i
floor S
2

set i = i 1
For purposes of explanation we will identify these n-1 inequalities as in , in1 , K, i2 .

The inequality i n will always be of the form,

( a1 a n ) + ( a 2 a n 1 ) + K + ( a n a n
2

+1

n
S
2

Through a straightforward simplification it may be shown,

n
S
2
2
2
a1 + a 2 + K + a n n a1 + a 2 + K + a n

2
2
n

a + a2 + K + an
a1 + a 2 + K + a n n 1

(a1a n ) + (a 2 a n 1 ) + K + (a n a n

)
+1

a1 + a 2 + K + a n = a1 + a 2 + K + a n
As such the inequality becomes,
( a1 a n ) + ( a 2 a n 1 ) + K + ( a n a n
2

+1

)=

n
S
2

which implies the mean of all subsets to be equal to S , or, if any of the
left of the above equality are above S then at least one must be below.

n
subsets on the
2

Wheeler 3
The inequalities i n , i n ,K, i2 are equally straightforward to verify by observing,
2

+1

a1a n < S

+1
2
a1 + a n
+1
a + a + K + an
2
< 1 2
n
2
na1 + na n < 2a1 + 2a2 + K + 2an
2

+1

n
n
< 2a1 + 2a n + 12a n
+1
+1 2
2
2 +2
2
2

na1 + na n
na1 + na n
2

na n
2

( n 2) a n
2

+1
+1
+1

< na1 + 2a n + (n 2)a n

2

+1

< 2 a n + ( n 2) a n
2

+1

+2

+2

< (n 2)a n , true by definition

2

+2

n
Since a1a n < S , it follows that a1 paired with the 1 remaining elements are also

+1
2
2

less than S . As these

n
subsets, a1a n , a1a n , K , (a1a 2 ) , are each unique subsets

+1
2
2
2

of the inequalities i n , i n , K , i2 , these inequalities are in fact not needed as part of the
2

+1

proof.

This leaves the inequalities in 1 , in 2 , K , i

n .
n 1
2

These may be expressed as:

Wheeler 4

(a1a n1 ) + (a 2 a n2 ) + K + (a floor (n1 ) a

2

(a1a n2 ) + (a 2 a n3 ) + K + (a floor (n2 ) a

2

n 1
( n 1) floor
1
2

n2
( n 2 ) floor
1
2

n 1
) floor
S
2
n2
) floor
S
2
K

n
n 1
2 S
(a1a n ) + (a 2 a n
) + K + (a
) floor
a
n
n

n 1
n 1
n 1
2
n 1 1
2
2
2

floor
1
( n 2 ) floor
2
2

To generalize the verification for the above inequalities, observe that the coefficient of
S is equal to the number of subsets on the left of the inequality. Taking away the

notation you are left with:

n 1
( n 1) floor
1
2

n 1 a1 + a 2 + K + a n
floor

n
2

n2
( n 2 ) floor
1
2

n 2 a1 + a 2 + K + a n
floor

n
2

a1 + a n 1 + a 2 + a n 2 + K + a floor (n 1 ) + a
2

a1 + a n 2 + a 2 + a n 3 + K + a floor (n 2 ) + a
2

a1 + a

n
n 1
2

+ a2 + a

n
n 1 1
2

+K+ a

n
n 1
2
floor

+a

n
n 1
2
( n 2 ) floor
1
2

n
n 1

2 a1 + a 2 + K + a n
floor

2
n

You may then rearrange the left hand side of the inequality:

Wheeler 5
a1 + K + a floor (n 1 ) + a
2

n 1 + K + an 1
( n 1) floor
1
2

2
a1 + K + a floor (n 2

) + a(n2) floor n2 1 + K + an2

2

2
a1 + K + a

n + a
n +K+ a n
n 1
n 1
n 1
2
2
2
floor
( n 2) floor
1

2
2

n 1 a1 + a2 + K + an
floor

n
2

n 2 a1 + a2 + K + an
floor

n
2

n
n 1
2 a1 + a2 + K + an
floor

2
n

From this point reconcile the denominators to leave:

n 1
n a1 + K + a floor (n 1 ) + a
+
K
+
a
(a1 + a2 + K + an )
n 1 2 floor
n 1
( n 1) floor
1
2
2

n2
n a1 + K + a floor (n 2 ) + a
K
a
+
+
(a1 + a2 + K + an )
n 2 2 floor
n2
(
n
2
)
floor
1

n
n 1

2 (a + a + K + a )
n a1 + K + a
+ K + a n 2 floor
n
n +a
n

1 2

2
n 1
n 1
n \ 1

2
2
2

floor
( n 2) floor
1

2
2

Observe that the total numbers of elements on each side of the inequality when multiplied
by their coefficients are equal. Using the prior observation that the number of subsets on
the left side of the inequality was equal to the coefficient of S , 2 times this quantity shall
equal the total number of elements given all subsets contain two unique elements. Let us
describe the number of unique elements on the left side of the equation by m. The total
number of elements on the left side of the inequality will then be n m , while the right

Wheeler 6
hand side of the inequality may be expressed as m(a1 + a 2 + K + a n ) and in terms of total
number of elements, m n .

In order to compare the above inequalities we will split the above into the following two
inequalities each representing the lower and upper half of the elements respectively and
using m. By showing each of these inequalities to be true, it shall follow the original
inequality must be true. The lower half of each inequality becomes as follows, they are
numbered for convenience in reference,

n a1 + K + a floor (n 1 ) m a1 + a2 + K + a n

2
2

n a1 + K + a floor (n 2 ) m a1 + a2 + K + a n

2
K

m a + a +K+ a
n a1 + K + a
2
n
n
1

n 1

floor

Notice the right side of the inequality contains all the elements of the left side in addition
to at least one element whose value is singularly greater than each on the left.
Furthermore, where more than one element on the right is singularly greater than each on
the left, such an element exist that is equal to a x +1 where a x is equal to the greatest
singular element on the left hand side. Let us now simplify the inequality by subtracting
from the right side those elements which are similar to elements on the left. As each
element on the left maintains a coefficient of n, while each coefficient on the right
contains a coefficient of m, where m<= n, the above inequalities become:

Wheeler 7

(n m) a1 + K + a floor (n 1 ) m a floor (n 1 )+1 + K + a n

2
2

(n m) a1 + K + a floor (n 2 ) m a floor (n 2 )+1 + K + a n

2
2

m a
(n m) a1 + K + a
+
K
+
a
n
n
n

n 1
n 1
2
2
2

floor
floor
+1

2
2

Let us then through substitution of greater values for lesser on the left and lesser values
for greater on the right to change the inequalities to the form below, realizing that if the
following hold, so will the original,

(n m) a floor (n1 ) (n m ) a floor (n 1 )+1

2
2

(n m) a floor (n 2 ) (n m) a floor (n 2 )+1

2
2

( n m) a

( n m) a
n
n

n 1
n 1
floor 2
floor 2 +1

2
2

Given the prior definition that a1 < a 2 < K < a n these inequalities most certainly hold,
realizing similar logic will apply to the upper half of the inequalities
in 1 , in 2 , K , i

n ,
n 1
2

it is shown that these n

unique subset of S below the mean in all cases.

n
2 inequalities each show one
2

Wheeler 8
To recap, the inequalities in , in1 , K, i2 have each been verified, showing at least n 1
subsets of S will have a mean equal to or below S when S contains an even number of
elements. The total number of subsets of size 2 from a set of size n will equal,
n( n 1)
2

Given at least n 1 subsets whose mean is equal to or below S ,

n(n 1)
n(n 1) 2(n 1)
(n 1) =

2
2
2
(n 2)(n 1)
=
2
is the greatest number of possible subsets whose mean is greater than S .

The final step is to generate a set which achieves this theoretical max. Such a set may be
formed from the set of integers for any set of size n by choosing the set as follows,

a1 = 1
a2 =

(n 2)2

+1
2
a3 ,K, a n = a 2 + 1, a 2 + 2,K, a n + (n 2)
For a set of size n the set created would be,

(n 2 )2
(n 2)2 + 2,K, (n 2)2 + (n 1)
1
,
+
1
,

2
2
2

To look at this sequence with regards to our problem we will examine the overall mean
and the two pairings, (a1 , n) and (a 2 a3 ) ,

Wheeler 9

1+

( a1 , a n ) =

(n 2 )

(n 2 )2

n2

(a2 , a3 ) =

(n 2 )2

+ ( n 1)

2
+

n
2

+ 2n

4
4n + 4 + 2n
2
2n + 4
4

(n 2)2 + 1 + (n 2)2 + 2
2

2(n 2 )
+3
2
=
2
2

2
(
n 2) + 3
=

2
n 4n + 4 + 3
=
2
2
n 4n + 7
=
2
2

(
(
(
1
n 2 )2
n 2 )2
n 2 )2
( S ) = 1 +
+1+
+ 2 +K+
+ ( n 1)
n
2
2
2

n 1 (n 2 )2

+ m
1 +

2
m =1

2

(
1
n 2 ) (n 1) (n + 1)n
= 1 +
+
n
n
2
2

(
1
n 2 )2 (n 1) n 2 + n 2 n
= 1 +
+

n
2
2
2

1
=
n

1
n

n 2 4 n + 4 (n 1) n 2 n
1
+
+

2
2

Wheeler 10

(S ) =

1
n 2 4n + 4 (n 1) n 2 n
1
+
+

n
2
2

) (

n 3 4 n 2 + 4n n 2 4 n + 4 n 2 n
1
1
+
+

n
2
2

1 n 3 4 n 2 + 4n n 2 + 4n 4 n 2 n
+
1 +

n
2
2

1 n 3 4n 2 + 7 n 4
1 +

n
2

1 n 3 4n 2 + 7 n 4
+
n
2n
3
2 n 4n 2 + 7 n 4
=
+
2n
2n
3
2
n 4n + 7 n 2
=
2n
=

To recap, (S ), (a1a n ), and (a 2 a3 ) are,

n 2 2n + 4
4
2
n 4n + 7
(a2 , a3 ) =
2
3
2
n 4n + 7 n 2
(S ) =
2n

(a1 , an ) =

To this show this set will achieve the theoretical max, we must show that

( a 2 a 3 ) > ( S ) > ( a1a n )

Let us first compare (S ) and (a1a n ) first, assuming the condition true,

Wheeler 11

(a1a n ) < ( S )
n 2 2 n + 4 n 3 4n 2 + 7 n 2
<
4
2n
2
3
n n 2n + 4 < 2 n 4n 2 + 7 n 2

) (

n 3 2n 2 + 4n < 2n 3 8n 2 + 14n 4
n 3 4n 2 + 4n < 2n 3 10n 2 + 14n 4

)
n(n 2 )(n 2 ) < 2n(n 4n + 4 ) 2(n 3n + 2 )
n(n 2 )(n 2 ) < 2n(n 2 )(n 2 ) 2(n 1)(n 2 )
n n 2 4 n + 4 < 2 n 3 8n 2 2 n 2 + 8n + 6 n 4
2

2(n 1)(n 2 ) < n(n 2 )(n 2 )

2n 2 6n + 4 < n 3 4n 2 + 4n
6n 2 + 4 < n 3 + 10n

6 n 2 + < n n 2 + 10 , where n > 2

3

Notice that the above inequality is true for any integer n when n > 2 , and when n = 2
the two sides become equal,
6 2 2 + 4 = 2 3 + 10 2
28 = 28
6 3 + 4 < 33 + 10 3
2

60 < 67
Having verified half of the inequality (a1a n ) < ( S ) < (a 2 a3 ) , we will now show the other
half, ( S ) < (a2 a3 ) , to be true as well,
( S ) < (a 2 , a3 )
n 3 4n 2 + 7 n 2 n 2 4n + 7
<
2n
2
n 3 4n 2 + 7 n 2 < n 3 4n 2 + 7 n
0<2
Through verification of (a1a n ) < ( S ) < (a 2 a3 ) , where n > 2, it follows all subsets
(a1a 2 ), K , (a1a n ) are below the mean and all subsets (a 2 a3 ), K , (a n1a n ) are above the

Wheeler 12
mean in all case where n > 2. The final step is notice that the number of subsets
( a 2 a3 ), K , ( a n1a n ) is easily described the total number of subsets subtracted from the
number of sets shown to be below the overall mean, (n-1), giving,

n(n 1)
n(n 1) 2(n 1)
(n 1) =

2
2
2
(n 2)(n 1)
=
2