ISL 2001 C1
by Wolstenholme, Aug 1, 2014, 9:22 PM
Let
be a sequence of positive integers. Let
be the number of
-element subsequences
with
, such that
and
. Considering all such sequences
, find the greatest value of
.
Solution:
I claim that the answer is
which can be obtained by letting
for all
.
Now I shall show that
is the highest possible number of triples. Let
be the number of
that are congruent to
respectively. It is clear that since each relevant
-element subset forms a complete residue system modulo
so the maximum number of such subsets is
.
Now by AM-GM we have that
as desired, so we are done.









Solution:
I claim that the answer is



Now I shall show that







Now by AM-GM we have that
