What is the greatest number of balls of radius $1/2$ that can be placed within a rectangular box of size $10 \times 10 \times 1 \ ?$

In each cell of a square table of size $n \times n$ cells ($n \ge 3$) the number $1$ or $-1$ is written. If you take any two lines, multiply numbers standing above each other in them and add the n resulting products, then the sum will be equal to $0$. Prove that the number $n$ is divisible by $4$.

Eight teams are competing in a tournament all against all (every pair of team play exactly one time among them). There are not ties and both results of every game are equally probable. What is the probability that in the tournament every team had lose at least one game and won at least one game?

In any cell of an $n \times n$ table a number is written such that all the rows are distinct. Prove that we can remove a column such that the rows in the new table are still distinct.

A collector of rare coins has coins of denominations $1, 2,..., n$ (several coins for each denomination). He wishes to put the coins into $5$ boxes so that: (1) in each box there is at most one coin of each denomination; (2) each box has the same number of coins and the same denomination total; (3) any two boxes contain all the denominations; (4) no denomination is in all $5$ boxes. For which $n$ is this possible?

Take $k\in \mathbb{Z}_{\ge 1}$ and the sets $A_1,A_2,\dots, A_k$ consisting of $x_1,x_2,\dots ,x_k$ positive integers, respectively. For any two sets $A$ and $B$, define $A+B=\{a+b~|~a\in A,~b\in B\}$. Find the least and greatest number of elements the set $A_1+A_2+\dots +A_k$ may have. [i] (Andrei Bâra)[/i]

Prove that for every set of $2n$ lines in the plane, such that there are no two parallel lines, there are two lines that divide the plane into four quadrants such that in each quadrant the number of unbounded regions is equal to $n$. [asy] unitsize(1cm); pair[] A, B; pair P, Q, R, S; A[1] = (0,5.2); B[1] = (6.1,0); A[2] = (1.5,5.5); B[2] = (3.5,0); A[3] = (6.8,5.5); B[3] = (1,0); A[4] = (7,4.5); B[4] = (0,4); P = extension(A[2],B[2],A[4],B[4]); Q = extension(A[3],B[3],A[4],B[4]); R = extension(A[1],B[1],A[2],B[2]); S = extension(A[1],B[1],A[3],B[3]); fill(P--Q--S--R--cycle, palered); fill(A[4]--(7,0)--B[1]--S--Q--cycle, paleblue); draw(A[1]--B[1]); draw(A[2]--B[2]); draw(A[3]--B[3]); draw(A[4]--B[4]); label("Bounded region", (3.5,3.7), fontsize(8)); label("Unbounded region", (5.4,2.5), fontsize(8)); [/asy]

p1. Nurbaya's rectangular courtyard will be covered by a number of paving blocks in the form of a regular hexagon or its pieces like the picture below. The length of the side of the hexagon is $ 12$ cm. [img]https://cdn.artofproblemsolving.com/attachments/6/1/281345c8ee5b1e80167cc21ad39b825c1d8f7b.png[/img] Installation of other paving blocks or pieces thereof so that all fully covered page surface. To cover the entire surface The courtyard of the house required $603$ paving blocks. How many paving blocks must be cut into models $A, B, C$, and $D$ for the purposes of closing. If $17$ pieces of model $A$ paving blocks are needed, how many the length and width of Nurbaya's yard? Count how much how many pieces of each model $B, C$, and $D$ paving blocks are used. p2. Given the square $PQRS$. If one side lies on the line $y = 2x - 17$ and its two vertices lie on the parabola $y = x^2$, find the maximum area of possible squares $PQRS$ . p3. In the triangular pyramid $T.ABC$, the points $E, F, G$, and $H$ lie at , respectively $AB$, $AC$, $TC$, and $TB$ so that $EA : EB = FA : FC = HB : HT = GC : GT = 2:1$. Determine the ratio of the volumes of the two halves of the divided triangular pyramid by the plane $EFGH$. p4. We know that $x$ is a non-negative integer and $y$ is an integer. Define all pair $(x, y)$ that satisfy $1 + 2^x + 2^{2x + 1} = y^2$. p5. The coach of the Indonesian basketball national team will select the players for become a member of the core team. The coach will judge five players $A, B, C, D$ and $E$ in one simulation (or trial) match with total time $80$ minute match. At any time there is only one in five players that is playing. There is no limit to the number of substitutions during the match. Total playing time for each player $A, B$, and $C$ are multiples of $5$ minutes, while the total playing time of each players $D$ and $E$ are multiples of $7$ minutes. How many ways each player on the field based on total playing time?

