Found problems: 14842
2005 Junior Balkan Team Selection Tests - Romania, 7
A phone company starts a new type of service. A new customer can choose $k$ phone numbers in this network which are call-free, whether that number is calling or is being called. A group of $n$ students want to use the service.
(a) If $n\geq 2k+2$, show that there exist 2 students who will be charged when speaking.
(b) It $n=2k+1$, show that there is a way to arrange the free calls so that everybody can speak free to anybody else in the group.
[i]Valentin Vornicu[/i]
2019 Mathematical Talent Reward Programme, SAQ: P 2
How many $n\times n$ matrices $A$, with all entries from the set $\{0, 1, 2\}$, are there, such that for all $i=1,2,\cdots,n$ $A_{ii} > \displaystyle{\sum \limits_{j=1 j\neq i}^n} A_{ij}$ [Where $A_{ij}$ is the $(i,j)$th element of the matrix $A$]
2023 China Team Selection Test, P9
Find the largest positive integer $m$ which makes it possible to color several cells of a $70\times 70$ table red such that [list] [*] There are no two red cells satisfying: the two rows in which they are have the same number of red cells, while the two columns in which they are also have the same number of red cells; [*] There are two rows with exactly $m$ red cells each. [/list]
1988 IMO Longlists, 68
In a group of $n$ people, each one knows exactly three others. They are seated around a table. We say that the seating is $perfect$ if everyone knows the two sitting by their sides. Show that, if there is a perfect seating $S$ for the group, then there is always another perfect seating which cannot be obtained from $S$ by rotation or reflection.
2004 Regional Olympiad - Republic of Srpska, 3
An $8\times8$ chessboard is completely tiled by $2\times1$ dominoes. Prove that we can place positive integers
in all cells of the table in such a way that the sums of numbers in every domino are equal and the numbers placed
in two adjacent cells are coprime if and only if they belong to the same domino. (Two cells are called adjacent if
they have a common side.)
Well this can belong to number theory as well...
2004 Germany Team Selection Test, 3
Every point with integer coordinates in the plane is the center of a disk with radius $1/1000$.
(1) Prove that there exists an equilateral triangle whose vertices lie in different discs.
(2) Prove that every equilateral triangle with vertices in different discs has side-length greater than $96$.
[i]Radu Gologan, Romania[/i]
[hide="Remark"]
The "> 96" in [b](b)[/b] can be strengthened to "> 124". By the way, part [b](a)[/b] of this problem is the place where I used [url=http://mathlinks.ro/viewtopic.php?t=5537]the well-known "Dedekind" theorem[/url].
[/hide]
2015 Postal Coaching, Problem 2
Given $2015$ points in the plane, show that if every four of them form a convex quadrilateral then the points are the vertices of a convex $2015-$sided polygon.
2001 China Team Selection Test, 3
For a positive integer \( n \geq 6 \), find the smallest integer \( S(n) \) such that any graph with \( n \) vertices and at least \( S(n) \) edges must contain at least two disjoint cycles (cycles with no common vertices).
2010 Germany Team Selection Test, 1
For any integer $n\geq 2$, let $N(n)$ be the maxima number of triples $(a_i, b_i, c_i)$, $i=1, \ldots, N(n)$, consisting of nonnegative integers $a_i$, $b_i$ and $c_i$ such that the following two conditions are satisfied:
[list][*] $a_i+b_i+c_i=n$ for all $i=1, \ldots, N(n)$,
[*] If $i\neq j$ then $a_i\neq a_j$, $b_i\neq b_j$ and $c_i\neq c_j$[/list]
Determine $N(n)$ for all $n\geq 2$.
[i]Proposed by Dan Schwarz, Romania[/i]
MathLinks Contest 6th, 7.3
A lattice point in the Carthesian plane is a point with both coordinates integers. A rectangle minor (respectively a square minor) is a set of lattice points lying inside or on the boundaries of a rectangle (respectively square) with vertices lattice points. We assign to each lattice point a real number, such that the sum of all the numbers in any square minor is less than $1$ in absolute value. Prove that the sum of all the numbers in any rectangle minor is less than $4$ in absolute value.
1987 Tournament Of Towns, (155) 6
There are $2000$ apples , contained in several baskets. One can remove baskets and /or remove apples from the baskets. Prove that it is possible to then have an equal number of apples in each of the remaining baskets, with the total number of apples being not less than $100$ .
(A. Razborov)
2015 All-Russian Olympiad, 5
It is known that a cells square can be cut into $n$ equal figures of $k$ cells.
Prove that it is possible to cut it into $k$ equal figures of $n$ cells.
2022 Thailand TSTST, 3
An odd positive integer $n$ is called pretty if there exists at least one permutation $a_1, a_2,..., a_n$, of $1,2,...,n$, such that all $n$ sums $a_1-a_2+a_3-...+a_n$, $a_2-a_3+a_4-...+a_1$,..., $a_n-a_1+a_2-...+a_{n-1}$ are positive. Find all pretty integers.
2018 Peru Iberoamerican Team Selection Test, P8
A new chess piece named $ mammoth $ moves like a bishop l (that is, in a diagonal), but only in 3 of the 4 possible directions. Different $ mammoths $ in the board may have different missing addresses. Find the maximum number of $ mammoths $ that can be placed on an $ 8 \times 8 $ chessboard so that no $ mammoth $ can be attacked by another.
LMT Team Rounds 2021+, 11
The LHS Math Team is going to have a Secret Santa event! Nine members are going to participate, and each person must give exactly one gift to a specific recipient so that each person receives exactly one gift. But to make it less boring, no pairs of people can just swap gifts. The number of ways to assign who gives gifts to who in the Secret Santa Exchange with these constraints is $N$. Find the remainder when $N$ is divided by $1000$.
1998 Belarusian National Olympiad, 7
On the plane $n+1$ points are marked, no three of which lie on one straight line. For what natural $k$ can they be connected by segments so that for any $n$ marked points there are exactly $k$ segments with ends at these points?
1975 Bundeswettbewerb Mathematik, 4
Two brothers inherited $n$ gold pieces of the total weight $2n$. The weights of the pieces are integers, and the heaviest piece is not heavier than all the other pieces together. Show that if $n$ is even, the brother can divide the inheritance into two parts of equal weight.
2007 Romania National Olympiad, 4
a) For a finite set of natural numbers $S$, denote by $S+S$ the set of numbers $z=x+y$, where $x,y\in S$. Let $m=|S|$. Show that $|S+S|\leq \frac{m(m+1)}{2}$.
b) Let $m$ be a fixed positive integer. Denote by $C(m)$ the greatest integer $k\geq 1$ for which there exists a set $S$ of $m$ integers, such that $\{1,2,\ldots,k\}\subseteq S\cup(S+S)$. For example, $C(3)=8$, with $S=\{1,3,4\}$. Show that $\frac{m(m+6)}{4}\leq C(m) \leq \frac{m(m+3)}{2}$.
2016 Grand Duchy of Lithuania, 2
During a school year $44$ competitions were held. Exactly $7$ students won in each of the competitions. For any two competitions, there exists exactly $1$ student who won in both competitions. Is it true that there exists a student who won all of the competitions?
2009 Switzerland - Final Round, 4
Let $n$ be a natural number. Each cell of a $n \times n$ square contains one of $n$ different symbols, such that each of the symbols is in exactly $n$ cells. Show that a row or a column exists that contains at least \sqrt{n} different symbols.
2021 IMO Shortlist, C8
Determine the largest integer $N$ for which there exists a table $T$ of integers with $N$ rows and $100$ columns that has the following properties:
$\text{(i)}$ Every row contains the numbers $1$, $2$, $\ldots$, $100$ in some order.
$\text{(ii)}$ For any two distinct rows $r$ and $s$, there is a column $c$ such that $|T(r,c) - T(s, c)|\geq 2$. (Here $T(r,c)$ is the entry in row $r$ and column $c$.)
2009 Argentina Iberoamerican TST, 3
Within a group of $ 2009$ people, every two people has exactly one common friend. Find the least value of the difference between the person with maximum number of friends and the person with minimum number of friends.
1991 Vietnam National Olympiad, 1
$1991$ students sit around a circle and play the following game. Starting from some student $A$ and counting clockwise, each student on turn says a number. The numbers are $1,2,3,1,2,3,...$ A student who says $2$ or $3$ must leave the circle. The game is over when there is only one student left. What position was the remaining student sitting at the beginning of the game?
2021/2022 Tournament of Towns, P7
A checkered square of size $2\times2$ is covered by two triangles. Is it necessarily true that:
[list=a]
[*]at least one of its four cells is fully covered by one of the triangles;
[*]some square of size $1\times1$ can be placed into one of these triangles?
[/list]
[i]Alexandr Shapovalov[/i]
2002 Junior Balkan Team Selection Tests - Romania, 2
We are given $n$ circles which have the same center. Two lines $D_1,D_2$ are concurent in $P$, a point inside all circles. The rays determined by $P$ on the line $D_i$ meet the circles in points $A_1,A_2,...,A_n$ and $A'_1, A'_2,..., A'_n$ respectively and the rays on $D_2$ meet the circles at points $B_1,B_2, ... ,B_n$ and $B'_2, B'_2 ..., B'_n$ (points with the same indices lie on the same circle). Prove that if the arcs $A_1B_1$ and $A_2B_2$ are equal then the arcs $A_iB_i$ and $A'_iB'_i$ are equal, for all $i = 1,2,... n$.