MathDB
Problems
Contests
National and Regional Contests
Iran Contests
Iran Team Selection Test
2009 Iran Team Selection Test
12
Iran TST 2009-Day4-P3
Iran TST 2009-Day4-P3
Source:
May 17, 2009
logarithms
LaTeX
combinatorics proposed
combinatorics
Problem Statement
T
T
T
is a subset of
1
,
2
,
.
.
.
,
n
{1,2,...,n}
1
,
2
,
...
,
n
which has this property : for all distinct
i
,
j
∈
T
i,j \in T
i
,
j
∈
T
,
2
j
2j
2
j
is not divisible by
i
i
i
. Prove that :
∣
T
∣
≤
4
9
n
+
log
2
n
+
2
|T| \leq \frac {4}{9}n + \log_2 n + 2
∣
T
∣
≤
9
4
n
+
lo
g
2
n
+
2
Back to Problems
View on AoPS