Scribd
Upload
182 views2 pages

Problem Set For IMOTC 27-3-23

This document contains 11 math problems posed at various competitions: 1) Show that for any 2n-1 sequences of 0s and 1s of length n, there exists a unique integer k such that the kth term of all sequences is 1. 2) Find the arithmetic mean value of αX , where αX is the sum of the greatest and smallest numbers in any nonempty subset X of the set {1,2,...,1000}. 3) Find the smallest positive integer n such that among any n irrational numbers, there exist 3 whose sum of any 2 is also irrational. 4) Prove that for 8 points on a circle with diameter pn, there exists a triangle with vertices

Uploaded by

ghanesh253
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
182 views2 pages

Problem Set For IMOTC 27-3-23

This document contains 11 math problems posed at various competitions: 1) Show that for any 2n-1 sequences of 0s and 1s of length n, there exists a unique integer k such that the kth term of all sequences is 1. 2) Find the arithmetic mean value of αX , where αX is the sum of the greatest and smallest numbers in any nonempty subset X of the set {1,2,...,1000}. 3) Find the smallest positive integer n such that among any n irrational numbers, there exist 3 whose sum of any 2 is also irrational. 4) Prove that for 8 points on a circle with diameter pn, there exists a triangle with vertices

Uploaded by

ghanesh253
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

IMOTC - 27 March 2023

March 27, 2023

1. Suppose that there are 2n−1 n-term sequences in which each term is 0 or
1 . If for any three these sequences, there exists a positive integer p sukh
that the pth terms of them all are 1 . Show that there exists an unique
positive integer k such that the k th terms of these 2n−1 sequences are all
1. ( 32nd Moscow Mathematical Olympiad in 1969)
2. There is a set M = {1, 2, . . . , 1000}. For any nonempty X of M , let
αX denote the sum of the greatest number and the smallest number in X.
Then the arithmetic mean value of all αX is equal to (China Mathematical
Competition in1991)
3. Find the smallest positive integer n such that among any n irrational
numbers, there exist 3 irrational numbers such that the sum of any two
of them is an irrational number, too.

4. Let p be an odd prime and n a positive integer. In the coordinate plane,


eight distinct points with integer coordinates lie on a circle with diameter
of length pn . Prove that there exists a triangle with vertices at three of the
given points such that the squares of its side lengths are integers divisible

1
by pn+1 .
Proposed by Alexander Ivanov, Bulgaria
5. For which integers n ≥ 5 is it possible to color the vertices of a regular
n-sided polygon using at most 6 colors such that any 5 consecutive vertices
have different colors? (2000 Austrian - Polish Mathematical Olympiad)

6. Every cell of a 100X100 board is colored with one of 4 colors so that there
exactly 25 cells of each color in every column and in every row. Prove that
one can choose two columns and two rows so that the four cells where they
intersect are colored in four different colors. (26th Russian Mathematical
Olympiad in 2000)

7. Let A1 A2 . . . An be a regular polygon that has an odd number of sides.


Let M be a point on the minor arc A1 An of the circle circumscribed about
it. Prove that the sum of the distances from the point M to the vertices
Ai (i being odd) is equal to the sum of the distances from the point M to
the vertices Ak (k being even ).

8. Let n ≡ 1(mod4) and n > 1, and P = {a1 , a2 , . . . , an } be any permuta-


tion of {1, 2, . . . , n}, and let kp denote the largest subscript k satisfying
the following condition:

a1 + a2 + · · · + ak < ak+1 + ak+2 + · · · + an .

For all permutations P , find the sum of all the corresponding largest sub-
script kp .
9. (Kvant) Let p and q be integers greater than 1. Assume that p | q 3 − 1
and q | p − 1. Prove that p = q 3/2 + 1 or p = q 2 + q + 1

10. Let a1 , . . . , an be positive integers and let a > 1 be a multiple of a1 a2 . . . an .


Prove that an+1 +a−1 is not divisible by (a + a1 − 1) (a + a2 − 1) . . . (a + an − 1)

11. Assume that there are n points in space, no four points of which are
coplanar and there are q line segments connecting these n points. Prove
4q 2
that there exist at least 3n (q − n4 ) triangles which consist of these line
segments.

You might also like