David has some pennies. One apple costs $3$ pennies, one banana costs $5$ pennies, and one cranberry costs $7$ pennies. If David spends all his money on apples, he will have $2$ pennies left; if David spends all his money on bananas, he will have $3$ pennies left; is David spends all his money on cranberries, he will have $2$ pennies left. What is the least possible amount of pennies that David can originally have?

The sequence of integers $a_1,a_2,a_3 ,.. $such that $a_1 = 1$, $a_2 = 2$ and for every natural $n \ge 1$ $$a_{n+2}=\begin{cases} 2001a_{n+1} - 1999a_n , \text{\,\,if\,\,the\,\,product\,\,} a_{n+1}a_n \text{is\,\,an\,\,even\,\,number} /\\ a_{n+1}-a_n , \text{\,\,if\,\,the\,\,product\,\,} a_{n+1}a_n \text{is\,\,an\,\,odd\,\,number} \end{cases}$$ Is there such a natural $m$ that $a_m= 2000$?

On the sides $AB, BC$ and $CA$ of a triangle $ABC$ are located the points $P, Q$ and $R$ respectively, such that $BQ = 2QC, CR = 2RA$ and $\angle PRQ = 90^o$. Show that $\angle APR =\angle RPQ$.

(a) Write $A = k^4 + 4$, where $k$ is a positive integer, as a product of two factors each of them is sum of two squares of integers. (b) Simplify the expression$$K=\frac{(2^4+\frac14)(4^4+\frac14)...((2n)^4+\frac14)}{(1^4+\frac14)(3^4+\frac14)...((2n-1)^4+\frac14)}$$and write it as sum of squares of two consecutive positive integers

Determine all positive integers $n$ such that the decimal representation of the number $6^n + 1$ has all its digits the same.

There're $n$ students whose names are different from each other. Everyone has $n-1$ envelopes initially with the others' name and address written on them respectively. Everyone also has at least one greeting card with her name signed on it. Everyday precisely a student encloses a greeting card (which can be the one received before) with an envelope (the name on the card and the name on envelope cannot be the same) and post it to the appointed student by a same day delivery. Prove that when no one can post the greeting cards in this way any more: (i) Everyone still has at least one card; (ii) If there exist $k$ students $p_1, p_2, \cdots, p_k$ so that $p_i$ never post a card to $p_{i+1}$, where $i = 1,2, \cdots, k$ and $p_{k+1} = p_1$, then these $k$ students have prepared the same number of greeting cards initially.

