Found problems: 1782
Let $A\in M_4(C)$ be a non-zero matrix.
$a)$ If $\text{rank}(A)=r<4$, prove the existence of two invertible matrices $U,V\in M_4(C)$, such that:
\[UAV=\begin{pmatrix}I_r&0\\0&0\end{pmatrix}\]
where $I_r$ is the $r$-unit matrix.
$b)$ Show that if $A$ and $A^2$ have the same rank $k$, then the matrix $A^n$ has rank $k$, for any $n\ge 3$.
Let $n$ be a positive integer, set $S_n = \{ (a_1,a_2,\cdots,a_{2^n}) \mid a_i=0 \ \text{or} \ 1, 1 \leq i \leq 2^n\}$. For any two elements $a=(a_1,a_2,\cdots,a_{2^n})$ and $b=(b_1,b_2,\cdots,b_{2^n})$ of $S_n$, define
\[ d(a,b)= \sum_{i=1}^{2^n} |a_i - b_i| \]
We call $A \subseteq S_n$ a $\textsl{Good Subset}$ if $d(a,b) \geq 2^{n-1}$ holds for any two distinct elements $a$ and $b$ of $A$. How many elements can the $\textsl{Good Subset}$ of $S_n$ at most have?
Let $n>2$ be an integer. Suppose that $a_{1},a_{2},...,a_{n}$ are real numbers such that $k_{i}=\frac{a_{i-1}+a_{i+1}}{a_{i}}$ is a positive integer for all $i$(Here $a_{0}=a_{n},a_{n+1}=a_{1}$). Prove that $2n\leq a_{1}+a_{2}+...+a_{n}\leq 3n$.
Let be $n$ positive integer than calculate:
$1\cdot 1!+2\cdot2!+...+n\cdot n!$
The sequence $a_{n}$ defined as follows: $a_{1}=4, a_{2}=17$ and for any $k\geq1$ true equalities
$a_{2k+1}=a_{2}+a_{4}+...+a_{2k}+(k+1)(2^{2k+3}-1)$
$a_{2k+2}=(2^{2k+2}+1)a_{1}+(2^{2k+3}+1)a_{3}+...+(2^{3k+1}+1)a_{2k-1}+k$
Find the smallest $m$ such that $(a_{1}+...a_{m})^{2012^{2012}}-1$ divided $2^{2012^{2012}}$
Suppose that $f : \mathbb{N} \rightarrow \mathbb{N}$ is a function for which the expression $af(a)+bf(b)+2ab$ for all $a,b \in \mathbb{N}$ is always a perfect square. Prove that $f(a)=a$ for all $a \in \mathbb{N}$.
Let $M$ be a positive integer. At a party with 120 people, 30 wear red hats, 40 wear blue hats, and 50 wear green hats. Before the party begins, $M$ pairs of people are friends. (Friendship is mutual.) Suppose also that no two friends wear the same colored hat to the party.
During the party, $X$ and $Y$ can become friends if and only if the following two conditions hold:
[list] [*] There exists a person $Z$ such that $X$ and $Y$ are both friends with $Z$. (The friendship(s) between $Z,X$ and $Z,Y$ could have been formed during the party.) [*] $X$ and $Y$ are not wearing the same colored hat. [/list]
Suppose the party lasts long enough so that all possible friendships are formed. Let $M_1$ be the largest value of $M$ such that regardless of which $M$ pairs of people are friends before the party, there will always be at least one pair of people $X$ and $Y$ with different colored hats who are not friends after the party. Let $M_2$ be the smallest value of $M$ such that regardless of which $M$ pairs of people are friends before the party, every pair of people $X$ and $Y$ with different colored hats are friends after the party. Find $M_1+M_2$.
[hide="Clarifications"]
[list]
[*] The definition of $M_2$ should read, ``Let $M_2$ be the [i]smallest[/i] value of $M$ such that...''. An earlier version of the test read ``largest value of $M$''.[/list][/hide]
[i]Victor Wang[/i]
Freddy writes down numbers $1, 2,\ldots ,n$ in some order. Then he makes a list of all pairs $(i, j)$ such that $1\le i<j\le n$ and the $i$-th number is bigger than the $j$-th number in his permutation. After that, Freddy repeats the following action while possible: choose a pair $(i, j)$ from the current list, interchange the $i$-th and the $j$-th number in the current permutation, and delete $(i, j)$ from the list. Prove that Freddy can choose pairs in such an order that, after the process finishes, the numbers in the permutation are in ascending order.
Let $ S$ be the smallest subset of the integers with the property that $ 0\in S$ and for any $ x\in S$, we have $ 3x\in S$ and $ 3x \plus{} 1\in S$. Determine the number of non-negative integers in $ S$ less than $ 2008$.
Let $m$ and $n$ be integers greater than 1. Prove that $\left\lfloor \dfrac{mn}{6} \right\rfloor$ non-overlapping 2-by-3 rectangles can be placed in an $m$-by-$n$ rectangle. Note: $\lfloor x \rfloor$ means the greatest integer that is less than or equal to $x$.
The set of positive nonzero real numbers are partitioned into three mutually disjoint non-empty subsets $(A\cup B\cup C)$.
a) show that there exists a triangle of side-lengths $a,b,c$, such that $a\in A, b\in B, c\in C$.
b) does it always happen that there exists a right triangle with the above property ?
Given positive integers $a,c$ and integer $b$, prove that there exists a positive integer $x$ such that
\[ a^x + x \equiv b \pmod c, \]
that is, there exists a positive integer $x$ such that $c$ is a divisor of $a^x + x - b$.
We denote $N_{2010}=\{1,2,\cdots,2010\}$
[b](a)[/b]How many non empty subsets does this set have?
[b](b)[/b]For every non empty subset of the set $N_{2010}$ we take the product of the elements of the subset. What is the sum of these products?
[b](c)[/b]Same question as the [b](b)[/b] part for the set $-N_{2010}=\{-1,-2,\cdots,-2010\}$.
Albanian National Mathematical Olympiad 2010---12 GRADE Question 2.
The director has found out that six conspiracies have been set up in his department, each of them involving exactly $3$ persons. Prove that the director can split the department in two laboratories so that none of the conspirative groups is entirely in the same laboratory.
Let $n$ be a positive integer, and let $A$ be a subset of $\{ 1,\cdots ,n\}$. An $A$-partition of $n$ into $k$ parts is a representation of n as a sum $n = a_1 + \cdots + a_k$, where the parts $a_1 , \cdots , a_k $ belong to $A$ and are not necessarily distinct. The number of different parts in such a partition is the number of (distinct) elements in the set $\{ a_1 , a_2 , \cdots , a_k \} $.
We say that an $A$-partition of $n$ into $k$ parts is optimal if there is no $A$-partition of $n$ into $r$ parts with $r<k$. Prove that any optimal $A$-partition of $n$ contains at most $\sqrt[3]{6n}$ different parts.
The Fibonacci sequence $\{F_{n}\}$ is defined by \[F_{1}=1, \; F_{2}=1, \; F_{n+2}=F_{n+1}+F_{n}.\] Show that $F_{mn}-F_{n+1}^{m}+F_{n-1}^{m}$ is divisible by $F_{n}^{3}$ for all $m \ge 1$ and $n>1$.
An $n$-term sequence $(x_1, x_2, \ldots, x_n)$ in which each term is either 0 or 1 is called a [i]binary sequence of length [/i]$n$. Let $a_n$ be the number of binary sequences of length $n$ containing no three consecutive terms equal to 0, 1, 0 in that order. Let $b_n$ be the number of binary sequences of length $n$ that contain no four consecutive terms equal to 0, 0, 1, 1 or 1, 1, 0, 0 in that order. Prove that $b_{n+1} = 2a_n$ for all positive integers $n$.
An $m \times n$ chessboard where $m \le n$ has several black squares such that no two rows have the same pattern. Determine the largest integer $k$ such that we can always color $k$ columns red while still no two rows have the same pattern.
We have a $ (n+2)\times n $ rectangle and we’ve divided it into $ n(n+2) \ \ 1\times1 $ squares. $ n(n+2) $ soldiers are standing on the intersection points ($ n+2 $ rows and $ n $ columns). The commander shouts and each soldier stands on its own location or gaits one step to north, west, east or south so that he stands on an adjacent intersection point. After the shout, we see that the soldiers are standing on the intersection points of a $ n\times(n+2) $ rectangle ($ n $ rows and $ n+2 $ columns) such that the first and last row are deleted and 2 columns are added to the right and left (To the left $1$ and $1$ to the right).
Prove that $ n $ is even.
Prove that $\sum \frac{1}{i_1i_2 \ldots i_k} = n$ is taken over all non-empty subsets $\left\{i_1,i_2, \ldots, i_k\right\}$ of $\left\{1,2,\ldots,n\right\}$. (The $k$ is not fixed, so we are summing over all the $2^n-1$ possible nonempty subsets.)
A calculator is broken so that the only keys that still work are the $ \sin$, $ \cos$, and $ \tan$ buttons, and their inverses (the $ \arcsin$, $ \arccos$, and $ \arctan$ buttons). The display initially shows $ 0$. Given any positive rational number $ q$, show that pressing some finite sequence of buttons will yield the number $ q$ on the display. Assume that the calculator does real number calculations with infinite precision. All functions are in terms of radians.
Let $P(x)=x^3-\tfrac{3}{2}x^2+x+\tfrac{1}{4}$. Let $P^{[1]}(x)=P(x)$, and for $n\ge1$, let $P^{n+1}(x)=P^{[n]}(P(x))$. Evaluate: \[ \displaystyle\int_{0}^{1} P^{[2004]} (x) \ \mathrm{d}x. \]
Assume $n$ is a positive integer. Considers sequences $a_0, a_1, \ldots, a_n$ for which $a_i \in \{1, 2, \ldots , n\}$ for all $i$ and $a_n = a_0$.
(a) Suppose $n$ is odd. Find the number of such sequences if $a_i - a_{i-1} \not \equiv i \pmod{n}$ for all $i = 1, 2, \ldots, n$.
(b) Suppose $n$ is an odd prime. Find the number of such sequences if $a_i - a_{i-1} \not \equiv i, 2i \pmod{n}$ for all $i = 1, 2, \ldots, n$.
Positive integers $x_1, x_2, \dots, x_n$ ($n \ge 4$) are arranged in a circle such that each $x_i$ divides the sum of the neighbors; that is \[ \frac{x_{i-1}+x_{i+1}}{x_i} = k_i \] is an integer for each $i$, where $x_0 = x_n$, $x_{n+1} = x_1$. Prove that \[ 2n \le k_1 + k_2 + \dots + k_n < 3n. \]
Find all bounded sequences $(a_n)_{n=1}^\infty$ of natural numbers such that for all $n \ge 3$, \[ a_n = \frac{a_{n-1} + a_{n-2}}{\gcd(a_{n-1}, a_{n-2})}. \]