Let $C$ be a unit circle and $n \ge 1$ be a fixed integer. For any set $A$ of $n$ points $P_1,..., P_n$ on $C$ define $D(A) = \underset{d}{max}\, \underset{i}{min}\delta (P_i, d)$, where $d$ goes over all diameters of $C$ and $\delta (P, \ell)$ denotes the distance from point $P$ to line $\ell$. Let $F_n$ be the family of all such sets $A$. Determine $D_n = \underset{A\in F_n}{min} D(A)$ and describe all sets $A$ with $D(A) = D_n$.

Given $n\ge 3$. consider a sequence $a_1,a_2,...,a_n$, if $(a_i,a_j,a_k)$ with i+k=2j (i<j<k) and $a_i+a_k\ne 2a_j$, we call such a triple a $NOT-AP$ triple. If a sequence has at least one $NOT-AP$ triple, find the least possible number of the $NOT-AP$ triple it contains.

Marjorie is the drum major of the world's largest marching band, with more than one million members. She would like the band members to stand in a square formation. To this end, she determines the smallest integer $n$ such that the band would fit in an $n \times n$ square, and lets the members form rows of $n$ people. However, she is dissatisfied with the result, since some empty positions remain. Therefore, she tells the entire first row of $n$ members to go home and repeats the process with the remaining members. Her aim is to continue it until the band forms a perfect square, but as it happens, she does not succeed until the last members are sent home. Determine the smallest possible number of members in this marching band.

Petrică, Vasile and Tudor participated at a math contest. At the contest $ 5$ problems where proposed, each worth distinct integer numbers of points. Petrică solved $4$ problems completely and got $21$ points and Vasile solved $3 $ problems completely and got $22$ points. Tudor solved all problems completely. What are the lowest and highest possible scores of Tudor?

Cards numbered with numbers $1$ to $1000$ are to be placed on the cells of a $1\times 1994$ rectangular board one by one, according to the following rule: If the cell next to the cell containing the card $n$ is free, then the card $n+1$ must be put on it. Prove that the number of possible arrangements is not more than half a mllion.

On the plane with a rectangular coordinate system, a set of infinitely many rectangles is given. Every rectangle has the origin as one of its vertices. The sides of all rectangles are parallel to the coordinate axes, and all sides have integer lengths. Prove that there are at least two rectangles in the set, one of which completely covers the other.

A [i]squidward[/i] is a piece that moves on a board in the following way: it advances three squares in one direction and then two squares in a perpendicular direction. For example, in the figure below, by making one move, the squidward can move to any of the $8$ squares indicated with arrows. Initially, there is one squidward on each of the $35$ squares of a $5 \times 7$ board. At the same time, each squidward makes exactly one move. What is the smallest possible number of empty squares after these moves? [center][img]https://i.imgur.com/rqgG95C.png[/img][/center]

On a $5\times 5$ chessboard, two players play the following game: The first player places a knight on some square. Then the players alternately move the knight according to the rules of chess, starting with the second player. It is not allowed to move the knight to a square that was visited previously. The player who cannot move loses. Which of the two players has a winning strategy?

Let $n\ge2$ be a positive integer. Given a sequence $\left(s_i\right)$ of $n$ distinct real numbers, define the "class" of the sequence to be the sequence $\left(a_1,a_2,\ldots,a_{n-1}\right)$, where $a_i$ is $1$ if $s_{i+1} > s_i$ and $-1$ otherwise. Find the smallest integer $m$ such that there exists a sequence $\left(w_i\right)$ of length $m$ such that for every possible class of a sequence of length $n$, there is a subsequence of $\left(w_i\right)$ that has that class. [i]David Yang.[/i]

The natural numbers are written in sequence, in increasing order, and by this we get an infinite sequence of digits. Find the least natural $k$, for which among the first $k$ digits of this sequence, any two nonzero digits have been written a different number of times. [i]Aleksandar Ivanov, Emil Kolev [/i]

Arrange the positive integers into two lines as follows: \begin{align*} 1 \quad 3 \qquad 6 \qquad\qquad\quad 11 \qquad\qquad\qquad\qquad\quad\ 19\qquad\qquad32\qquad\qquad 53\ldots\\ \mbox{\ \ } 2 \quad 4\ \ 5 \quad 7\ \ 8\ \ 9\ \ 10\quad\ 12\ 13\ 14\ 15\ 16\ 17\ 18\quad\ 20 \mbox{ to } 31\quad\ 33 \mbox{ to } 52\quad\ \ldots\end{align*} We start with writing $1$ in the upper line, $2$ in the lower line and $3$ again in the upper line. Afterwards, we alternately write one single integer in the upper line and a block of integers in the lower line. The number of consecutive integers in a block is determined by the first number in the previous block. Let $a_1$, $a_2$, $a_3$, $\ldots$ be the numbers in the upper line. Give an explicit formula for $a_n$.

A $10$ digit number is called interesting if its digits are distinct and is divisible by $11111$. Then find the number of interesting numbers.

2008 boys and 2008 girls sit on 4016 chairs around a round table. Each boy brings a garland and each girl brings a chocolate. In an "activity", each person gives his/her goods to the nearest person on the left. After some activities, it turns out that all boys get chocolates and all girls get garlands. Find the number of possible arrangements.