Some cities in country are connected with oneway road. It is known that every closed cyclic route, that don`t break traffic laws, consists of even roads. Prove that king of city can place military bases in some cities such that there are not roads between these cities, but for every city without base we can go from city with base by no more than $1$ road. [hide=PS]I think it should be one more condition, like there is cycle that connect all cities [/hide]

Denote by $M$ and $N$ feets of perpendiculars from $A$ to angle bisectors of exterior angles at $B$ and $C,$ in triangle $\triangle ABC.$ Prove that the length of segment $MN$ is equal to semiperimeter of triangle $\triangle ABC.$

There are $2019$ coins on a table. Some are placed with head up and others tail up. A group of $2019$ persons perform the following operations: the first person chooses any one coin and then turns it over, the second person choses any two coins and turns them over and so on and the $2019$-th person turns over all the coins. Prove that no matter which sides the coins are up initially, the $2019$ persons can come up with a procedure for turning the coins such that all the coins have smae side up at the end of the operations.

Let $ABC$ be an acute triangle. Define $A_1$ the midpoint of the largest arc $BC$ of the circumcircle of $ABC$ . Let $A_2$ and $A_3$ be the feet of the perpendiculars from $A_1$ on the lines $AB$ and $AC$ , respectively. Define $B_1$, $B_2$, $B_3$, $C_1$, $C_2$, and $C_3$ analogously. Show that the lines $A_2A_3$, $B_2B_3$, $C_2C_3$ are concurrent.

Let $D, E$, and $F$ be respectively the midpoints of the sides $BC, CA$, and $AB$ of $\vartriangle ABC$. Let $H_a, H_b, H_c$ be the feet of perpendiculars from $A, B, C$ to the opposite sides, respectively. Let $P, Q, R$ be the midpoints of the $H_bH_c, H_cH_a$, and $H_aH_b$ respectively. Prove that $PD, QE$, and $RF$ are concurrent.

For all primes $p \geq 3,$ define $F(p) = \sum^{\frac{p-1}{2}}_{k=1}k^{120}$ and $f(p) = \frac{1}{2} - \left\{ \frac{F(p)}{p} \right\}$, where $\{x\} = x - [x],$ find the value of $f(p).$

All points in a $100 \times 100$ array are colored in one of four colors red, green, blue or yellow in such a way that there are $25$ points of each color in each row and in any column. Prove that there are two rows and two columns such that their four intersection points are all in different colors.

For $n \in \mathbb{N}$, consider in $\mathbb{R}^3$ the regular tetrahedron with vertices $O(0, 0, 0)$, $A(n, 9n, 4n)$, $B(9n, 4n, n)$ and $C(4n, n, 9n)$. Show that the number $N$ of points $(x, y, z)$, $[x, y, z \in \mathbb{Z}]$ inside or on the boundary of the tetrahedron $OABC$ is given by$$N=\frac{343n^3}{3}+\frac{35n^2}{2}+\frac{7n}{6}+1$$

The set of real numbers $ x$ for which \[ \frac{1}{x\minus{}2009}\plus{}\frac{1}{x\minus{}2010}\plus{}\frac{1}{x\minus{}2011}\ge 1\] is the union of intervals of the form $ a<x\le b$. What is the sum of the lengths of these intervals? $ \textbf{(A)}\ \frac{1003}{335} \qquad \textbf{(B)}\ \frac{1004}{335} \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ \frac{403}{134} \qquad \textbf{(E)}\ \frac{202}{67}$

Let $a, b$ and $c$ be pairwise different natural numbers. Prove $\frac{a^3 + b^3 + c^3}{3} \ge abc + a + b + c$. When does equality holds? (Karl Czakler)

Find all polynomials $f(x)$ with integer coefficients and leading coefficient equal to 1, for which $f(0)=2010$ and for each irrational $x$, $f(x)$ is also irrational.

Let $I \subset \mathbb{R}$ be a nondegenerate interval and $f:I \to \mathbb{R}$ a differentiable function. We denote $J= \left\{ \frac{f(b)-f(a)}{b-a} : a,b \in I, a<b \right\}.$ Prove that: $a)$ $J$ is an interval; $b)$ $J \subset f'(I),$ and the set $f'(I) \setminus J$ contains at most two elements; $c)$ Using parts $a)$ and $b),$ deduce that $f'$ has the intermediate value property.

Given a triangle $ABC$, on the side $BC$ which marked the point $E$ such that $BE \ge CE$. Construct on the sides $AB$ and $AC$ the points $D$ and $F$, respectively, such that $\angle DEF = 90 {} ^ \circ$ and the segment $BF$ is bisected by the segment $DE $. (Black Maxim)

Let $s(n)$ be the final value obtained after repeatedly summing the digits of $n$ until a single-digit number is reached. (For example: $s(187) = 7$, because the digit sum of $187$ is $16$ and the digit sum of $16$ is $7$). Evaluate the sum: $$ s(1^2) + s(2^2) + s(3^2) + \ldots + s(2025^2)$$ [i]Proposed by Lia Chitishvili, Georgia [/i]

Let $0 \leq b \leq c \leq d \leq a$ and $a>14$ are integers. Prove, that there is such natural $n$ that can not be represented as $$n=x(ax+b)+y(ay+c)+z(az+d)$$ where $x,y,z$ are some integers. [i]K. Kohas[/i]

Let $f:\mathbb{R}\to \mathbb{R}$ a function which transforms any closed bounded interval in a closed bounded interval and any open bounded interval in an open bounded interval. Prove that $f$ is continuous. [i]Mihai Piticari[/i]

Given an acute-angled triangle $ABC$ and a point $P$ inside it such that $\angle PBA=\angle PCA$. The lines $PB$ and $PC$ intersect the circumcircles of triangles $PCA$ and $PAB$ secondly at points $M$ and $N$, respectively. Let the rays $MC$ and $NB$ intersect at a point $S$, $K$ is the center of the circumscribed circle of the triangle $SMN$. Prove that the lines $AK$ and $BC$ are perpendicular.

Let $n \ge 3$ be an integer, and consider a circle with $n + 1$ equally spaced points marked on it. Consider all labellings of these points with the numbers $0, 1, ... , n$ such that each label is used exactly once; two such labellings are considered to be the same if one can be obtained from the other by a rotation of the circle. A labelling is called [i]beautiful[/i] if, for any four labels $a < b < c < d$ with $a + d = b + c$, the chord joining the points labelled $a$ and $d$ does not intersect the chord joining the points labelled $b$ and $c$. Let $M$ be the number of beautiful labelings, and let N be the number of ordered pairs $(x, y)$ of positive integers such that $x + y \le n$ and $\gcd(x, y) = 1$. Prove that $$M = N + 1.$$

How many distinct real numbers $x$ satisfy the equation $4\cos^3(x)+\sqrt{x}=3\sin(x)+\cos(3x)$?