Find the minimum positive integer $k$ such that there exists a function $f$ from the set $\Bbb{Z}$ of all integers to $\{1, 2, \ldots k\}$ with the property that $f(x) \neq f(y)$ whenever $|x-y| \in \{5, 7, 12\}$.

Lisa writes a positive whole number in the decimal system on the blackboard and now makes in each turn the following: The last digit is deleted from the number on the board and then the remaining shorter number (or 0 if the number was one digit) becomes four times the number deleted number added. The number on the board is now replaced by the result of this calculation. Lisa repeats this until she gets a number for the first time was on the board. (a) Show that the sequence of moves always ends. (b) If Lisa begins with the number $53^{2022} - 1$, what is the last number on the board? Example: If Lisa starts with the number $2022$, she gets $202 + 4\cdot 2 = 210$ in the first move and overall the result $$2022 \to 210 \to 21 \to 6 \to 24 \to 18 \to 33 \to 15 \to 21$$. Since Lisa gets $21$ for the second time, the turn order ends. [i](Stephan Pfannerer)[/i]

Given two non-negative integers $m>n$, let's say that $m$ [i]ends in[/i] $n$ if we can get $n$ by erasing some digits (from left to right) in the decimal representation of $m$. For example, 329 ends in 29, and also in 9. Determine how many three-digit numbers end in the product of their digits.

A sequence of positive real numbers $a_1, a_2, \dots$ is called $\textit{phine}$ if it satisfies $$a_{n+2}=\frac{a_{n+1}+a_{n-1}}{a_n},$$ for all $n\geq2$. Is there a $\textit{phine}$ sequence such that, for every real number $r$, there is some $n$ for which $a_n>r$?

[b]Problem 3.[/b] Let $n\geq 3$ is given natural number, and $M$ is the set of the first $n$ primes. For any nonempty subset $X$ of $M$ with $P(X)$ denote the product of its elements. Let $N$ be a set of the kind $\ds\frac{P(A)}{P(B)}$, $A\subset M, B\subset M, A\cap B=\emptyset$ such that the product of any 7 elements of $N$ is integer. What is the maximal number of elements of $N$? [i]Alexandar Ivanov[/i]

There are an even number of points in a plane. No three of them lie on one straight line. Half of the points are red, the other half are blue. Prove that there exists a connecting line of a red and a blue point such that in each of the half-planes bounded by that line the number of red points is equal to the number of blue points.

Find for every value of $n$ a set of numbers $p$ for which the following statement is true: Any convex $n$-gon can be divided into $p$ isosceles triangles.

Given a circle $k$ and two points $A$ and $B$ outside the circle. Specify how to can construct a circle with a compass and ruler, so that $A$ and $B$ lie on that circle and that circle is tangent to $k$.

Let $ ABCD$ be a trapezoid with parallel sides $ AB > CD$. Points $ K$ and $ L$ lie on the line segments $ AB$ and $ CD$, respectively, so that $AK/KB=DL/LC$. Suppose that there are points $ P$ and $ Q$ on the line segment $ KL$ satisfying \[\angle{APB} \equal{} \angle{BCD}\qquad\text{and}\qquad \angle{CQD} \equal{} \angle{ABC}.\] Prove that the points $ P$, $ Q$, $ B$ and $ C$ are concyclic. [i]Proposed by Vyacheslev Yasinskiy, Ukraine[/i]

Determine the number of positive divisors of $2008^8$ that are less than $2008^4$.

Show that for each natural number $n$, there exist $n$ distinct natural numbers whose sum is a square and whose product is a cube.

A point is chosen on each side of a regular $2009$-gon. Let $S$ be the area of the $2009$-gon with vertices at these points. For each of the chosen points, reflect it across the midpoint of its side. Prove that the $2009$-gon with vertices at the images of these reflections also has area $S.$ [i](4 points)[/i]

Suppose that the function $f: Z \to Z$ can be written in the form $f = g_1+...+g_k$ , where $g_1,. . . , g_k: Z \to R$ are real-valued periodic functions, with period $a_1,...,a_k$. Does it follow that f can be written in the form $f = h_1 +. . + h_k$ , where $h_1,. . . , h_k: Z \to Z$ are periodic functions with integer values, also with period $a_1,...,a_k$?

A standard six-sided fair die is rolled four times. The probability that the product of all four numbers rolled is a perfect square is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

$ 30$ persons are sitting at round table. $ 30 \minus{} N$ of them always speak true ("true speakers") while the other $ N$ of them sometimes speak true sometimes not ("lie speakers"). Question: "Who is your right neighbour - "true speaker" or "lie speaker" ?" is asked to all 30 persons and 30 answers are collected. What is maximal number $ N$ for which (with knowledge of these answers) we can always be sure (decide) about at least one person who is "true speaker".

$ABC$ is a triangle. Show that $c \ge (a+b) \sin \frac{C}{2}$

Given a natural number $n$, call a divisor $d$ of $n$ to be $\textit{nontrivial}$ if $d>1$. A natural number $n$ is $\textit{good}$ if one or more distinct nontrivial divisors of $n$ sum up to $n-1$. Prove that every natural number $n$ has a multiple that is good.

An unfair coin has the property that when flipped four times, it has the same nonzero probability of turning up $2$ heads and $2$ tails (in any order) as $3$ heads and $1$ tail (in any order). What is the probability of getting a head in any one flip?

There exist two triples of real numbers $(a,b,c)$ such that $a-\frac{1}{b}, b-\frac{1}{c}, c-\frac{1}{a}$ are the roots to the cubic equation $x^3-5x^2-15x+3$ listed in increasing order. Denote those $(a_1, b_1, c_1)$ and $(a_2, b_2, c_2)$. If $a_1$, $b_1$, and $c_1$ are the roots to monic cubic polynomial $f$ and $a_2, b_2$, and $c_2$ are the roots to monic cubic polynomial $g$, find $f(0)^3+g(0)^3$

Let $n \geq 2$ be a natural. Define $$X = \{ (a_1,a_2,\cdots,a_n) | a_k \in \{0,1,2,\cdots,k\}, k = 1,2,\cdots,n \}$$. For any two elements $s = (s_1,s_2,\cdots,s_n) \in X, t = (t_1,t_2,\cdots,t_n) \in X$, define $$s \vee t = (\max \{s_1,t_1\},\max \{s_2,t_2\}, \cdots , \max \{s_n,t_n\} )$$ $$s \wedge t = (\min \{s_1,t_1 \}, \min \{s_2,t_2,\}, \cdots, \min \{s_n,t_n\})$$ Find the largest possible size of a proper subset $A$ of $X$ such that for any $s,t \in A$, one has $s \vee t \in A, s \wedge t \in A$.

Given points $A,B,C$ and $D$ lie a circle. $AC\cap BD=K$. $I_1, I_2,I_3$ and $I_4$ incenters of $ABK,BCK,CDK,DKA$. $M_1,M_2,M_3,M_4$ midpoints of arcs $AB,BC,CA,DA$ . Then prove that $M_1I_1,M_2I_2,M_3I_3,M_4I_4$ are concurrent.

Compute \[\left\lfloor \dfrac{2007!+2004!}{2006!+2005!}\right\rfloor.\] (Note that $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$.)

Let $a, b, c$ be positive real numbers such that $a + b + c = 1$. If $n$ is a positive integer then prove that \[ \frac{(3a)^n}{(b + 1)(c + 1)} + \frac{(3b)^n}{(c + 1)(a + 1)} + \frac{(3c)^n}{(a + 1)(b + 1)} \ge \frac{27}{16} \,. \]

Let $n\geq 2$ be an integer and let $a_1, a_2, \ldots, a_n$ be positive real numbers with sum $1$. Prove that $$\sum_{k=1}^n \frac{a_k}{1-a_k}(a_1+a_2+\cdots+a_{k-1})^2 < \frac{1}{3}.$$

Let $n \geq 2$ be a positive integer. At the center of a circular garden is a guard tower. On the outskirt of the garden there are $n$ garden dwarfs regularly spaced. In the tower are attentive supervisors. Each supervisor controls a portion of the garden delimited by two dwarfs. We say that the supervisor $A$ controls the supervisor $B$ if the region of $B$ is contained in that of $A$. Among the supervisors there are two groups: the apprentices and the teachers. Each apprentice is controlled by exactly one teachers, and controls no one, while the teachers are not controlled by anyone. The entire garden has the following maintenance costs: - One apprentice costs 1 gold per year. - One teacher costs 2 gold per year. - A garden dwarf costs 2 gold per year. Show that the garden dwarfs cost at least as much as the supervisors.