A subset of the set $\{1, 2, 3, ..., 30\}$ is called [i]delicious [/i ]if it doesn't contain elements a and b such that $a = 3b$. A [i]delicious[/i] subset It is called [i]super delicious[/i] if, in addition to being delicious, it is verified that no [i]delicious[/i] subset has more elements than it has. Determine the number of [i]super delicious[/i] subsets

Find all possible numbers of lines in a plane which intersect in exactly $37$ points.

Determine the set $S$ with minimal number of points defining $7$ distinct lines

In a cardboard box are a large number of loose socks. Some of the socks are red, the others are blue. It is stated that the total number of socks does not exceed $1993$. Furthermore, it is stated that the probability of pulling two socks from the same color when two socks are randomly drawn from the box is $1/2$. What is according to the available information, the largest number of red socks that can exist in the box?

A square is divided into $25$ small squares. We draw diagonals of some of the small squares so that no two diagonals share a common point (not even a common endpoint). What is the largest possible number of diagonals that we can draw? (I Rubanov)

Sunay is in the bottom-left square of a checkerboard which is $5$ squares wide (the left-right direction) and $3$ squares tall (the up-down direction). From any square, he may move one square up, one square down, or one square to the right, provided that he does not fall off the checkerboard and provided that he does not revisit a square. How many paths are there for Sunay from the bottom-left square to the top-right square?

Let $n$ be a positive integer such that $n \geq 3$. Consider a grid with size $n \times n$ where each square can be white or black, in the beginning they are all white. In every step we can change the colors of cells forming a shape like below [img] https://imgtr.ee/images/2023/04/04/k0i9m.png [/img] or any of its rotations. Determine all $n$ such that the whole grid can be black after a finite number of steps.

The lateral sides of a box with base $a\times b$ and height $c$ (where $a$; $b$;$ c$ are natural numbers) are completely covered without overlap by rectangles whose edges are parallel to the edges of the box, each containing an even number of unit squares. (Rectangles may cross the lateral edges of the box.) Prove that if $c$ is odd, then the number of possible coverings is even. [i]D. Karpov, C. Gukshin, D. Fon-der-Flaas[/i]

Nine journalists from different countries attend a press conference. None of these speaks more than three languages, and each pair of the journalists share a common language. Show that there are at least five journalists sharing a common language.

(a) Divide the line segment $[0,1]$ into smaller black and white segments so that, for any polynomial $p(x)$ of degree no greater than two, the sum of increments of $p(x)$ along all the black segments is equal to that along the white ones. (The increment of $p(x)$ along the segment $[a, n]$ is the number $p(b) - p(a)$.) (b) Can this be done for all polynomials of degree no greater than $1995$? (Burkov)

Given any positive integer $n$, prove that: [b](a)[/b] Every $n$ points in the closed unit square $[0,1]\times [0,1]$ can be joined by a path of length less than $2\sqrt{n}+4$; and [b](b)[/b] There exist $n$ points in the closed unit square $[0,1]\times [0,1]$ that cannot be joined by a path of length less than $\sqrt{n}-1$.

Let $m$ and $n$ be positive integers. For a connected simple graph $G$ on $n$ vertices and $m$ edges, we consider the number $N(G)$ of orientations of (all of) its edges so that, in the resulting directed graph, every vertex has even outdegree. Show that $N(G)$ only depends on $m$ and $n$, and determine its value.

Exactly $2^{1012}$ of the subsets of $\{1, 2, \ldots, 2023\}$ are colored red. Is it always true that there exist three distinct red sets $A$, $B$, and $C$ such that every element of $A$ belongs to at least one of $B$ or $C$?

There are $10001$ students at an university. Some students join together to form several clubs (a student may belong to different clubs). Some clubs join together to form several societies (a club may belong to different societies). There are a total of $k$ societies. Suppose that the following conditions hold: [i]i.)[/i] Each pair of students are in exactly one club. [i]ii.)[/i] For each student and each society, the student is in exactly one club of the society. [i]iii.)[/i] Each club has an odd number of students. In addition, a club with ${2m+1}$ students ($m$ is a positive integer) is in exactly $m$ societies. Find all possible values of $k$. [i]Proposed by Guihua Gong, Puerto Rico[/i]

