Scribd
Upload
85 views

Solution To Mock Contest

The document contains solutions to 6 problems: 1) Proving that certain numbers in a sequence are less than or equal to 0. 2) Proving that a prime number p divides integers a, b, c given certain conditions. 3) Determining the largest power of an integer that divides a particular term in a sequence. 4) Showing a certain equation has a unique real solution between consecutive integers and that none are rational. 5) Proving points related to a circle through midpoints of triangle sides and perpendicularity. 6) Determining which player has a winning strategy in a token removal game.

Uploaded by

Bikky Biraji
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
85 views

Solution To Mock Contest

The document contains solutions to 6 problems: 1) Proving that certain numbers in a sequence are less than or equal to 0. 2) Proving that a prime number p divides integers a, b, c given certain conditions. 3) Determining the largest power of an integer that divides a particular term in a sequence. 4) Showing a certain equation has a unique real solution between consecutive integers and that none are rational. 5) Proving points related to a circle through midpoints of triangle sides and perpendicularity. 6) Determining which player has a winning strategy in a token removal game.

Uploaded by

Bikky Biraji
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/ 6

Solution to Mock contest.

Prajit Adhikari
October 25, 2022

1. Let a0 , a1 , ..., an be real numbers satisfying a0 = an = 0 and

ai+1 − 2ai + ai−1 = a2i

for i = 1, 2, ..., n − 1. Prove that ai ≤ 0 for i = 1, 2, ..., n − 1.


Solution:
Adding the expression for i = 1, 2, ....n − 1, we get,

a21 + a22 + ........ + a2n−1 = −(a1 + an−1 )

Similarly,ai+1 + ai−1 + 1 = (ai + 1)2 .....(i).


We know, a1 + an−1 ≤ 0. By equation (i) it is clear that for ai = 0 for
i = 1, ....N − 1, then all ai ’s are zero. So, we only deal with cases when
ai ’s are less than zero.
Case I: a1 < 0, then

a2 + 1 = (a1 + 1)2 =⇒ a2 < 0since, (a1 + 1)2 < 1

This implies that all ai ’s are less than 0. Case II: an−1 < 0, then,

an−1 + 1 = (an−2 + 1)2

Since, an−1 + 1 < 1 =⇒ an−2 < 1.


Using similar arguments in both cases and we get that ai ≤ 0 for i =
1, 2, ........., n − 1. QED

1
2. Suppose that for a prime number p and integers a,b,c the following holds:

6|p + 1, p|a + b + c, p|a4 + b4 + c4

. Prove that p|a, b, c.


Solution:
We have that,

a4 + b4 + c4 = ((a + b + c)2 − 2ab − 2bc − 2ca)2 − 2a2 b2 − 2b2 c2 − 2c2 a2

Since, p|a + b + c, p = 6k − 1, we have that,

p|(2ab + 2bc + 2ca)2 − 2a2 b2 − 2b2 c2 − 2c2 a2

Let, ab = x, bc = y and ca = z. Then,

p|2(x + y + z)2 − x2 − y 2 − z 2 =⇒ p|x2 + y 2 + z 2 + 4xy + 4yz + 4zx

Now,
p|a2 b2 + b2 c2 + c2 a2 + 4ab2 c + 4a2 bc + 4abc2
p|a2 b2 + b2 c2 + c2 a2 + 4abc(a + b + c) =⇒ p|x2 + y 2 + z 2
Then,

p|a4 + b4 + c4 + 2(a2 b2 + b2 c2 + c2 a2 ) =⇒ 2|(a2 + b2 + c2 )2

=⇒ p|a2 + b2 + c2 =⇒ p|ab + bc + ac =⇒ p|b(a + c) + ac


Now,
p|b(a + c) + ac − b(a + b + c) =⇒ p|ac − b2 , p|bc − a2
p|a2 + b2 + c2 + ac − b2 + bc − a2 =⇒ p|c2 + ac + bc =⇒ p|c(a + b + c)
Hence,
p|c =⇒ p|bc − a2 =⇒ p|a =⇒ p|b
. Therefore, p|a, b, c. QED

2
3. Let a be any integer. Define the sequence x0 , x1 , ... by x0 = a, x1 = 3, and
for all n > 1,
xn = 2xn−1 − 4xn−2 + 3
. Determine the largest integer ka for which there exists a prime p such
that pka divides x2011 − 1.
Solution:
Let, yn = xn − 1 be a sequence. Then,

yn = 2yn−1 − 4yn−2

Using above identity, we get,

yn = 2(2yn−2 − 4yn−3 ) − 4yn−2 =⇒ yn = −8yn−3

Since n was arbitrarily chosen, we have that for any {n, n − 1, n − 2}


divisible by three, the above statement must apply. So, for m divisible by
3, we get,
ym = (−1)m 2m y0 =⇒ 2m |y m . Hence, for m = 2011, we have that
greatest ka which divides a2011 − 1 is 2011 .

3
4. (a) Show that the equation bxc(x2 +1) = x3 , where bxc denotes the largest
integer not larger than x, has exactly one real solution in each interval be-
tween consecutive positive integers.
(b) Show that none of the positive real solutions of this equation is ratio-
nal.
Solution:
(a). Let, bxc = x + {x}, where {x} is the fractional part of the number.
Suppose, {x} = m and bxc = k.
Then, x = m + k, now, (x − {x})(x2 + 1) = x3 =⇒ x = m(x2 + 1) =⇒
m + k = m(m + k)2 + m =⇒ k = m(m + k)2 .
For an interval (k, k+1), we see that the above function in m is monotonous
for increasing positive interval. Hence, for k → k + 1, we have that
(m + 1)(m + k + 1)2 > k whereas m(m + k) < k, since m < 1 and
m 6= 0. Finally, we see by mean value theorem that there exists a m for
every interval (k, k + 1), so there is exactly one solution as the function is
also increasing monotonously.

p
(b). Let, x = q such that gcd(p, q) = 1. then we have,

kq(p2 + q 2 ) = p3

Since, k, p, q ∈ Z, we have, q|p3 =⇒ gcd(p, q) 6= 1, which is absurd. So,


there is no rational solution. QED.

4
5. Let O be the circumcenter of the triangle ABC. The segment XY is the
diameter of the circumcircle perpendicular to BC and it meets BC at M.
The point X is closer to M than Y and Z is the point on MY such that
MZ = MX. The point W is the midpoint of AZ. a) Show that W lies on
the circle through the midpoints of the sides of ABC; b) Show that MW
is perpendicular to AY.
Solution:
(a). Let, P and Q be midpoints of sides of triangle ABC. Then, since,
BX k CZ and ABCD is cyclic, we have, ∠BXC = ∠BZC = ∠B + ∠C,
then, by angle chasing considering WN as median of triangle ABZ, we get
that,
∠N W P = ∠B + ∠C = ∠BXC. So, M P W N is cyclic and W lies in the
nine point circle(from inspection).
(b). Since M is midpoint of XZ and AZ and AY is perpendicular to XY ,
being diameter, we get that ∠M W A = 90o . QED

5
6. Two players play the following game. At the outset there are two piles,
containing 10,000 and 20,000 tokens,respectively . A move consists of re-
moving any positive number of tokens from a single pile or removing x
¿ 0 tokens from one pile and y ¿ 0 tokens from the other , where x+y
is divisible by 2015. The player who can not make a move loses. Which
player has a winning strategy?
Solution:

The player who chooses first has winning strategy. He just needs to pick
up x = 9105 and y = 19105 from both piles such that x + y is divisible by
2015, leaving the second player with 1790 coins altogether and no choice.
So, the first player wins the game.

You might also like