MathDB
Problems
Contests
National and Regional Contests
Korea Contests
Korea Junior Mathematics Olympiad
2021 Korea Junior Math Olympiad
1
1
Part of
2021 Korea Junior Math Olympiad
Problems
(1)
One-by-One Tuples Matching
Source: KJMO 2021 P1
11/13/2021
For positive integers
n
,
k
,
r
n, k, r
n
,
k
,
r
, denote by
A
(
n
,
k
,
r
)
A(n, k, r)
A
(
n
,
k
,
r
)
the number of integer tuples
(
x
1
,
x
2
,
…
,
x
k
)
(x_1, x_2, \ldots, x_k)
(
x
1
,
x
2
,
…
,
x
k
)
satisfying the following conditions. [*]
x
1
≥
x
2
≥
⋯
≥
x
k
≥
0
x_1 \ge x_2 \ge \cdots \ge x_k \ge 0
x
1
≥
x
2
≥
⋯
≥
x
k
≥
0
[*]
x
1
+
x
2
+
⋯
+
x
k
=
n
x_1+x_2+ \cdots +x_k = n
x
1
+
x
2
+
⋯
+
x
k
=
n
[*]
x
1
−
x
k
≤
r
x_1-x_k \le r
x
1
−
x
k
≤
r
For all positive integers
s
,
t
≥
2
s, t \ge 2
s
,
t
≥
2
, prove that
A
(
s
t
,
s
,
t
)
=
A
(
s
(
t
−
1
)
,
s
,
t
)
=
A
(
(
s
−
1
)
t
,
s
,
t
)
.
A(st, s, t) = A(s(t-1), s, t) = A((s-1)t, s, t).
A
(
s
t
,
s
,
t
)
=
A
(
s
(
t
−
1
)
,
s
,
t
)
=
A
((
s
−
1
)
t
,
s
,
t
)
.
combinatorics
matchings