A die is an unitary cube with numbers from $1$ to $6$ written on its faces, so that each number appears once and the sum of the numbers on any two opposite faces is $7$. We construct a large $3 \cdot 3 \cdot 3$ cube using$ 27$ dice. Find all possible values of the sum of numbers which can be seen on the faces of the large cube.

A shop sells bottles with this capacity: $1L, 2L, 3L,..., 1996L$, the prices of bottles satifies this $2$ conditions: $1$. Two bottles have the same price, if and only if, your capacities satifies $m - n = 1000$ $2$. The price of bottle $m$($1001>m>0$) is $1996 - m$ dollars. Find all pair(s) $m$ and $n$ such that: a) $m + n = 1000$ b) the cost is smallest possible!!! c) with the pair, the shop can measure $k$ liters, with $0<k<1996$(for all $k$ integer) Note: The operations to measure are: i) To fill or empty any one of two bottles ii)Pass water of a bottle for other bottle We can measure $k$ liters when the capacity of one bottle plus the capacity of other bottle is equal to $k$

Of how many terms does the expansion of a determinant of order $ 2n$ consist if those and only those elements $ a_{ik}$ are non-zero for which $ i\minus{}k$ is divisible by $ n$?

In a certain country, every two cities are connected either by an airline route or by a railroad. Prove that one can always choose a type of transportation in such a way that each city can be reached from any other city with at most two transfers.

A box contains $28$ red balls, $20$ green balls, $19$ yellow balls, $13$ blue balls, $11$ white balls and $9$ black balls. What is the minimum number of balls that must be drawn from the box without replacement to guarantee that atleast $15$ balls of a single colour will be drawn?

Bart, Lisa and Maggie play the following game: Bart colors finitely many points red or blue on a circle such that no four colored points can be chosen on the circle such that their colors are blue-red-blue-red (the four points do not have to be consecutive). Lisa chooses finitely many of the colored points. Now Bart gives the circle (possibly rotated) to Maggie with Lisa's chosen points, however, without their colors. Finally, Maggie colors all the points of the circle to red or blue. Lisa and Maggie wins the game, if Maggie correctly guessed the colors of Bart's points. A strategy of Lisa and Maggie is called a winning strategy, if they can win the game for all possible colorings by Bart. Prove that Lisa and Maggie have a winning strategy, where Lisa chooses at most $c$ points in all possible cases, and find the smallest possible value of $c$. [i]Proposed by Dömötör Pálvölgyi, Budapest[/i]

Let $S$ be a subset of $\{1, 2, \dots, 9\}$, such that the sums formed by adding each unordered pair of distinct numbers from $S$ are all different. For example, the subset $\{1, 2, 3, 5\}$ has this property, but $\{1, 2, 3, 4, 5\}$ does not, since the pairs $\{1, 4\}$ and $\{2, 3\}$ have the same sum, namely 5. What is the maximum number of elements that $S$ can contain?

Given a positive integer $n$. A triangular array $(a_{i,j})$ of zeros and ones, where $i$ and $j$ run through the positive integers such that $i+j\leqslant n+1$ is called a [i]binary anti-Pascal $n$-triangle[/i] if $a_{i,j}+a_{i,j+1}+a_{i+1,j}\equiv 1\pmod{2}$ for all possible values $i$ and $j$ may take on. Determine the minimum number of ones a binary anti-Pascal $n$-triangle may contain.

$n$ lines are on the same plane, no two of them parallel and no three of them collinear(so the plane must be partitioned into some parts). How many parts is the plane partitioned into? Consider only the partitions with finitely large area.

Consider a $2024 \times 2024$ grid of unit squares. Two distinct unit squares are adjacent if they share a common side. Each unit square is to be coloured either black or white. Such a colouring is called $\textit{evenish}$ if every unit square in the grid is adjacent to an even number of black unit squares. Determine the number of $\textit{evenish}$ colourings.

Three doctors, four nurses, and three patients stand in a line in random order. The probability that there is at least one doctor and at least one nurse between each pair of patients is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.