$2n$ real numbers with a positive sum are aligned in a circle. For each of the numbers, we can see there are two sets of $n$ numbers such that this number is on the end. Prove that at least one of the numbers has a positive sum for both of these two sets.

A country has two capitals and several towns. Some of them are connected by roads. Some of the roads are toll roads where a fee is charged for driving along them. It is known that any route from the south capital to the north capital contains at least ten toll roads. Prove that all toll roads can be distributed among ten companies so that anybody driving from the south capital to the north capital must pay each of these companies. [i](5 points)[/i]

Define a [i]domino[/i] to be an ordered pair of [i]distinct[/i] positive integers. A [i]proper sequence[/i] of dominoes is a list of distinct dominoes in which the first coordinate of each pair after the first equals the second coordinate of the immediately preceding pair, and in which $(i, j)$ and $(j, i)$ do not [i]both[/i] appear for any $i$ and $j$. Let $D_n$ be the set of all dominoes whose coordinates are no larger than $n$. Find the length of the longest proper sequence of dominoes that can be formed using the dominoes of $D_n$.

Some of $n$ towns are connected by two-way airlines. There are $m$ airlines in total. For $i = 1, 2, \cdots, n$, let $d_i$ be the number of airlines going from town $i$. If $1\le d_i \le 2010$ for each $i = 1, 2,\cdots, 2010$, prove that \[\displaystyle\sum_{i=1}^n d_i^2\le 4022m- 2010n\] Find all $n$ for which equality can be attained. [i]Proposed by Aleksandar Ilic[/i]

Find all functions $f:\mathbb{N}\to\mathbb{N}$ s.t. for all $A\subset \mathbb{N}$ with 2024 elements, the set $$S_A:=\{f^{(k)}(x)\mid k=1,...,2024,x\in A\}$$ also has 2024 elements. ($f^{(k)}=f\circ f\circ...\circ f$ is the $k$-th iteration of $f$.)

[b]p1. [/b]Ed, Fred and George are playing on a see-saw that is slightly off center. When Ed sits on the left side and George, who weighs $100$ pounds, on the right side, they are perfectly balanced. Similarly, if Fred, who weighs $400$ pounds, sits on the left and Ed sits on the right, they are also perfectly balanced. Assuming the see-saw has negligible weight, what is the weight of Ed, in pounds? [b]p2.[/b] How many digits does the product $2^{42}\cdot 5^{38}$ have? [b]p3.[/b] Square $ABCD$ has equilateral triangles drawn external to each side, as pictured. If each triangle is folded upwards to meet at a point $E$, then a square pyramid can be made. If the center of square $ABCD$ is $O$, what is the measure of $\angle OEA$? [img]https://cdn.artofproblemsolving.com/attachments/9/a/39c0096ace5b942a9d3be1eafe7aa7481fbb9f.png[/img] [b]p4.[/b] How many solutions $(x, y)$ in the positive integers are there to $3x + 7y = 1337$ ? [b]p5.[/b] A trapezoid with height $12$ has legs of length $20$ and $15$ and a larger base of length $42$. What are the possible lengths of the other base? [b]p6.[/b] Let $f(x) = 6x + 7$ and $g(x) = 7x + 6$. Find the value of a such that $g^{-1}(f^{-1}(g(f(a)))) = 1$. [b]p7.[/b] Billy and Cindy want to meet at their favorite restaurant, and they have made plans to do so sometime between $1:00$ and $2:00$ this Sunday. Unfortunately, they didn’t decide on an exact time, so they both decide to arrive at a random time between $1:00$ and $2:00$. Silly Billy is impatient, though, and if he has to wait for Cindy, he will leave after $15$ minutes. Cindy, on the other hand, will happily wait for Billy from whenever she arrives until $2:00$. What is the probability that Billy and Cindy will be able to dine together? [b]p8.[/b] As pictured, lines are drawn from the vertices of a unit square to an opposite trisection point. If each triangle has legs with ratio $3 : 1$, what is the area of the shaded region? [img]https://cdn.artofproblemsolving.com/attachments/e/9/35a6340018edcddfcd7e085f8f6e56686a8e07.png[/img] [b]p9.[/b] For any positive integer $n$, let $f_1(n)$ denote the sum of the squares of the digits of $n$. For $k \ge 2$, let $f_k(n) = f_{k-1}(f_1(n))$. Then, $f_1(5) = 25$ and $f_3(5) = f_2(25) = 85$. Find $f_{2012}(15)$. [b]p10.[/b] Given that $2012022012$ has $ 8$ distinct prime factors, find its largest prime factor. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $m$ and $n$ be fixed distinct positive integers. A wren is on an infinite board indexed by $\mathbb Z^2$, and from a square $(x,y)$ may move to any of the eight squares $(x\pm m, y\pm n)$ or $(x\pm n, y \pm m)$. For each $\{m,n\}$, determine the smallest number $k$ of moves required to travel from $(0,0)$ to $(1,0)$, or prove that no such $k$ exists. [i]Proposed by Michael Ren

