Scribd
Upload
146 views2 pages

INMO-Practice Assignment-4

INMO-Practice Assignment-4

Uploaded by

bhanupratapsinghhada.fac
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
146 views2 pages

INMO-Practice Assignment-4

INMO-Practice Assignment-4

Uploaded by

bhanupratapsinghhada.fac
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

INMO-2019 WORKSHOP

PRACTICE ASSIGNMENT-4

(Combinatorics, Miscellaneous)
1. Some 46 squares are randomly chosen from a 9 × 9 chess board and are coloured red. Show that
there exists a 2 × 2 block of 4 squares of which at least three are coloured red.
2. Let  = (a1, a2, a3, …, an) be a permutation of (1, 2, 3, …, n). A pair (ai, aj) is said to correspond to an
inversion of , if i < j but ai > aj. (Example: In the permutation (2, 4, 5, 3, 1), there are 6 inversions
corresponding to the pairs (2, 1), (4, 3), (4, 1), (5, 3), (5, 1), (3, 1).) How permutations of (1, 2, 3,… n),
(n  3), have exactly two inversions?
3. All the points in the plane are coloured using three colours. Prove that there exists a triangle with
vertices having the same colour such that either it is isosceles or its angles are in geometric
progression.
4. How many 6-tuples (a1, a2, a3, a4, a5, a6) are there such that each of a1, a2, a3, a4, a5, a6 is from the
set {1, 2, 3, 4} and the six expressions
a 2j  a j a j  1  a 2j  1
For j = 1, 2, 3, 4, 5, 6 (where a7 is to be taken as a1) are all equal to one another?
5. Define a sequence an n  0 by a0 = 0, a1 = 1 and an = 2an – 1 + an – 2, For n  2.

(a) For every m > 0 and 0  j  m, prove that 2am divides am + j + (–1)jam – j.
(b) Suppose 2k divides n for some natural numbers n and k. Prove that 2k divides an.
6. Suppose five of the nine vertices of a regular nine-sided polygon are arbitrarily chosen. Show that
one can select four among these five such that they are the vertices of a trapezium.
7. Find all functions f : R  R such that
2 2
f(x + y) f(x – y) = (f(x) + f(y)) – 4x f(y),
for all x, y  R, where R denotes the set of all real numbers.
8. Define a sequence f0  x  , f1  x  , f2  x  , .... of functions by
2
f0(x) = 1, f1(x) = x, (fn(x)) – 1 = fn + 1(x)fn – 1(x), for n  1.
Prove that each fn(x) is a polynomial with integer coefficients.
9. Let ABC be a triangle. An interior point P of ABC is said to be good if we can find exactly 27 rays
emanating from P intersecting the sides of the triangle ABC such that the triangle is divided by these
rays into 27 smaller triangles of equal area. Determine the number of good points for a given triangle
ABC.
10. Let f : Z  Z be a function satisfying f(0)  0, f(1) = 0 and
(i) f(xy) + f(x)f(y) = f(x) + f(y);
(ii) (f(x – y) – f(0))f(x)f(y) = 0,

1
For all x, y  Z, simultaneously.
(a) Find the set of all possible values of the function f.
(b) If f 10   0 and f(2) = 0, find the set of all integers n such that f  n   0
11. Let n be a natural number and X = {1, 2, …, n}. For subsets A and B of X we define AB to be the set
of all those elements of X which belong to exactly one of A and B. Let F be a collection of subsets of
X such that for any two distinct elements A and B in F the set AB has at least two elements. Show
that F has at most 2n – 1 elements. Find all such collections F with 2n – 1 elements.
12. Find all real functions f from R  R satisfying the relation
f  x 2  yf  x    xf  x  y  .
13. There are four basket-ball players A, B, C, D. Initially, the ball is with A. The ball is always passed
from one person to a different person. In how many ways can the ball come back to A after seven
passes? (For example A  C  B  D  A  B  C  A and A  D  A  D  C  A  B  A
are two ways in which the ball can come back to A after seven passes.)
14. Let N denote the set of all natural numbers. Define a function T : N  N by T(2k) = k and T(2k + 1) =
2k + 2. We write T2(n) = T(T(n)) and in general Tk(n) = Tk – 1(T(n)) for any k > 1.
(i) Show that for each n  N, there exists k such that Tk(n) = 1.
(ii) For k  N, let Ck denote the number of elements in the set {n : Tk(n) = 1}. Prove that Ck + 2 = Ck + 1
+ Ck, for k  1.
15. Suppose 2016 points of the circumference of a circle are coloured red and the remaining points are
coloured blue. Given any natural number n  3, prove that there is a regular n-sided polygon all of
whose vertices are blue.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy