National Camp 2020 Exams aka Bangladesh

TSTST 2020
Md. Fuad Al Alam

August 23, 2020

1 Problems
1.1 Exam 1 (August 11, 2020)
1.1.1 Problem 1

Let m, n, k be integers such that (m − n)2 + (n − k)2 + (k − m)2 = mnk. Prove

that, m3 + n3 + k3 is divisible by m + n + k + 6.

1.1.2 Problem 2

Let ABC be a triangle with incentre I and circumcentre O. Let D, E, F be the

touchpoints of the incircle with BC, CA, AB respectively. Prove that, OI is the
Euler line of 4DEF .

1.1.3 Problem 3

Call a permutation of the numbers 1, 2, 3, ..., n stable if it starts with a 1 and

it's consecutive terms dier by at most 2. Let Tn be the number of stable
permutations. If 1 ≤ n ≤ 2020, for how many values of n is Tn divisible by 3?

1.1.4 Problem 4

There is given a trapezoid ABCD in the plane with BC k AD. We know that
the angle bisectors of the angles of the trapezoid are concurrent at O. Let T be
the intersection of the diagonals AC and BD. Let Q be the foot of the altitude
from O to CD. Prove that if the circumcircle of the triangle OT Q intersects
CD again at P , then T P k AD.

1.2 Exam 2 (August 13, 2020)

1.2.1 Problem 1

Two circles Γ1 and Γ2 meet at A and B . Let r be a line through B that meets
Γ1 at C and Γ2 at D, such that B is between C and D. Let s be the line parallel
to AD, which is tangent to Γ1 in E and has the minimal distance from AD.EA
meets Γ2 in F , and let t be the line through F which is tangent to Γ2 . Prove
that,

1
a) t k AC .
b) r, s and t are concurrent.

1.2.2 Problem 2

Find all functions from real numbers to real numbers that satisfy the following
equation:
f (x)f (y) if f (x + y) ≤ f (x)f (y)

f (xy) =
f (x + y) otherwise

1.2.3 Problem 3

Let n be a positive integer. Prove that there exist integers b1 , b2 , ..., bn such that
for any integer m; the number
(...(((m2 + b1 )2 + b2 )2 + ...)2 + bn−1 )2 + bn

is divisible by 2n − 1.

1.2.4 Problem 4

2015 positive integers are arranged on a circle. The dierence between any two
adjacent numbers equals their greatest common divisor. Determine the maximal
value of N which divides the product of all 2015 numbers, regardless of their
choice.

2
2 Solutions
2.1 Exam 1
2.1.1 Problem 1

We use the following well-known lemma:

For integers a, b, c, we have
a + b + c|a3 + b3 + c3 − 3abc

Notice that (m + 2)3 + (n + 2)3 + (k + 2)3 − 3(m + 2)(n + 2)(k + 2) = m3 + n3 + k3

Set a = m + 2, b = n + 2, c = k + 2 to get
m + n + k + 6|(m + 2)3 + (n + 2)3 + (k + 2)3 − 3(m + 2)(n + 2)(k + 2)

and the result follows.

2.1.2 Problem 2

Consider an inversion with respect to the incircle of 4ABC . This transfor-

mation sends the circumcircle of 4ABC to the nine-point circle of 4DEF .It
is well-known that I, O and O0 are collinear, where O0 is the nine-point cen-
tre of 4DEF . But I is the circumcentre and O0 is the nine-point centre of
4DEF ,which implies O0 I is the Euler line of 4DEF .Therefore,OI is the Euler
line of 4DEF , as desired.

2.1.3 Problem 3

It is easy to check that T1 = T2 = 1 and T3 = 2. Now, we will nd a recurrence

relation for Tn . Consider all stable permutation for n + 1 numbers, where n ≥ 3.
Let {1, a1 , a2 , ..., an } be such a permutation.we have 4 cases:
Case 1: a1 = 2
Remove {1} and consider all permutations of {a1 − 1, a2 − 1, ..., an − 1}. As
a1 − 1 = 1 is xed, we get Tn number of permutation for this case.
Case 2: a2 = 2
This forces a1 = 3 and a3 = 4. Otherwise, there would be consecutive terms
dier by at least 3. Now, remove {1, 3, 2} and consider all permutations of
{a3 − 3, a4 − 3, ..., an − 3}. As a3 − 3 = 1 is xed, similar to the previous case,
we get Tn−2 number of permutations for this case.
Case 3: ai = 2 for 3 ≤ i ≤ n − 1
This forces a1 = 3. So, at least one of the ai−1 and ai+1 would be greater than
4. This contradicts the given condition. So, there is no such stable permutation
in this case.
Case 4: an = 2 This forces the only valid permutation {1, 3, 5, 7, ..., 8, 6, 4, 2}.
Therefore, Tn+1 = Tn + Tn−2 + 1 must hold for n ≥ 3.
It is easy to show by strong induction that
T8k+1 ≡ 1(mod 3)

T8k+2 ≡ 1(mod 3)
T8k+3 ≡ 2(mod 3)

3
 T8k+4 ≡ 1(mod 3)
T8k+5 ≡ 0(mod 3)
T8k+6 ≡ 0(mod 3)
T8k+7 ≡ 2(mod 3)
T8k+8 ≡ 0(mod 3)
Notice that for 8k + 1 ≤ i ≤ 8k + 8, there are exactly 3 of the Ti 's which are
divisible by 3. It is easy to check that for 2017 ≤ i ≤ 2020, none of the Ti 's are
dividible by 3.
Therefore, the total number of values of n for which Tn is divisible by 3 is
2016 × 3
= 756
8
.

