MathDB
Problems
Contests
National and Regional Contests
Korea Contests
Korea Junior Mathematics Olympiad
2015 Korea Junior Math Olympiad
8
8
Part of
2015 Korea Junior Math Olympiad
Problems
(1)
Pretty much the same as KMO P7
Source: 2015 Korean Junior MO P8
11/1/2015
A positive integer
n
n
n
is given. If there exist sets
F
1
,
F
2
,
⋯
F
m
F_1, F_2, \cdots F_m
F
1
,
F
2
,
⋯
F
m
satisfying the following, prove that
m
≤
n
m \le n
m
≤
n
. (For sets
A
,
B
A, B
A
,
B
,
∣
A
∣
|A|
∣
A
∣
is the number of elements in
A
A
A
.
A
−
B
A-B
A
−
B
is the set of elements that are in
A
A
A
but not
B
B
B
)(i): For all
1
≤
i
≤
m
1 \le i \le m
1
≤
i
≤
m
,
F
i
⊆
{
1
,
2
,
⋯
n
}
F_i \subseteq \{1,2,\cdots n\}
F
i
⊆
{
1
,
2
,
⋯
n
}
(ii):
∣
F
1
∣
≤
∣
F
2
∣
≤
⋯
≤
∣
F
m
∣
|F_1| \le |F_2| \le \cdots \le |F_m|
∣
F
1
∣
≤
∣
F
2
∣
≤
⋯
≤
∣
F
m
∣
(iii): For all
1
≤
i
<
j
≤
m
1 \le i < j \le m
1
≤
i
<
j
≤
m
,
∣
F
i
−
F
j
∣
=
1
|F_i-F_j|=1
∣
F
i
−
F
j
∣
=
1
.
combinatorics
Sets