Let $n$ be a positive integer. Compute the number of words $w$ that satisfy the following three properties. 1. $w$ consists of $n$ letters from the alphabet $\{a,b,c,d\}.$ 2. $w$ contains an even number of $a$'s 3. $w$ contains an even number of $b$'s. For example, for $n=2$ there are $6$ such words: $aa, bb, cc, dd, cd, dc.$

Let $P$ be a regular $2006$-gon. A diagonal is called [i]good[/i] if its endpoints divide the boundary of $P$ into two parts, each composed of an odd number of sides of $P$. The sides of $P$ are also called [i]good[/i]. Suppose $P$ has been dissected into triangles by $2003$ diagonals, no two of which have a common point in the interior of $P$. Find the maximum number of isosceles triangles having two good sides that could appear in such a configuration.

Positive integers m and n are both greater 50, have a least common multiple equal to 480, and have a greatest common divisor equal to 12. Find $m + n$.

The chords $AC$ and $BD$ of a, circle with centre $O$ intersect at the point $K$. The circumcentres of triangles $AKB$ and $CKD$ are $M$ and $N$ respectively. Prove that $OM = KN$. (A Zaslavsky )

A fighting game club has $2024$ members. One day, a game of Smash is played between some pairs of members so that every member has played against exactly $3$ other members. Each match has a winner and a loser. A member will be [i]happy[/i] if they won in at least $2$ of the matches. What is the maximum number of happy members over all possible match-ups and all possible outcomes?

Suppose that $1985$ points are given inside a unit cube. Show that one can always choose $32$ of them in such a way that every (possibly degenerate) closed polygon with these points as vertices has a total length of less than $8 \sqrt 3.$

Jerry has red blocks, yellow blocks, and blue blocks. He builds a tower $5$ blocks high, without any $2$ blocks of the same color touching each other. Also, if the tower is flipped upside-down, it still looks the same. Compute the number of ways Jerry could have built this tower.

Let $n$ be a positive integer and $p > n+1$ a prime. Prove that $p$ divides the following sum $S = 1^n + 2^n +...+ (p - 1)^n$

We call polynomial $S(x)\in\mathbb{R}[x]$ sadeh whenever it's divisible by $x$ but not divisible by $x^2$. For the polynomial $P(x)\in\mathbb{R}[x]$ we know that there exists a sadeh polynomial $Q(x)$ such that $P(Q(x))-Q(2x)$ is divisible by $x^2$. Prove that there exists sadeh polynomial $R(x)$ such that $P(R(x))-R(2x)$ is divisible by $x^{1401}$.

Consider the set of axis-aligned boxes in $R^d$ , $B(a, b) = \{x \in R^d: \forall i, a_i \le x_i \le b_i\}$ where $a, b \in R^d$. In terms of $d$, what is the maximum number $n$, such that there exists a set of $n$ points $S =\{x_1, ..., x_n\}$ such that no matter how one partition $S = P \cup Q$ with $P, Q$ disjoint and $P, Q$ can possibly be empty, there exists a box $B$ such that all the points in $P$ are contained in $B$, and all the points in $Q$ are outside $B$?

Let $m, n$ be positive integers. Consider a sequence of positive integers $a_1, a_2, ... , a_n$ that satisfies $m = a_1 \ge a_2\ge ... \ge a_n \ge 1$. Then define, for $1\le  i\le  m$, $b_i =$ # $\{ j \in \{1, 2, ... , n\}: a_j \ge i\}$, so $b_i$ is the number of terms $a_j $ of the given sequence for which $a_j  \ge i$. Similarly, we define, for $1\le   j \le  n$, $c_j=$ # $\{ i \in \{1, 2, ... , m\}: b_i \ge j\}$ , thus $c_j$ is the number of terms bi in the given sequence for which $b_i \ge j$. E.g.: If $a$ is the sequence $5, 3, 3, 2, 1, 1$ then $b$ is the sequence $6, 4, 3, 1, 1$. (a) Prove that $a_j = c_j $ for $1  \le j  \le n$. (b) Prove that for $1\le  k \le m$: $\sum_{i=1}^{k} b_i = k \cdot b_k + \sum_{j=b_{k+1}}^{n} a_j$.

In the figure below, $ABCD$ is a rectangle with sides of length $AB = 5$ inches and $AD = 3$ inches. Rectangle $ABCD$ is rotated $90^{\circ}$ clockwise about the midpoint of side $\overline{DC}$ to give a second rectangle. What is the total area, in square inches, covered by the two overlapping rectangles? [img]https://i.imgur.com/NyhZpL6.png[/img] $\textbf{(A) }21 \qquad\textbf{(B) }22.25 \qquad\textbf{(C) }23\qquad\textbf{(D) }23.75 \qquad\textbf{(E) }25$

