Scribd
Upload
35 views2 pages

Cwmi2019-Brief 1

The document contains 4 math problems from Day 1 and 4 math problems from Day 2. The problems involve topics like geometry, inequalities, prime numbers, and sets. They ask the reader to prove statements, find values that satisfy certain properties, and determine maximal or minimal values related to sets and numbers.

Uploaded by

freedom HD
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views2 pages

Cwmi2019-Brief 1

The document contains 4 math problems from Day 1 and 4 math problems from Day 2. The problems involve topics like geometry, inequalities, prime numbers, and sets. They ask the reader to prove statements, find values that satisfy certain properties, and determine maximal or minimal values related to sets and numbers.

Uploaded by

freedom HD
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Questions

Day 1

1. Find all positive integer n such that the number 3n + n2 + 2019 is a perfect square.

2. Let O and H be the circumcenter and the orthocenter of an acute triangle ABC with
AB = 6 AC, respectively. Let M be the midpoint of BC, and let K be the intersection of
the line AM and the circumcircle of ∆BHC, such that M lies between A and K. Let N be
the intersection of the lines HK and BC. Show that if ∠BAM = ∠CAN , then AN ⊥OH.

3. Let S = {(i, j)|i, j = 1, 2, ..., 100} be a set consisting of points on the coordinate plane.
Each element of S is coloured one of four given colours. A subset T of S is called colourful
if T consists of 4 points with distinct colours, which are the vertices of a rectangle whose
sides are parallel to the coordinate axes. Find the maximal number of colourful subsets
that S can have, among all legitimate colouring patterns.

4. Let n be a given integer such that n ≥ 2. Find the smallest real number λ with the following
property: for any real numbers x1 , x2 , ..., xn ∈ [0, 1], there exist integers 1 , 2 , ..., n ∈ {0, 1}
such that the inequality j
X
(k − xk ) ≤ λ


k=i

holds for all pairs of integers (i, j) where 1 ≤ i ≤ j ≤ n.


Day 2

1. Let ABC be an acute triangle such that AB > AC, with circumcenter O and orthocenter H.
Let M and N be points on AC and AB, respectively, such that HN//AC and HM//AB.
Let L be the reflection of H in M N , and the lines OL and AH intersect at K. Show that
the points K, M, L, N are concyclic.

2. Let n be a given integer such that n ≥ 2. For any n positive real numbers a1 , a2 , ..., an such
that a1 ≤ a2 ≤ · · · ≤ an , show that
n
a2
 
X
2 1 1 X
i
(ai + aj ) 2
+ 2 ≥ 4(n − 1) .
1≤i<j≤n
i j i=1
i2

3. Show that for any positive integer k, there are at most finitely many sets T with the following
properties:

• T consists of finitely many prime nunbers;


Q Q
• p∈T p| p∈T (p + k).

4. A set S is called a good set if S = {x, 2x, 3x} for some real number x. For a given integer
n ≥ 3, find the maximal number of good subsets that an n-element set of positive integers
may have.

You might also like