Several paper-made disks (not necessarily equal) are put on the table so that there is some overlapping, but no disk is entirely inside another. The parts that overlap are cut off and removed. Show that the remaining parts cannot be assembled so as to form different disks.

Compute the number of primes less than $40$ that are the sum of two primes.

We say that a positive integer is guarani if the sum of the number with its reverse is a number that only has odd digits. For example, $249$ and $30$ are guarani, since $249 + 942 = 1191$ and $30 + 03 = 33$. a) How many $2021$-digit numbers are guarani? b) How many $2023$-digit numbers are guarani?

Let $ n \geq 3$ and consider a set $ E$ of $ 2n \minus{} 1$ distinct points on a circle. Suppose that exactly $ k$ of these points are to be colored black. Such a coloring is [b]good[/b] if there is at least one pair of black points such that the interior of one of the arcs between them contains exactly $ n$ points from $ E$. Find the smallest value of $ k$ so that every such coloring of $ k$ points of $ E$ is good.

Let $f(x) = x^n$ where $n$ is a fixed positive integer and $x =1, 2, \cdots .$ Is the decimal expansion $a = 0.f (1)f(2)f(3) . . .$ rational for any value of $n$ ? The decimal expansion of a is defined as follows: If $f(x) = d_1(x)d_2(x) \cdots d_{r(x)}(x)$ is the decimal expansion of $f(x)$, then $a = 0.1d_1(2)d_2(2) \cdots d_{r(2)}(2)d_1(3) . . . d_{r(3)}(3)d_1(4) \cdots .$

Let $A_1, A_2, \ldots, A_n$ be an $n$ -sided regular polygon. If $\frac{1}{A_1 A_2} = \frac{1}{A_1 A_3} + \frac{1}{A_1A_4}$, find $n$.

The numbers $x, y, z, t, a$ and $b$ are positive integers, so that $xt-yz = 1$ and $$\frac{x}{y} \ge \frac{a}{b} \ge \frac{z}{t} .$$Prove that $$ab \le (x + z) (y +t)$$

Prove that the number \[ \frac{m}{3} + \frac{m^2}{2} + \frac{m^3}{6} \] is an integer for all integer values of $m$.

Let $\omega$ be a circle and let $A,B,C,D,E$ be five points on $\omega$ in this order. Define $F=BC\cap DE$, such that the points $F$ and $A$ are on opposite sides, with regard to the line $BE$ and the line $AE$ is tangent to the circumcircle of the triangle $BFE$. a) Prove that the lines $AC$ and $DE$ are parallel b) Prove that $AE=CD$

We have a pool table $8$ meters long and $2$ meters wide with a single ball in the center. We throw the ball in a straight line and, after traveling $29$ meters, it stops at a corner of the table. How many times did the ball hit the edges of the table? Note: When the ball rebounds on the edge of the table, the two angles that form its trajectory with the edge of the table are the same.

Let $ A$ be a closed and bounded set in the plane, and let $ C$ denote the set of points at a unit distance from $ A$. Let $ p \in C$, and assume that the intersection of $ A$ with the unit circle $ K$ centered at $ p$ can be covered by an arc shorter that a semicircle of $ K$. Prove that the intersection of $ C$ with a suitable neighborhood of $ p$ is a simple arc which $ p$ is not an endpoint. [i]M. Bognar[/i]

The polynomial $P$ of degree $n$ satisfies $P(k) = \frac{k}{k +1}$ for $k = 0,1,2,...,n$. Find $P(n+1)$.

The points lie on three parallel lines with distances as indicated in the figure $A, B$ and $C$ such that square $ABCD$ is a square. Find the area of this square. [img]https://1.bp.blogspot.com/-xeFvahqPVyM/XzcFfB0-NfI/AAAAAAAAMYA/SV2XU59uBpo_K99ZBY43KSSOKe-veOdFQCLcBGAsYHQ/s0/1998%2BMohr%2Bp3.png[/img]

Let $a, b$ and $c$ be positive real numbers such that $abc = 1$. Prove the inequality $\Big(ab + bc +\frac{1}{ca}\Big)\Big(bc + ca +\frac{1}{ab}\Big)\Big(ca + ab +\frac{1}{bc}\Big)\ge (1 + 2a)(1 + 2b)(1 + 2c)$.

Source: 2018 Canadian Open Math Challenge Part B Problem 4 ----- Determine the number of $5$-tuples of integers $(x_1,x_2,x_3,x_4,x_5)$ such that $\text{(a)}$ $x_i\ge i$ for $1\le i \le 5$; $\text{(b)}$ $\sum_{i=1}^5 x_i = 25$.

