Let $P$ denote the set of all ordered pairs $ \left(p,q\right)$ of nonnegative integers. Find all functions $f: P \rightarrow \mathbb{R}$ satisfying \[ f(p,q) \equal{} \begin{cases} 0 & \text{if} \; pq \equal{} 0, \\ 1 \plus{} \frac{1}{2} f(p+1,q-1) \plus{} \frac{1}{2} f(p-1,q+1) & \text{otherwise} \end{cases} \] Compare IMO shortlist problem 2001, algebra A1 for the three-variable case.

Let $ABC$ be a triangle with incenter $I$, and suppose that $AI$, $BI$, and $CI$ intersect $BC$, $CA$, and $AB$ at $D$, $E$, and $F$, respectively. Let the circumcircles of $BDF$ and $CDE$ intersect at $D$ and $P$, and let $H$ be the orthocenter of $DEF$. Prove that $HI=HP$.

Let $ G $ be the center of mass of a triangle $ ABC, $ and the points $ M,N,P $ on the segments $ AB,BC, $ respectively, $ CA $ (excluding the extremities) such that $$ \frac{AM}{MB} =\frac{BN}{NC} =\frac{CP}{PA} . $$ $ G_1,G_2,G_3 $ are the centers of mass of the triangles $ AMP, BMN, $ respectively, $ CNP. $ Pove that: [b]a)[/b] The centers of mas of $ ABC $ and $ G_1G_2G_3 $ are the same. [b]b)[/b] For any planar point $ D, $ the inequality $$ 3\cdot DG< DG_1+DG_2+DG_3<DA+DB+DC $$ holds.

An ant makes a sequence of moves on a cube where a move consists of walking from one vertex to an adjacent vertex along an edge of the cube. Initially the ant is at a vertex of the bottom face of the cube and chooses one of the three adjacent vertices to move to as its first move. For all moves after the first move, the ant does not return to its previous vertex, but chooses to move to one of the other two adjacent vertices. All choices are selected at random so that each of the possible moves is equally likely. The probability that after exactly 8 moves that ant is at a vertex of the top face on the cube is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n.$

A sequence with first two terms equal $1$ and $24$ respectively is defined by the following rule: each subsequent term is equal to the smallest positive integer which has not yet occurred in the sequence and is not coprime with the previous term. Prove that all positive integers occur in this sequence.

