MathDB
Problems
Contests
National and Regional Contests
Turkey Contests
National Olympiad First Round
2000 National Olympiad First Round
35
35
Part of
2000 National Olympiad First Round
Problems
(1)
Turkish NMO First Round - 2000 P-35 (Combinatorics)
Source:
7/8/2012
If every
k
−
k-
k
−
element subset of
S
=
{
1
,
2
,
…
,
32
}
S=\{1,2,\dots , 32\}
S
=
{
1
,
2
,
…
,
32
}
contains three different elements
a
,
b
,
c
a,b,c
a
,
b
,
c
such that
a
a
a
divides
b
b
b
, and
b
b
b
divides
c
c
c
,
k
k
k
must be at least ?
<
s
p
a
n
c
l
a
s
s
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
A
)
<
/
s
p
a
n
>
17
<
s
p
a
n
c
l
a
s
s
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
B
)
<
/
s
p
a
n
>
24
<
s
p
a
n
c
l
a
s
s
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
C
)
<
/
s
p
a
n
>
25
<
s
p
a
n
c
l
a
s
s
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
D
)
<
/
s
p
a
n
>
29
<
s
p
a
n
c
l
a
s
s
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
E
)
<
/
s
p
a
n
>
None
<span class='latex-bold'>(A)</span>\ 17 \qquad<span class='latex-bold'>(B)</span>\ 24 \qquad<span class='latex-bold'>(C)</span>\ 25 \qquad<span class='latex-bold'>(D)</span>\ 29 \qquad<span class='latex-bold'>(E)</span>\ \text{None}
<
s
p
an
c
l
a
ss
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
A
)
<
/
s
p
an
>
17
<
s
p
an
c
l
a
ss
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
B
)
<
/
s
p
an
>
24
<
s
p
an
c
l
a
ss
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
C
)
<
/
s
p
an
>
25
<
s
p
an
c
l
a
ss
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
D
)
<
/
s
p
an
>
29
<
s
p
an
c
l
a
ss
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
E
)
<
/
s
p
an
>
None