MathDB
Problems
Contests
National and Regional Contests
India Contests
Postal Coaching
2005 Postal Coaching
13
13
Part of
2005 Postal Coaching
Problems
(1)
An estimate
Source: Indian Postal Coaching 2005
9/23/2005
Let
a
1
<
a
2
<
.
.
.
.
<
a
n
<
2
n
a_1 < a_2 < .... < a_n < 2n
a
1
<
a
2
<
....
<
a
n
<
2
n
ne
n
n
n
positive integers such that
a
j
a_j
a
j
does not divide
a
k
a_k
a
k
or
j
≠
k
j \not= k
j
=
k
. Prove that
a
1
≥
2
k
a_1 \geq 2^{k}
a
1
≥
2
k
where
k
k
k
is defined by the condition
3
k
<
2
n
<
3
k
+
1
3^{k} < 2n < 3^{k+1}
3
k
<
2
n
<
3
k
+
1
and show that it is the best estimate for
a
1
a_1
a
1
combinatorics unsolved
combinatorics