Fede chooses $50$ distinct integers from the set $\{1, 2, 3, \ldots, 100\}$ such that their sum equals $2900$. Determine the minimum number of even numbers that can be among the $50$ numbers chosen by Fede.

The numbers from $1$ through $100$ are written in some order on a circle. We call a pair of numbers on the circle [i]good [/i] if the two numbers are not neighbors on the circle and if at least one of the two arcs they determine on the circle only contains numbers smaller then both of them. What may be the total number of good pairs on the circle.

Find all permutations of the numbers $1,2,\ldots,9$ in which no two adjacent numbers have a sum divisible by $7$ or $13$.

Given a finite string $S$ of symbols $X$ and $O$, we write $@(S)$ for the number of $X$'s in $S$ minus the number of $O$'s. (For example, $@(XOOXOOX) =-1$.) We call a string $S$ [b]balanced[/b] if every substring $T$ of (consecutive symbols) $S$ has the property $-2 \leq @(T) \leq 2$. (Thus $XOOXOOX$ is not balanced since it contains the sub-string $OOXOO$ whose $@$-value is $-3$.) Find, with proof, the number of balanced strings of length $n$.

There is a chess tournament with $2n$ players ($n > 1$). There is at most one match between each pair of players. If it is not possible to find three players who all play each other, show that there are at most $n^2$ matches. Conversely, show that if there are at most $n^2$ matches, then it is possible to arrange them so that we cannot find three players who all play each other.

Prove that among any $10$ entries of the table $$0 \,\,\,\, 1 \,\,\,\, 2 \,\,\,\, 3 \,\,\,\, ... \,\,\,\, 9$$ $$9 \,\,\,\, 0 \,\,\,\, 1 \,\,\,\, 2 \,\,\,\, ... \,\,\,\, 8$$ $$8 \,\,\,\, 9 \,\,\,\, 0 \,\,\,\, 1 \,\,\,\, ... \,\,\,\, 7$$ $$1 \,\,\,\, 2 \,\,\,\, 3 \,\,\,\, 4 \,\,\,\, ... \,\,\,\, 0$$ standing in different rows and different columns, at least two are equal. (A Savin)

In a class there are n students with unequal heights. $\textbf{(a)}$ Find the number of orderings of the students such that the shortest person is not at the front and the tallest person is not at the end. $\textbf{(b)}$ Define the [i]badness[/i] of an ordering as the maximum number $k$ such that there are $k$ many people with height greater than in front of a person. For example: the sequence $66, 61, 65, 64, 62, 70$ has [i]badness [/i] $3$ since there are $3$ numbers greater than $62$ in front of it. Let $f_k(n)$ denote the number of orderings of $n$ with [i]badness[/i] $k$. Find $f_k(n)$. [hide=hint](Hint: Consider $g_k(n)$ as the number of orderings of n with [i]badness [/i]less than or equal to $k$)[/hide]

Consider a rectangle whose lengths of sides are natural numbers. If someone places as many squares as possible, each with area $3$, inside of the given rectangle, such that the sides of the squares are parallel to the rectangle sides, then the maximal number of these squares fill exactly half of the area of the rectangle. Determine the dimensions of all rectangles with this property.

How many functions $f : \{1,2,3,4,5,6\} \to \{1,2,3,4,5,6\}$ have the property that $f(f(x))+f(x)+x$ is divisible by $3$ for all $x \in \{1,2,3,4,5,6\}?$ [i]Proposed by Kyle Lee[/i]

Black and white checkers are placed on an $8 \times 8$ chessboard, with at most one checker on each cell. What is the maximum number of checkers that can be placed such that each row and each column contains twice as many white checkers as black ones?

Each positive integer $a$ undergoes the following procedure in order to obtain the number $d = d\left(a\right)$: (i) move the last digit of $a$ to the first position to obtain the numb er $b$; (ii) square $b$ to obtain the number $c$; (iii) move the first digit of $c$ to the end to obtain the number $d$. (All the numbers in the problem are considered to be represented in base $10$.) For example, for $a=2003$, we get $b=3200$, $c=10240000$, and $d = 02400001 = 2400001 = d(2003)$.) Find all numbers $a$ for which $d\left( a\right) =a^2$. [i]Proposed by Zoran Sunic, USA[/i]

a) Pupils of the $8$-th form are standing in a row. There is the pupil of the $7$-th form in before each, and he is smaller (in height) than the elder. Prove that if you will sort the pupils in each of rows with respect to their height, every 8-former will still be taller than the $7$-former standing before him. b) An infantry detachment soldiers stand in the rectangle, being arranged in columns with respect to their height. Prove that if you rearrange them with respect to their height in every separate row, they will still be staying with respect to their height in columns.