In decimal representation $$\text {34!=295232799039a041408476186096435b0000000}.$$ Find the numbers $a$ and $b$.

Prove that there does not exist a polynomial $P (x)$ with integer coefficients and a natural number $m$ such that $$x^m + x + 2 = P(P(x))$$ holds for all integers $x$.

Consider $2002$ segments on a plane, such that their lengths are the same. Prove that there exists such a straight line $r$ such that the sum of the lengths of the projections of the $2002$ segments about $r$ is less than $\frac{2}{3}$.

The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and \[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\] for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).

The Konigsberg School has assigned grades $1$ through $7$ to pods $A$ through $G$, one grade per pod. The school noticed that each pair of connected pods has been assigned grades differing by $2$ or more grade levels. (For example, grades $1$ and $2$ will not be in pods directly connected by a walkway.) What is the sum of the grade levels assigned to pods $C, E,$ and $F$? $\textbf{(A)}\ 12\qquad \textbf{(B)}\ 13\qquad \textbf{(C)}\ 14\qquad \textbf{(D)}\ 15\qquad \textbf{(E)}\ 16$\\

In a french village the number of inhabitants is a perfect square. If $100$ more people moved in, then the number of people would be $ 1$ bigger than a perfect square. If again $100$ more people moved in, then the number of people would be a perfect square again. How many people lives in the village if their number is the least possible?

(a) Is it possible to form a prime number using all the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9 exactly once? (b) Consider the following magic square where the sum of each row, column, and diagonal is the same (in this case, 15): \[ \begin{array}{ccc} 6 & 7 & 2 \\ 1 & 5 & 9 \\ 8 & 3 & 4 \\ \end{array} \] Is it possible to create a magic square with the same properties using the numbers 11, 12, 13, 14, 15, 16, 17, 18, and 19?

Consider the following modified algorithm for binary search, which we will call $\textit{weighted binary search}$: \begin{tabular}{l} 01: \textbf{FUNCTION} SEARCH($L$, value) \\ 02:$\qquad$ hi $\leftarrow$ $\operatorname{len}(L) - 1$ \\ 03:$\qquad$ lo $\leftarrow$ 0 \\ 04:$\qquad$ \textbf{WHILE} hi $\geq$ lo \\ 05:$\qquad\qquad$ guess $\leftarrow$ $\lfloor w \cdot\text{lo} + (1-w) \cdot \text{hi}\rfloor$ \\ 06:$\qquad\qquad$ mid $\leftarrow$ $L[\text{guess}]$ \\ 07:$\qquad\qquad$ \textbf{IF} mid $> \text{value}$ \\ 08: $\qquad\qquad\qquad$ hi $\leftarrow$ $\text{guess} - 1$ \\ 09: $\qquad\qquad$ \textbf{ELSE IF} mid $< \text{value}$ \\ 10: $\qquad\qquad\qquad$ lo $\leftarrow$ $\text{guess} + 1$ \\ 11: $\qquad\qquad$ \textbf{ELSE} \\ 12: $\qquad\qquad\qquad$ \textbf{RETURN} guess \\ 13:$\qquad$ \textbf{RETURN} -1 (not found) \end{tabular}\\ Assume $L$ is a list of the integers $\{1,2,\ldots,100\}$, in that order. Further assume that accessing the $k$th index of $L$ costs $k+1$ tokens (e.g. $L[0]$ costs $1$ token). Let $S$ be the set of all $w\in[\tfrac12,1)$ which minimize the average cost when $\texttt{value}$ is an integer selected at random in the range $[1,50]$. Given that $S=\left(x,\tfrac {74}{99}\right]$, determine $x$.

Alice and Bob play a game together as a team on a $100 \times 100$ board with all unit squares initially white. Alice sets up the game by coloring exactly $k$ of the unit squares red at the beginning. After that, a legal move for Bob is to choose a row or column with at least $10$ red squares and color all of the remaining squares in it red. What is the smallest $k$ such that Alice can set up a game in such a way that Bob can color the entire board red after finitely many moves? Proposed by [i]Nikola Velov, Macedonia[/i]

Consider real numbers $x,y,z$ such that $x,y,z>0$. Prove that \[ (xy+yz+xz)\left(\frac{1}{x^2+y^2}+\frac{1}{x^2+z^2}+\frac{1}{y^2+z^2}\right) > \frac{5}{2}. \]