What least possible number of unit squares $(1\times1)$ must be drawn in order to get a picture of $25 \times 25$-square divided into $625$ of unit squares?

Let $n{}$ and $k{}$ be natural numbers, with $n > 2k$. In the deck of cards, each card contains a subset of the set $\{1, 2, \ldots , n\}$ consisting of at least $k+1$, but no more than $n-k$ elements. Each $m$-element set is written exactly on $m-k$ cards. Is it possible to split these cards into $n- 2k$ stacks so that in each stack all subsets on the cards are different, and any two of them intersect?

Given two integers $h \geq 1$ and $p \geq 2$, determine the minimum number of pairs of opponents an $hp$-member parliament may have, if in every partition of the parliament into $h$ houses of $p$ member each, some house contains at least one pair of opponents.

Does there exist a real number $r$ such that the equation $$x^3-2023x^2-2023x+r=0$$ has three distinct rational roots?

Let $a, b, c$ be positive reals such that $a + b + c = 1$ and $P(x) = 3^{2005}x^{2007 }- 3^{2005}x^{2006} - x^2$. Prove that $P(a) + P(b) + P(c) \le -1$.

The triangle $ABC$ is inscribed in the circle. Construct a point $P$ such that the points of intersection of lines $AP, BP$ and $CP$ with this circle are the vertices of an equilateral triangle. (A. Zaslavsky)

What is the $22\text{nd}$ positive integer $n$ such that $22^n$ ends in a $2$? (when written in base $10$).

Let $ \mathcal{P}$ be a square and let $ n$ be a nonzero positive integer for which we denote by $ f(n)$ the maximum number of elements of a partition of $ \mathcal{P}$ into rectangles such that each line which is parallel to some side of $ \mathcal{P}$ intersects at most $ n$ interiors (of rectangles). Prove that \[ 3 \cdot 2^{n\minus{}1} \minus{} 2 \le f(n) \le 3^n \minus{} 2.\]

Let $\operatorname{rad}(k)$ denote the product of prime divisors of a natural number $k$ (define $\operatorname{rad}(1)=1$). A sequence $(a_n)$ is defined by setting $a_1$ arbitrarily, and $a_{n+1}=a_n+\operatorname{rad}(a_n)$ for $n\ge1$. Prove that the sequence $(a_n)$ contains arithmetic progressions of arbitrary length.

Prove that the following statement holds for all odd integers $n \ge 3$: If a quadrilateral $ABCD$ can be partitioned by lines into $n$ cyclic quadrilaterals, then $ABCD$ is itself cyclic.

In equality $$1 * 2 * 3 * 4 * 5 * ... * 60 * 61 * 62 = 2023$$ Instead of each asterisk, you need to put one of the signs “+” (plus), “-” (minus), “•” (multiply) so that the equality becomes true. What is the smallest number of "•" characters that can be used?

Given a positive integer $n$. (a) If $P$ is a polynomial of degree $n$ where $P(x) \in \mathbb{Z}$ for every $x \in \mathbb{Z}$, prove that for every $a,b \in \mathbb{Z}$ where $P(a) \neq P(b)$, \[\text{lcm}(1, 2, \ldots, n) \ge \left| \dfrac{a-b}{P(a) - P(b)} \right|\] (b) Find one $P$ (for each $n$) such that the equality case above is achieved for some $a,b \in \mathbb{Z}$.

Let $P_1$, $P_2$ and $P_3$ be polynomials of degree two with positive coefficient leader and real roots . Prove that if each pair of polynomials has a common root , then the polynomial $P_1 + P_2 + P_3$ has also real roots.

A piece of paper is folded in half. A second fold is made at an angle $ \phi$ ($ 0^\circ < \phi < 90^\circ$) to the first, and a cut is made as shown below. [img]12881[/img] When the piece of paper is unfolded, the resulting hole is a polygon. Let $ O$ be one of its vertices. Suppose that all the other vertices of the hole lie on a circle centered at $ O$, and also that $ \angle XOY \equal{} 144^\circ$, where $ X$ and $ Y$ are the the vertices of the hole adjacent to $ O$. Find the value(s) of $ \phi$ (in degrees).

