Professional Documents
Culture Documents
PMO National Written PDF
PMO National Written PDF
12
(a) |Pi | = 6 for all 1 i n, and
(b) |Pi \ Pj | 2 for all 1 i < j n.
We make a 12 ⇥ n {0, 1}-matrix M whose entries are defined as follows:
(
1 if student i plays in performance Pj ,
Mij =
0 if student i does not play in performance Pj .
P
For each i 2 {1, . . . , 12}, let ri = nj=1 Mij be the number of times i appears
P
in the sets P1 , . . . , Pn . Then, by double-counting, we have 12 i=1 ri = 6n.
Let R be the set of all unordered pairs of 1’s that lie in the same row.
Counting by rows, we see P12thatri in the ith row, there are ri 1’s and thus
ri
2 pairs. Thus, |R| = i=1 2 . Counting by columns, we note that for
any two columns, there are at most 2 pairs of 1’s among these columns, so
|R| 2 n2 = n(n 1). Thus,
12 ✓ ◆
X 12
X 12
X 12
X
ri
n(n 1) =) ri2 ri 2n(n 1) =) ri2 2n2 +4n.
i=1
2 i=1 i=1 i=1
a2 + b2 = n lcm(a, b) + n2
b2 + c2 = n lcm(b, c) + n2
c2 + a2 = n lcm(c, a) + n2
13
where n = k. Conversely, suppose that (a, b, c) is a solution. We then need
to show that a = b = c.
Suppose that there exists some integer d > 1 such that d|a, d|b, d|c. From
any of the equations of the system, we also get d|n. Thus, by replacing
(a, b, c) with ( ad , db , dc ), we obtain a new solution, where n is replaced by nd .
Thus, WLOG, we can assume that a, b, c, and n share no common divisor
other than 1. By solving the system of equations for 2a2 , we get
Hence n|2a2 , and similarly, n|2b2 , and n|2c2 . But as a, b, c and n share no
common divisor other than 1, it then follows that either n = 1 or n = 2.
If n = 1, then we have a2 +b2 = lcm(a, b)+1, which implies that 2ab ab+1.
This gives a = b = c = 1, which leads to the family of solutions (k, k, k).
If n = 2, then a2 + b2 = 2lcm(a, b) + 4 2ab + 4 so (a b)2 4, and
|a b| 2. Similarly, |b c| 2 and |c a| 2. Note that no two of a,
b, and c can be consecutive. To see this, suppose WLOG that a = b + 1.
Substituting this to the first equation gives 1 = 4. Contradiction.
Thus, at least two of a, b, and c must be equal. Without loss of generality,
assume that a = b. Substituting to the first equation, we obtain a = b = 2.
Thus, 4 + c2 = 2lcm(2, c) + 4, and so c is even. This is a contradiction
since we assumed that a, b, c, and n have no common divisor other than 1.
Therefore, the case n = 2 does not give any additional solution. ⌅
4. In acute triangle ABC with \BAC > \BCA, let P be the point on side BC
such that \P AB = \BCA. The circumcircle of triangle AP B meets side
AC again at Q. Point D lies on segment AP such that \QDC = \CAP .
Point E lies on line BD such that CE = CD. The circumcircle of triangle
CQE meets segment CD again at F , and line QF meets side BC at G.
Show that B, D, F, and G are concyclic.
Solution: Refer to the figure shown below. Since ABP Q is cyclic, we have
CP · CB = CQ · AC. Also, we have 4CAD ⇠ 4CDQ, so CD2 = CQ · AC.
This means that CE 2 = CD2 = CQ · AC = CP · CB, so 4CDP ⇠ 4CBD
and 4CEQ ⇠ 4CAE. Thus, \CBD = \CDP and, since QECF is cyclic,
\CAE = \CEQ = \QF D. Now, we see that
\EDC = \CBD + \DCB = \CBD + \ACB \ACD
= \CBD + \ACB (\CDP \DAC)
= \BAP + \DAC = \BAC.
14
Since triangle DCE is isosceles with CD = CE, we get \DEC = \BAC. It
follows that BAEC is cyclic, so \GBD = \CBD = \CAE. But \CAE =
\QF D, so \GBD = \QF D and therefore, BDF G is cyclic. The desired
conclusion follows. ⌅
15
.
Left to Right
Deputy Team Leader: Christian Paul Chan Shio, Ateneo de Manila University
16