Each of eight boxes contains six balls. Each ball has been colored with one of $n$ colors, such that no two balls in the same box are the same color, and no two colors occur together in more than one box. Determine, with justification, the smallest integer $n$ for which this is possible.

Call an $n$-tuple $(a_1, . . . , a_n)$ [i]occasionally periodic [/i] if there exist a nonnegative integer $i$ and a positive integer $p$ satisfying $i + 2p \le n$ and $a_{i+j} = a_{i+p+j}$ for every $j = 1, 2, . . . , p$. Let $k$ be a positive integer. Find the least positive integer $n$ for which there exists an $n$-tuple $(a_1, . . . , a_n)$ with elements from set $\{1, 2, . . . , k\}$, which is not occasionally periodic but whose arbitrary extension $(a_1, . . . , a_n, a_{n+1})$ is occasionally periodic for any $a_{n+1} \in \{1, 2, . . . , k\}$.

A positive integer is called sparkly if it has exactly 9 digits, and for any n between 1 and 9 (inclusive), the nth digit is a positive multiple of n. How many positive integers are sparkly?

A polygon is given in which any two adjacent sides are perpendicular. We call its two vertices non-friendly if the bisectors of the polygon emerging from these vertices are perpendicular. Prove that for any vertex the number of vertices that are not friends with it is even.

A large number of rocks are placed on a table. On each turn, one may remove some rocks from the table following these rules: on the first turn, only one rock may be removed, and on every subsequent turn, one may remove either twice as many rocks or the same number of rocks as they have discarded on the previous turn. Determine the minimum number of turns required to remove exactly $2012$ rocks from the table.

The integers $-1$, $2$, $-3$, $4$, $-5$, $6$ are written on a blackboard. At each move, we erase two numbers $a$ and $b$, then we re-write $2a+b$ and $2b+a$. How many of the sextuples $(0,0,0,3,-9,9)$, $(0,1,1,3,6,-6)$, $(0,0,0,3,-6,9)$, $(0,1,1,-3,6,-9)$, $(0,0,2,5,5,6)$ can be gotten? $ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ 5 $

Given a positive integer $n$, we say that a real number $x$ is $n$-good if there exist $n$ positive integers $a_1,...,a_n$ such that $$x=\frac{1}{a_1}+...+\frac{1}{a_n}.$$ Find all positive integers $k$ for which the following assertion is true: if $a,b$ are real numbers such that the closed interval $[a,b]$ contains infinitely many $2020$-good numbers, then the interval $[a,b]$ contains at least one $k$-good number. (Josef Tkadlec, Czech Republic)

Let $n$ and $k$ be positive integers. A simple graph $G$ does not contain any cycle whose length be an odd number greater than $1$ and less than $ 2k + 1$. If $G$ has at most $n + \frac{(k-1) (n-1) (n+2)}{2}$ vertices, prove that the vertices of $G$ can be painted with $n$ colors in such a way that any edge of $G$ has its ends of different colors.

Consider a $25 \times 25$ grid of unit squares. Draw with a red pen contours of squares of any size on the grid. What is the minimal number of squares we must draw in order to colour all the lines of the grid?

Each of the integers from 1 to 4027 has been colored either green or red. Changing the color of a number is making it red if it was green and making it green if it was red. Two positive integers $m$ and $n$ are said to be [i]cuates[/i] if either $\frac{m}{n}$ or $\frac{n}{m}$ is a prime number. A [i]step[/i] consists in choosing two numbers that are cuates and changing the color of each of them. Show it is possible to apply a sequence of steps such that every integer from 1 to 2014 is green.