Zan starts with a rational number $\tfrac{a}{b}$ written on the board in lowest terms. Then, every second, Zan adds $1$ to both the numerator and denominator of the latest fraction and writes the result in lowest terms. Zan stops as soon as he writes a fraction of the form $\tfrac{n}{n+1}$, for some positive integer $n$. If $\tfrac{a}{b}$ started in that form, Zan does nothing. As an example, if Zan starts with $\tfrac{13}{19}$, then after one second he writes $\tfrac{14}{20} = \tfrac{7}{10}$, then after two seconds $\tfrac{8}{11}$, then $\tfrac{9}{12} = \tfrac{3}{4}$, at which point he stops. (a) Prove that Zan will stop in less than $b-a$ seconds. (b) Show that if $\tfrac{n}{n+1}$ is the final number, then \[\frac{n-1}{n} < \frac{a}{b} \le \frac{n}{n+1}.\] [i](Proposed by Michael Tang.)[/i]

Let $S$ be a convex quadrilateral $ABCD$ and $O$ a point inside it. The feet of the perpendiculars from $O$ to $AB, BC, CD, DA$ are $A_1, B_1, C_1, D_1$ respectively. The feet of the perpendiculars from $O$ to the sides of $S_i$, the quadrilateral $A_iB_iC_iD_i$, are $A_{i+1}B_{i+1}C_{i+1}D_{i+1}$, where $i = 1, 2, 3.$ Prove that $S_4$ is similar to S.

Sam dumps tea for $6$ hours at a constant rate of $60$ tea crates per hour. Eddie takes $4$ hours to dump the same amount of tea at a different constant rate. How many tea crates does Eddie dump per hour? [i]Proposed by Samuel Tsui[/i] [hide=Solution] [i]Solution.[/i] $\boxed{90}$ Sam dumps a total of $6 \cdot 60 = 360$ tea crates and since it takes Eddie $4$ hours to dump that many he dumps at a rate of $\dfrac{360}{4}= \boxed{90}$ tea crates per hour. [/hide]

Find all primes $p, q$ satisfying the equation $2p^q - q^p = 7.$

Let $A,B,C,D$ be the vertices of a rhombus, let $k_1$ be the circle through $B,C$ and $D$, let $k_2$ be the circle through $A,C$ and $D$, let $k_3$ be the circle through $A,B$ and $D$, let $k_4$ be the circle through $A,B$ and $C$. Prove that the tangents to $k_1$ and $k_3$ at $B$ form the same angle as the tangents to $k_2$ and $k_4$ at $A$.

If $p,q,$ and $r$ are primes with $pqr=7(p+q+r)$, find $p+q+r$.

Determine all positive integers $n$ such that $\frac{a^2+n^2}{b^2-n^2}$ is a positive integer for some $a,b\in \mathbb{N}$. $Turkey$

Let $\mathbb{N}$ be the set of positive integers. A function $f:\mathbb{N}\to\mathbb{N}$ satisfies the equation \[\underbrace{f(f(\ldots f}_{f(n)\text{ times}}(n)\ldots))=\frac{n^2}{f(f(n))}\] for all positive integers $n$. Given this information, determine all possible values of $f(1000)$. [i]Proposed by Evan Chen[/i]

If $n$ is a positive integer, let $\phi(n)$ be the number of positive integers less than or equal to $n$ that are relatively prime to $n$. Compute the value of the infinite sum \[ \sum_{n=1}^\infty \frac{\phi(n) 2^n}{9^n - 2^n} \, . \]

A sequence $\{x_n\}_{n=1}^{\infty}, 0\leq x_n\leq 1$ is called "Devin" if for any $f\in C[0,1]$ $$ \lim_{n\to\infty}\frac{1}{n}\sum_{i=1}^n f(x_i)=\int_0^1 f(x)\,dx $$ Prove that a sequence $\{x_n\}_{n=1}^{\infty}, 0\leq x_n\leq 1$ is "Devin" if and only if for any non-negative integer $k$ it holds $$\lim_{n\to\infty}\frac{1}{n}\sum_{i=1}^n x_i^k=\frac{1}{k+1}.$$ [b]Remark[/b]. I left intact the text as it was proposed. Devin is a Bulgarian city and SPA resort, where this competition took place.

If, instead, the graph is a graph of ACCELERATION vs. TIME and the squirrel starts from rest, then the squirrel has the greatest speed at what time(s) or during what time interval? (A) at B (B) at C (C) at D (D) at both B and D (E) From C to D