Consider all words containing only letters $A$ and $B$. For any positive integer $n$, $p(n)$ denotes the number of all $n$-letter words without four consecutive $A$'s or three consecutive $B$'s. Find the value of the expression \[\frac{p(2004)-p(2002)-p(1999)}{p(2001)+p(2000)}.\]

From a police station situated on a straight road innite in both directions, a thief has stolen a police car. Its maximal speed equals $90$% of the maximal speed of a police cruiser. When the theft is discovered some time later, a policeman starts to pursue the thief on a cruiser. However, he does not know in which direction along the road the thief has gone, nor does he know how long ago the car has been stolen. Is it possible for the policeman to catch the thief?

Determine all triples $(k, m, n) $ of positive integers satisfying $$k!+m!=k!n!.$$

Let $ABC$ be an acute triangle with $\angle ACB = 45^o$, $G$ is the point of intersection of the medians, and $O$ is the center of the circumscribed circle. If $OG =1$ and $OG \parallel BC$, find the length of $BC$.

In acute triangle $ABC $with $\angle BAC > \angle BCA$, let $P$ be the point on side $BC$ such that $\angle PAB = \angle BCA$. The circumcircle of triangle $AP B$ meets side $AC$ again at $Q$. Point $D$ lies on segment $AP$ such that $\angle QDC = \angle CAP$. Point $E$ lies on line $BD$ such that $CE = CD$. The circumcircle of triangle $CQE$ meets segment $CD$ again at $F$, and line $QF$ meets side $BC$ at $G$. Show that $B, D, F$, and $G$ are concyclic

In the exterior of the triangle $ABC$ with $m(\angle B) > 45^o$, $m(\angle C) >45°^o$ one constructs the right isosceles triangles $ACM$ and $ABN$ such that $m(\angle CAM) = m(\angle BAN) = 90^o$ and, in the interior of $ABC$, the right isosceles triangle $BCP$, with $m(\angle P) = 90^o$. Show that the triangle $MNP$ is a right isosceles triangle.

Let $H$ be the orthocenter of acute triangle $ABC$ and $D$ the midpoint of $BC$. A line through $H$ intersects $AB,AC$ at $F,E$ respectively, such that $AE=AF$. The ray $DH$ intersects the circumcircle of $\triangle ABC$ at $P$. Prove that $P,A,E,F$ are concyclic.

A rectangular array of positive integers has $4$ rows. The sum of the entries in each column is $20$. Within each row, all entries are distinct. What is the maximum possible number of columns?

The area of a trapezoidal field is $ 1400$ square yards. Its altitude is $ 50$ yards. Find the two bases, if the number of yards in each base is an integer divisible by $ 8$. The number of solutions to this problem is: $ \textbf{(A)}\ \text{none} \qquad\textbf{(B)}\ \text{one} \qquad\textbf{(C)}\ \text{two} \qquad\textbf{(D)}\ \text{three} \qquad\textbf{(E)}\ \text{more than three}$

A bullet of mass $m_\text{1}$ strikes a pendulum of mass $m_\text{2}$ suspended from a pivot by a string of length $L$ with a horizontal velocity $v_\text{0}$. The collision is perfectly inelastic and the bullet sticks to the bob. Find the minimum velocity $v_\text{0}$ such that the bob (with the bullet inside) completes a circular vertical loop. (a) $2\sqrt{Lg}$ (b) $\sqrt{5Lg}$ (c) $(m_\text{1}+m_\text{2})2\sqrt{Lg}/m_\text{1}$ (d) $(m_\text{1}-m_\text{2})\sqrt{Lg}/m_\text{2}$ (e) $(m_\text{1}+m_\text{2})\sqrt{5Lg}/m_\text{1}$

Which is the leastest natural number $n$ such that $n!$ has, at least, $2013$ divisors?

Let $a$ and $n$ denote positive integers such that $n|a^n-1$. Prove that the numbers $a+1,a^2+2, \cdots a^n+n$ all leave different remainders when divided by $n$.

Let $a,t,n$ be positive integers such that $a\le n$. Consider the subsets of $\{1,2,\dots,n\}$ whose any two elements differ by at least $t$. Prove that the number of such subsets not containing $a$ is at most $t^2$ times the number of those that do contain $a$.

An $a\times b\times c$ rectangular box is built from $a\cdot b \cdot c$ unit cubes. Each unit cube is colored red, green, or yellow. Each of the $a$ layers of size $1\times b \times c$ parallel to the $(b\times c)$-faces of the box contains exactly $9$ red cubes, exactly 12 green cubes, and some yellow cubes. Each of the $b$ layers of size $a\times 1 \times c$ parallel to the $(a\times c)$-faces of the box contains exactly 20 green cubes, exactly 25 yellow cubes, and some red cubes. Find the smallest possible volume of the box.