Kevin colors three distinct squares in a $3\times 3$ grid red. Given that there exist two uncolored squares such that coloring one of them would create a horizontal or vertical red line, find the number of ways he could have colored the original three squares.

There are six empty slots corresponding to the digits of a six-digit number. Claire and William take turns rolling a standard six-sided die, with Claire going first. They alternate with each roll until they have each rolled three times. After a player rolls, they place the number from their die roll into a remaining empty slot of their choice. Claire wins if the resulting six-digit number is divisible by $6$, and William wins otherwise. If both players play optimally, compute the probability that Claire wins.

In a chess tournament , every two participants play each other exactly once. A win is worth one point , a draw is worth half a point and a loss is worth zero points. Looking back at the end of the tournament, a game is called an upset if the total number of points obtained by the winner of that game is less than the total number of points obtained by the loser of that game. (a) Prove that the number of upsets is always strictly less than three-quarters of the total number of games in the tournament. (b) Prove that three-quarters cannot be replaced by a smaller number. (S Tokarev) PS. part (a) for Juniors, both parts for Seniors

$ABCD$ is a square side $10$. There are four points $P_1, P_2, P_3, P_4$ inside the square. Show that we can always construct line segments parallel to the sides of the square of total length $25$ or less, so that each $P_i$ is linked by the segments to both of the sides $AB$ and $CD$. Show that for some points $P_i$ it is not possible with a total length less than $25$.

For any integer $n\geq 2$, let $N(n)$ be the maxima number of triples $(a_i, b_i, c_i)$, $i=1, \ldots, N(n)$, consisting of nonnegative integers $a_i$, $b_i$ and $c_i$ such that the following two conditions are satisfied: [list][*] $a_i+b_i+c_i=n$ for all $i=1, \ldots, N(n)$, [*] If $i\neq j$ then $a_i\neq a_j$, $b_i\neq b_j$ and $c_i\neq c_j$[/list] Determine $N(n)$ for all $n\geq 2$. [i]Proposed by Dan Schwarz, Romania[/i]

Seven congruent line segments are connected together at their endpoints as shown in the figure below at the left. By raising point $E$ the linkage can be made taller, as shown in the figure below and to the right. Continuing to raise $E$ in this manner, it is possible to use the linkage to make $A, C, F$, and $E$ collinear, while simultaneously making $B, G, D$, and $E$ collinear, thereby constructing a new triangle $ABE$. Prove that a regular polygon with center $E$ can be formed from a number of copies of this new triangle $ABE$, joined together at point $E$, and without overlapping interiors. Also find the number of sides of this polygon and justify your answer. [img]https://cdn.artofproblemsolving.com/attachments/2/6/b3826b7ba7ea49642477878a03ac590281df43.png[/img]

There are some cities in a country; one of them is the capital. For any two cities $A$ and $B$ there is a direct flight from $A$ to $B$ and a direct flight from $B$ to $A$, both having the same price. Suppose that all round trips with exactly one landing in every city have the same total cost. Prove that all round trips that miss the capital and with exactly one landing in every remaining city cost the same.

Does there exist a rectangle which can be cut into a hundred rectangles such that all of them are similar to the original one but no two are congruent? [i]Mikhail Murashkin[/i]

Find for which natural numbers $n$ one can color the sides and diagonals of a regular $n$-gon with $n$ colors in such a way that for each triplet in pairs of different colors, a triangle can be found, the sides of which are sides or diagonals of $n$-gon and which is colored with exactly these three colors.

Given a piece of graph paper with a letter assigned to each vertex of every square such that on every segment connecting two vertices that have the same letter and are on the same line of the mesh, there is at least one vertex with another letter. What is the least number of distinct letters needed to plot such a picture, along the sides of the cells?

Alice has four boxes, $327$ blue balls, and $2022$ red balls. The blue balls are labeled $1$ to $327$. Alice first puts each of the balls into a box, possibly leaving some boxes empty. Then, a random label between $1$ and $327$ (inclusive) is selected, Alice finds the box the ball with the label is in, and selects a random ball from that box. What is the maximum probability that she selects a red ball?

In a magic square $n \times n$ composed from the numbers $1,2,\cdots,n^2$, the centers of any two squares are joined by a vector going from the smaller number to the bigger one. Prove that the sum of all these vectors is zero. (A magic square is a square matrix such that the sums of entries in all its rows and columns are equal.)

In the cells of the $4\times N$ table, integers are written, modulo no more than $2024$ (i.e. numbers from the set $\{-2024, -2023,\dots , -2, -1, 0, 1, 2, 3,\dots , 2024\}$) so that in each of the four lines there are no two equal numbers. At what maximum $N$ could it turn out that in each column the sum of the numbers is equal to $2$? [i]G.M.Sharafetdinova[/i]