A $20 \times 20 \times 20$ cube is composed of $2000$ bricks of size $2 \times 2 \times 1$ . Prove that it is possible to pierce the cube with a needle so that the needle passes through the cube without passing through a brick . (A . Andjans , Riga)

Determine the polynomials P of two variables so that: [b]a.)[/b] for any real numbers $t,x,y$ we have $P(tx,ty) = t^n P(x,y)$ where $n$ is a positive integer, the same for all $t,x,y;$ [b]b.)[/b] for any real numbers $a,b,c$ we have $P(a + b,c) + P(b + c,a) + P(c + a,b) = 0;$ [b]c.)[/b] $P(1,0) =1.$

Consider the set $S$ of integers $k$ which are products of four distinct primes. Such an integer $k=p_1p_2p_3p_4$ has $16$ positive divisors $1=d_1<d_2<\ldots <d_{15}<d_{16}=k$. Find all elements of $S$ less than $2002$ such that $d_9-d_8=22$.

If the numbers $2a + 2$ and $2b + 2$ add up to $2004$, find the sum of the numbers $\frac{a}{2} - 2$ and $\frac{b}{2} - 2$

In an acute triangle $ABC$, a circle $S$ is drawn through the center $O$ of the circumcircle and the vertices $B$ and $C$. Let $OK$ be the diameter of the circle $S$, $D$ and $E$, be it's intersection points with the straight lines $AB$ and $AC$ respectively. Prove that $ADKE$ is a parallelogram.

Consider the natural numbers written in the decimal system. (a) Find the smallest number which decreases five times when its first digit is erased. Which form do all numbers with this property have? (b) Prove that there is no number that decreases $12$ times when its first digit is erased. (c) Find the necessary and sufficient condition on $k$ for the existence of a natural number which is divided by $k$ when its first digit is erased.

Call a year [i]ultra-even[/i] if all of its digits are even. Thus $2000,2002,2004,2006$, and $2008$ are all [i]ultra-even[/i] years. They are all $2$ years apart, which is the shortest possible gap. $2009$ is not an [i]ultra-even[/i] year because of the $9$, and $2010$ is not an ultra-even year because of the $1$. (a) In the years between the years $1$ and $10000$, what is the longest possible gap between two [i]ultra-even[/i] years? Give an example of two ultra-even years that far apart with no [i]ultra-even[/i] years between them. Justify your answer. (b) What is the second-shortest possible gap (that is, the shortest gap longer than $2$ years) between two [i]ultra-even[/i] years? Again, give an example, and justify your answer.

In $ ABC$ we have $ AB \equal{} 25$, $ BC \equal{} 39$, and $ AC \equal{} 42$. Points $ D$ and $ E$ are on $ AB$ and $ AC$ respectively, with $ AD \equal{} 19$ and $ AE \equal{} 14$. What is the ratio of the area of triangle $ ADE$ to the area of quadrilateral $ BCED$? $ \textbf{(A)}\ \frac{266}{1521}\qquad \textbf{(B)}\ \frac{19}{75}\qquad \textbf{(C)}\ \frac{1}{3}\qquad \textbf{(D)}\ \frac{19}{56}\qquad \textbf{(E)}\ 1$

$AD$, $BE$, $CF$ are the heights of the acute—angled triangle $ABC$. A perpendicular is drawn to the segment $DE$ at point $E$. It intersects the height of $AD$ at point $G$. The point $J$ is chosen on the segment $BD$ in such a way that $BJ = CD$. The circumscribed circle of a triangle $BD$ intersects the segment $BE$ at point $Q$. Prove that the points $J$, $Q$, and $G$ are collinear.

Prove that there don't exist positive integer numbers $k$ and $n$ which satisfy equation $n^n+(n+1)^{n+1}+(n+2)^{n+2} = 2023^k$. [i]Proposed by Mykhailo Shtandenko[/i]

Based on a city's rules, the buildings of a street may not have more than $9$ stories. Moreover, if the number of stories of two buildings is the same, no matter how far they are from each other, there must be a building with a higher number of stories between them. What is the maximum number of buildings that can be built on one side of a street in this city?

What is the value of \[1+2+3-4+5+6+7-8+\cdots+197+198+199-200?\] $\textbf{(A) } 9,800 \qquad \textbf{(B) } 9,900 \qquad \textbf{(C) } 10,000 \qquad \textbf{(D) } 10,100 \qquad \textbf{(E) } 10,200$

In a school there are $ 2008$ students. Students are members of certain committees. A committee has at most $ 1004$ members and every two students join a common committee. (i) Determine the smallest possible number of committees in the school. (ii) If it is further required that the union of any two committees consists of at most $ 1800$ students, will your answer in (i) still hold?