How many ordered triples of integers $ (a,b,c)$, with $ a \ge 2$, $ b\ge 1$, and $ c \ge 0$, satisfy both $ \log_a b \equal{} c^{2005}$ and $ a \plus{} b \plus{} c \equal{} 2005$? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 4$

Let $A = \{1,...,n\}$ with $n \textgreater 5$. Prove that one can find $B$ a finite set of positive integers such that $A$ is a subset of $B$ and $\displaystyle\sum_{x \in B} x^2 = \displaystyle\prod_{x \in B} x$

Given an acute triangle $ABC$. The incircle with center $I$ touches $BC,CA,AB$ at $D,E,F$ respectively. Let $M,N$ be the midpoint of the minor arc of $AB$ and $AC$ respectively. Prove that $M,F,E,N$ are collinear if and only if $\angle BAC =90$$^{\circ}$

A positive integer $m$ is said to be $\emph{zero taker}$ if there exists a positive integer $k$ such that: $k$ is a perfect square; $m$ divides $k$; the decimal expression of $k$ contains at least $2021$ '0' digits, but the last digit of $k$ is not equal to $0$. Find all positive integers that are zero takers.

Let $ p(x)$ be a cubic polynomial with rational coefficients. $ q_1$, $ q_2$, $ q_3$, ... is a sequence of rationals such that $ q_n \equal{} p(q_{n \plus{} 1})$ for all positive $ n$. Show that for some $ k$, we have $ q_{n \plus{} k} \equal{} q_n$ for all positive $ n$.

A social club has $101$ members, each of whom is fluent in the same $50$ languages. Any pair of members always talk to each other in only one language. Suppose that there were no three members such that they use only one language among them. Let $A$ be the number of three-member subsets such that the three distinct pairs among them use different languages. Find the maximum possible value of $A$.

Uri must paint some integers from $1$ to $2022$ (inclusive) in red, such that none of the differences between two red numbers is a prime number. Determine the maximum number of numbers Uri can paint red. [b]Note 1:[/b] The [i]difference [/i]between two distinct numbers is the subtraction of the larger minus the smaller. [b]Note 2:[/b] $1$ is not a prime number.

Find the value of sum $\sum_{n=1}^\infty A_n$, where $$A_n=\sum_{k_1=1}^\infty\cdots\sum_{k_n=1}^\infty \frac{1}{k_1^2}\frac{1}{k_1^2+k_2^2}\cdots\frac{1}{k_1^2+\cdots+k_n^2}.$$

A research facility has $60$ rooms, numbered $1, 2, \dots 60$, arranged in a circle. The entrance is in room $1$ and the exit is in room $60$, and there are no other ways in and out of the facility. Each room, except for room $60$, has a teleporter equipped with an integer instruction $1 \leq i < 60$ such that it teleports a passenger exactly $i$ rooms clockwise. On Monday, a researcher generates a random permutation of $1, 2, \dots, 60$ such that $1$ is the first integer in the permutation and $60$ is the last. Then, she configures the teleporters in the facility such that the rooms will be visited in the order of the permutation. On Tuesday, however, a cyber criminal hacks into a randomly chosen teleporter, and he reconfigures its instruction by choosing a random integer $1 \leq j' < 60$ such that the hacked teleporter now teleports a passenger exactly $j'$ rooms clockwise (note that it is possible, albeit unlikely, that the hacked teleporter's instruction remains unchanged from Monday). This is a problem, since it is possible for the researcher, if she were to enter the facility, to be trapped in an endless \say{cycle} of rooms. The probability that the researcher will be unable to exit the facility after entering in room $1$ can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Two circles $\Gamma_1$ and $\Gamma_2$ intersect at $A,B$. Points $C,D$ lie on $\Gamma_1$, points $E,F$ lie on $\Gamma_2$ such that $A,B$ lies on segments $CE,DF$ respectively and segments $CE,DF$ do not intersect. Let $CF$ meet $\Gamma_1,\Gamma_2$ again at $K,L$ respectively, and $DE$ meet $\Gamma_1,\Gamma_2$ at $M,N$ respectively. If the circumcircles of $\triangle ALM$ and $\triangle BKN$ are tangent, prove that the radii of these two circles are equal.

Let $k$ and $n$ be positive integers. A sequence $\left( A_1, \dots , A_k \right)$ of $n\times n$ real matrices is [i]preferred[/i] by Ivan the Confessor if $A_i^2\neq 0$ for $1\le i\le k$, but $A_iA_j=0$ for $1\le i$, $j\le k$ with $i\neq j$. Show that $k\le n$ in all preferred sequences, and give an example of a preferred sequence with $k=n$ for each $n$. (Proposed by Fedor Petrov, St. Petersburg State University)