Suppose that there are 100 seats in a saloon for 100 students. All students except one know their seat. First student (which is the one who doesn't know his seat) comes to the saloon and sits randomly somewhere. Then others enter the saloon one by one. Every student that enters the saloon and finds his seat vacant, sits there and if he finds his seat occupied he sits somewhere else randomly. Find the probability that last two students sit on their seats.

Let $n$ be a positive integer. If $r\hspace{0.25mm} \equiv \hspace{1mm} n\hspace{1mm} (mod\hspace{1mm} 2)$ and $r\hspace{0.10mm} \in \hspace{0.10mm} \{ 0,\hspace{0.10mm} 1 \} $, find the number of integer solutions to the system of equations $\left\{\begin{array}{l}x+y+z = r \\ \mid x \mid + \mid y \mid + \mid z \mid = n \end{array}\right.$

Find all non-negative integers $x, y$ such that\[x^3y+x+y=xy+2xy^2\]

$A$ -is $20$-digit number. We write $101$ numbers $A$ then erase last $11$ digits. Prove that this $2009$-digit number can not be degree of $2$

[size=130][b]Higher Secondary: 2011[/b] [/size] Time: 4 Hours [b]Problem 1:[/b] Prove that for any non-negative integer $n$ the numbers $1, 2, 3, ..., 4n$ can be divided in tow mutually exclusive classes with equal number of members so that the sum of numbers of each class is equal. http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=709 [b]Problem 2:[/b] In the first round of a chess tournament, each player plays against every other player exactly once. A player gets $3, 1$ or $-1$ points respectively for winning, drawing or losing a match. After the end of the first round, it is found that the sum of the scores of all the players is $90$. How many players were there in the tournament? http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=708 [b]Problem 3:[/b] $E$ is the midpoint of side $BC$ of rectangle $ABCD$. $A$ point $X$ is chosen on $BE$. $DX$ meets extended $AB$ at $P$. Find the position of $X$ so that the sum of the areas of $\triangle BPX$ and $\triangle DXC$ is maximum with proof. http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=683 [b]Problem 4:[/b] Which one is larger 2011! or, $(1006)^{2011}$? Justify your answer. http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=707 [b]Problem 5:[/b] In a scalene triangle $ABC$ with $\angle A = 90^{\circ}$, the tangent line at $A$ to its circumcircle meets line $BC$ at $M$ and the incircle touches $AC$ at $S$ and $AB$ at $R$. The lines $RS$ and $BC$ intersect at $N$ while the lines $AM$ and $SR$ intersect at $U$. Prove that the triangle $UMN$ is isosceles. http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=706 [b]Problem 6:[/b] $p$ is a prime and sum of the numbers from $1$ to $p$ is divisible by all primes less or equal to $p$. Find the value of $p$ with proof. http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=693 [b]Problem 7:[/b] Consider a group of $n > 1$ people. Any two people of this group are related by mutual friendship or mutual enmity. Any friend of a friend and any enemy of an enemy is a friend. If $A$ and $B$ are friends/enemies then we count it as $1$ [b]friendship/enmity[/b]. It is observed that the number of friendships and number of enmities are equal in the group. Find all possible values of $n$. http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=694 [b]Problem 8:[/b] $ABC$ is a right angled triangle with $\angle A = 90^{\circ}$ and $D$ be the midpoint of $BC$. A point $F$ is chosen on $AB$. $CA$ and $DF$ meet at $G$ and $GB \parallel AD$. $CF$ and $AD$ meet at $O$ and $AF = FO$. $GO$ meets $BC$ at $R$. Find the sides of $ABC$ if the area of $GDR$ is $\dfrac{2}{\sqrt{15}}$ http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=704 [b]Problem 9:[/b] The repeat of a natural number is obtained by writing it twice in a row (for example, the repeat of $123$ is $123123$). Find a positive integer (if any) whose repeat is a perfect square. http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=703 [b]Problem 10:[/b] Consider a square grid with $n$ rows and $n$ columns, where $n$ is odd (similar to a chessboard). Among the $n^2$ squares of the grid, $p$ are black and the others are white. The number of black squares is maximized while their arrangement is such that horizontally, vertically or diagonally neighboring black squares are separated by at least one white square between them. Show that there are infinitely many triplets of integers $(p, q, n)$ so that the number of white squares is $q^2$. http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=702 The problems of the Junior categories are available in [url=http://matholympiad.org.bd/forum/]BdMO Online forum[/url]: http://matholympiad.org.bd/forum/viewtopic.php?f=25&t=678

Find all prime numbers $p$ and $q$ such that $3p^4+5q^4+15=13p^2q^2$.

Define a sequence $\{a_n\}$ by\[a_0=\frac{1}{2},\ a_{n+1}=a_{n}+\frac{a_{n}^2}{2012}, (n=0,\ 1,\ 2,\ \cdots),\] find integer $k$ such that $a_{k}<1<a_{k+1}.$ (September 29, 2012, Hohhot)

Define a finite sequence $ \left( s_i \right)_{1\le i\le 2004} $ with $ s_0+2=s_1+1=s_2=2 $ and the recurrence relation $$ s_n=1+s_{n-1} +s_{n-2} -s_{n-3} . $$ Calculate its last element.

For any natural number, let's call the numbers formed from its digits and have the same "digit" arrangement with the initial number as the "partial numbers". For example, the partial numbers of $149$ are ${1, 4, 9, 14,19, 49, 149},$ and the partial numbers of $313$ are ${3, 1, 31,33, 13, 313}.$ Find all natural numbers whose partial numbers are all prime. Justify your opinion.

Show that $$5^{2019} \mid \Sigma^{5^{2019}}_{k=1}3^{gcd (5^{2019},k)}$$

Jenny places 100 pennies on a table, 30 showing heads and 70 showing tails. She chooses 40 of the pennies at random (all different) and turns them over. That is, if a chosen penny was showing heads, she turns it to show tails; if a chosen penny was showing tails, she turns it to show heads. At the end, what is the expected number of pennies showing heads?

Prove the following equality for all positive integers $m,n$: $$\sum_{k=0}^{n} {m+k \choose k} 2^{n-k} +\sum_{k=0}^m {n+k \choose k}2^{m-k}= 2^{m+n+1}$$

Let $n \leq 100$ be an integer. Hare puts real numbers in the cells of a $100 \times 100$ table. By asking Hare one question, Wolf can find out the sum of all numbers of a square $n \times n$, or the sum of all numbers of a rectangle $1 \times (n - 1)$ (or $(n - 1) \times 1$). Find the greatest $n{}$ such that, after several questions, Wolf can find the numbers in all cells, with guarantee.

In a tennis tournament where $ n$ players $ A_1,A_2,\dots,A_n$ take part, any two players play at most one match, and $ k \leq \frac {n(n \minus{} 1)}{2}$ $ 2$ matches are played. The winner of a match gets $ 1$ point while the loser gets $ 0$. Prove that a sequence $ d_1,d_2,\dots,d_n$ of nonnegative integers can be the sequence of scores of the players ($ d_i$ being the score of$ A_i$) if and only if $ (i)\ \ d_1 \plus{} d_2 \plus{} \dots \plus{} d_n \equal{} k$, and $ (ii)\ \text{for any} X\subset\{A_1,\dots,A_n\}$, the number of matches between the players in $ X$ is at most $ \sum_{A_j\in X}d_j$

A point object of mass $m$ is connected to a cylinder of radius $R$ via a massless rope. At time $t = 0$ the object is moving with an initial velocity $v_0$ perpendicular to the rope, the rope has a length $L_0$, and the rope has a non-zero tension. All motion occurs on a horizontal frictionless surface. The cylinder remains stationary on the surface and does not rotate. The object moves in such a way that the rope slowly winds up around the cylinder. The rope will break when the tension exceeds $T_{max}$. Express your answers in terms of $T_{max}$, $m$, $L_0$, $R$, and $v_0$. [asy] size(200); real L=6; filldraw(CR((0,0),1),gray(0.7),black); path P=nullpath; for(int t=0;t<370;++t) { pair X=dir(180-t)+(L-t/180)*dir(90-t); if(X.y>L) X=(X.x,L); P=P--X; } draw(P,dashed,EndArrow(size=7)); draw((-1,0)--(-1,L)--(2,L),EndArrow(size=7)); filldraw(CR((-1,L),0.25),gray(0.7),black);[/asy]What is the kinetic energy of the object at the instant that the rope breaks? $ \textbf{(A)}\ \frac{mv_0^2}{2} $ $ \textbf{(B)}\ \frac{mv_0^2R}{2L_0} $ $ \textbf{(C)}\ \frac{mv_0^2R^2}{2L_0^2} $ $ \textbf{(D)}\ \frac{mv_0^2L_0^2}{2R^2} $ $ \textbf{(E)}\ \text{none of the above} $

Prove the following equality: $4 sin\frac{2\pi }{7}-tg \frac{\pi }{7}=\sqrt{7}$

Two unit squares with parallel sides overlap by a rectangle of area $1/8$. Find the extreme values of the distance between the centers of the squares.

In the figure the sum of the distances $AD$ and $BD$ is [asy] draw((0,0)--(13,0)--(13,4)--(10,4)); draw((12.5,0)--(12.5,.5)--(13,.5)); draw((13,3.5)--(12.5,3.5)--(12.5,4)); label("A", (0,0), S); label("B", (13,0), SE); label("C", (13,4), NE); label("D", (10,4), N); label("13", (6.5,0), S); label("4", (13,2), E); label("3", (11.5,4), N); [/asy] $ \textbf{(A)}\ \text{between 10 and 11} \qquad\textbf{(B)}\ 12 \qquad\textbf{(C)}\ \text{between 15 and 16} \qquad\textbf{(D)}\ \text{between 16 and 17} \qquad\textbf{(E)}\ 17 $

The sidelengths of a triangle and the diameter of its incircle, taken in some order, form an arithmetic progression. Prove that the triangle is right-angled.

$(YUG 3)$ Let four points $A_i (i = 1, 2, 3, 4)$ in the plane determine four triangles. In each of these triangles we choose the smallest angle. The sum of these angles is denoted by $S.$ What is the exact placement of the points $A_i$ if $S = 180^{\circ}$?