2.1.4 Problem 4

The angle bisectors of the angles of the trapezoid ABCD are concurrent at O,
which implies that there exists a circle Γ centered at O inscribed in trapezoid
ABCD. Let Q1 and Q2 be the touchpoints of Γ with BC and AD,respectively.We
prove the following two claims.
Claim 1: T lies on Q1 Q2 .
Proof: Apply Brianchon's Theorem to the degenerate hexagon AQ2 DCQ1 B .
Claim 2: O lies on Q1 Q2 .
Proof: Let OQ1 intersect AD at Q02 .As OQ1 ⊥ BC , BC k AD, we have
OQ02 ⊥ AD. This implies Q2 = Q02 , as desired.
Let P 0 be a point on CD such that T P 0 k AD k BC . Now,]OQP 0 = ]OQC =
]OQ1 C = ]OT P 0 = 90. Therefore, O, Q, P 0 and T are concyclic. Thus,
P = P 0 , as desired.

4
2.2 Exam 2
2.2.1 Problem 1

For part (a),let s and t intersect at T . We have

]AF T = ]ABF = ]ABD+]DBF = ]ABC+]DAF = ]AEC+]T EA = ]AEC+]ECA = ]EAC

= ]F AC
Thus, t k AC , as desired.
For part (b), let r and s intersect at T 0 . We have
]F BT 0 = ]F BD = ]F AD = ]F ET 0

which implies E, B, F and T 0 are concyclic.

We now have
]AF T 0 = ]EF T 0 = ]EBT 0 = ]EBD = ]EBA+]ABD = ]ECA+]ABC = ]ECA+]AEC = ]EAC

= ]F AC = ]AF T
The last equality follows from part (a).
Therefore, F T 0 ≡ t and T = T 0 , as desired.

2.2.2 Problem 2

The answer is f ≡ c where 0 ≤ c ≤ 1. It is easy to check that these functions

satisfy the given condiion. We will now show that they are the only solutions.
we divide it into 2 cases. Case 1: f (0) ≤ f (0)2
Plugging x = y = 0,we have
f (0) = f (0)2
Thus,f (0) = 0 or 1.
If f (0) = 0, we claim that f (a) ≤ 0 for all real numbers a. Otherwise, there
exists some real number a such that f (a) > 0. Plugging x = a, y = 0,we get
f (a) = 0, a contradiction.
Now, plugging x = 1, y = −1, we have f (−1) = f (1)f (−1) or f (−1) = 0.As
f (1) ≤ 0, we have f (−1) = 0 in both cases.
Again, plugging y = −1, we get f (−x) = 0 as f (x − 1) ≤ 0 for all real numbers
x. Therefore, the only solution for f (0) = 0 is f (t) = 0 for all real numbers t.
If f (0) = 1, then plugging y = 0 yields f (x) = 1 for all real numbers x.
Case 2: f (0) > f (0)2
Obviously f (0) > 0. Thus, we have 0 < f (0) < 1.
If f (x) ≤ f (x)f (0) for some real number x, plugging y = 0 yields f (0) =
f (x)f (0) or f (x) = 1. But this would imply f (0) ≥ 1 from the fact that
f (x) ≤ f (x)f (0), a contradiction.
Therefore, f (x) > f (x)f (0) for all real numbers x.
Again, plugging y = 0 gives f (x) = f (0). This solution satises the condition
as c > c2 for all 0 < c < 1. Thus, f ≡ c for 0 < c < 1 in this case.
Therefore, the only solutions are constant functions f ≡ c for 0 ≤ c ≤ 1 and we
are done.

5
2.2.3 problem 3

We have the following claim.

Claim: For some subset of the quadratic residue set a2 (mod 2n − 1), we can
pick bi such that the number of all possible values of (a2 + bi )2 (mod 2n − 1) has
decreased by at least 1.
Proof: Let m1 , m2 be such that m21 and m22 are not same modulo 2n − 1 i.e.
m21 6≡ m22 (mod 2n − 1). Pick bi ≡ −2−1 (m21 + m22 )(mod 2n − 1). It is easy to
check that (m21 + bi )2 ≡ (m22 + bi )2 (mod 2n − 1), thus proves our claim. It is
easy to verify that there are at most n quadratic residues modulo 2n − 1. We
can pick appropriate bi 's to reach
(...(((m2 + b1 )2 + b2 )2 + ...)2 + bn−1 )2 + bn ≡ 0(mod 2n − 1)

for all m and we are done.

2.2.4 Problem 4

It is easy to check that at least one of the two adjacent numbers is even. So, there
are at least 1008 even numbers on the circle.It is also easy to check that there
exists at least one number which is divisible by 4, because there exists at least
one pair of consecutive number both of which are even.Again, if there was no
positive integer divisible by 3, there would have been two adjacent number which
are both same modulo 3, but not divisible by 3. This leads to a contradiction.
Therefore, at least one of the integers is divisible by 3. Thus, N = 3 × 21009 is
necessary.However, the following two sequences yield that this is sucient.
{2, 4, 2, 4, 2, 4, ..., 2, 4, 3}, {2, 3, 2, 3, 2, 3, ..., 2, 3, 4}
Therefore, the maximal value of N is N = 3 × 21009 .