Sahand and Gholam play on a $1403\times 1403$ table. Initially all the unit square cells are white. For each row and column there is a key for it (totally 2806 keys). Starting with Sahand players take turn alternatively pushing a button that has not been pushed yet, until all the buttons are pushed. When Sahand pushes a button all the cells of that row or column become black, regardless of the previous colors. When Gholam pushes a button all the cells of that row or column become red, regardless of the previous colors. Finally, Gholam's score equals the number of red squares minus the number of black squares and Sahand's score equals the number of black squares minus the number of red squares. Determine the minimum number of scores Gholam can guarantee without if both players play their best moves.

Let $\ell$ be a positive integer, and let $m,n$ be positive integers with $m\geq n$, such that $A_1,A_2,\cdots,A_m,B_1,\cdots,B_m$ are $m+n$ pairwise distinct subsets of the set $\{1,2,\cdots,\ell\}$. It is known that $A_i\Delta B_j$ are pairwise distinct, $1\leq i\leq m, 1\leq j\leq n$, and runs over all nonempty subsets of $\{1,2,\cdots,\ell\}$. Find all possible values of $m,n$.

Let $k>1$ be a given positive integer. A set $S$ of positive integers is called [i]good[/i] if we can colour the set of positive integers in $k$ colours such that each integer of $S$ cannot be represented as sum of two positive integers of the same colour. Find the greatest $t$ such that the set $S=\{a+1,a+2,\ldots ,a+t\}$ is [i]good[/i] for all positive integers $a$. [i]A. Ivanov, E. Kolev[/i]

A finite set $\{a_1, a_2, ... a_k\}$ of positive integers with $a_1 < a_2 < a_3 < ... < a_k$ is named [i]alternating [/i] if $i+a$ for $i = 1, 2, 3, ..., k$ is even. The empty set is also considered to be alternating. The number of alternating subsets of $\{1, 2, 3,..., n\}$ is denoted by $A(n)$. Develop a method to determine $A(n)$ for every $n \in N$ and calculate hence $A(33)$.

Let $n\ge3$ be a positive integer. Each edge of a complete graph $K_n$ is assigned a real number satisfying the following conditions: $(i)$ For any three vertices, the numbers assigned to two of the edges among them are equal, and the number on the third edge is strictly greater. $(ii) $ The weight of a vertex is defined as the sum of the numbers assigned to the edges emanating from that vertex. The weights of all vertices are equal. Find all possible values of $n$.

An $n$-term sequence $(x_1, x_2, \ldots, x_n)$ in which each term is either 0 or 1 is called a [i]binary sequence of length [/i]$n$. Let $a_n$ be the number of binary sequences of length $n$ containing no three consecutive terms equal to 0, 1, 0 in that order. Let $b_n$ be the number of binary sequences of length $n$ that contain no four consecutive terms equal to 0, 0, 1, 1 or 1, 1, 0, 0 in that order. Prove that $b_{n+1} = 2a_n$ for all positive integers $n$.

Given a regular hexagon with a side of $100$. Each side is divided into one hundred equal parts. Through the division points and vertices of the hexagon, all sorts of straight lines parallel to its sides are drawn. These lines divided the hexagon into single regular triangles. Consider covering a hexagon with equal rhombuses. Each rhombus is made up of two triangles. (These rhombuses cover the entire hexagon and do not overlap.) Among the lines that form our grid, we select those that intersect exactly to the rhombuses (intersect diagonally). How many such lines will there be if: a) $k = 101$; b) $k = 100$; c) $k = 87$?

Given any odd integer $n>3$ that is not divisible by $3$, determine whether it is possible to fill an $n \times n$ grid with $n^2$ integers such that (each cell filled with a number, the number at the intersection of the $i$-th row and $j$-th column is denoted as $a_{ij}$): $\cdot$ Each row and each column contains a permutation of the numbers $0,1,2, \cdots, n-1$. $\cdot$ The pairs $(a_{ij},a_{ji})$ for $i<j$ are all distinct.

How many sequences of words (not necessarily grammatically correct) have the property that the first word has one letter, each word can be obtained by inserting a letter somewhere in the previous word, and the final word is CCAMT? Here are examples of possible sequences: [center] C,CA,CAM,CCAM,CCAMT. [/center] [center] A,AT,CAT,CAMT,CCAMT. [/center] [i]2021 CCA Math Bonanza Team Round #1[/i]

A rectangle of size $ m \times n$ has been filled completely by trominoes (a tromino is an L-shape consisting of 3 unit squares). There are four ways to place a tromino 1st way: let the "corner" of the L be on top left 2nd way: let the "corner" of the L be on top right 3rd way: let the "corner" of the L be on bottom left 4th way: let the "corner" of the L be on bottom right Prove that the difference between the number of trominoes placed in the 1st and the 4th way is divisible by $ 3$.

For a positive integer $n$, there is a school with $2n$ people. For a set $X$ of students in this school, if any two students in $X$ know each other, we call $X$ [i]well-formed[/i]. If the maximum number of students in a well-formed set is no more than $n$, find the maximum number of well-formed set. Here, an empty set and a set with one student is regarded as well-formed as well.

How many ways are there to arrange the $6$ permutations of the tuple $(1, 2, 3)$ in a sequence, such that each pair of adjacent permutations contains at least one entry in common? For example, a valid such sequence is given by $(3, 2, 1) - (2, 3, 1) - (2, 1, 3) - (1, 2, 3) - (1, 3, 2) - (3, 1, 2)$.