We give a constructive proof of the fact that for any sequence of posi
tive integers n(1), n(2),..., n(N) there is a subsequence m(1),..., m(
r) for which GRAPHICS where C is a positive constant. Uchiyama previou
sly proved the above inequality with the right-hand side replaced by C
root N. We give a polynomial time algorithm for the selection of the
subsequence m(j).