There are $2016$ costumers who entered a shop on a particular day. Every customer entered the shop exactly once. (i.e. the customer entered the shop, stayed there for some time and then left the shop without returning back.) Find the maximal $k$ such that the following holds: There are $k$ customers such that either all of them were in the shop at a specic time instance or no two of them were both in the shop at any time instance.

We have $10,000$ identical equilateral triangles. Consider the largest regular hexagon that can be formed with these triangles without overlapping. How many triangles will not be used?

A graph $G(V,E)$ is triangle-free, but adding any edges to the graph will form a triangle. It's given that $|V|=2019$, $|E|>2018$, find the minimum of $|E|$ .

(a) Prove that a square with sides $1000$ divided into $31$ squares tiles, at least one of which has a side length less than $1$. (b) Show that a corresponding decomposition into $30$ squares is also possible. [i](Walther Janous)[/i]

Let $n \geq 2$ be a natural. Define $$X = \{ (a_1,a_2,\cdots,a_n) | a_k \in \{0,1,2,\cdots,k\}, k = 1,2,\cdots,n \}$$. For any two elements $s = (s_1,s_2,\cdots,s_n) \in X, t = (t_1,t_2,\cdots,t_n) \in X$, define $$s \vee t = (\max \{s_1,t_1\},\max \{s_2,t_2\}, \cdots , \max \{s_n,t_n\} )$$ $$s \wedge t = (\min \{s_1,t_1 \}, \min \{s_2,t_2,\}, \cdots, \min \{s_n,t_n\})$$ Find the largest possible size of a proper subset $A$ of $X$ such that for any $s,t \in A$, one has $s \vee t \in A, s \wedge t \in A$.

Let $A$ be a $3 \times 9$ matrix. All elements of $A$ are positive integers. We call an $m\times n$ submatrix of $A$ "ox" if the sum of its elements is divisible by $10$, and we call an element of $A$ "carboxylic" if it is not an element of any "ox" submatrix. Find the largest possible number of "carboxylic" elements in $A$.

Let $M$ and $N$ be positive integers. Pisut walks from point $(0, N)$ to point $(M, 0)$ in steps so that $\bullet$ each step has unit length and is parallel to either the horizontal or the vertical axis, and $\bullet$ each point ($x, y)$ on the path has nonnegative coordinates, i.e. $x, y > 0$. During each step, Pisut measures his distance from the axis parallel to the direction of his step, if after the step he ends up closer from the origin (compared to before the step) he records the distance as a positive number, else he records it as a negative number. Prove that, after Pisut completes his walk, the sum of the signed distances Pisut measured is zero.

There are $n{}$ wise men in a hall and everyone sees each other. Each man will wear a black or white hat. The wise men should simultaneously write down on their piece of paper a guess about the color of their hat. If at least one does not guess, they will all be executed. The wise men can discuss a strategy before the test and they know that the layout of the hats will be chosen randomly from the set of all $2^n$ layouts. They want to choose their strategy so that the number of layouts for which everyone guesses correctly is as high as possible. What is this number equal to?

[b]p1.[/b] Let $a$ and $b$ be complex numbers such that $a^3 + b^3 = -17$ and $a + b = 1$. What is the value of $ab$? [b]p2.[/b] Let $AEFB$ be a right trapezoid, with $\angle AEF = \angle EAB = 90^o$. The two diagonals $EB$ and $AF$ intersect at point $D$, and $C$ is a point on $AE$ such that $AE \perp DC$. If $AB = 8$ and $EF = 17$, what is the lenght of $CD$? [b]p3.[/b] How many three-digit numbers $abc$ (where each of $a$, $b$, and $c$ represents a single digit, $a \ne 0$) are there such that the six-digit number $abcabc$ is divisible by $2$, $3$, $5$, $7$, $11$, or $13$? [b]p4.[/b] Let $S$ be the sum of all numbers of the form $\frac{1}{n}$ where $n$ is a postive integer and $\frac{1}{n}$ terminales in base $b$, a positive integer. If $S$ is $\frac{15}{8}$, what is the smallest such $b$? [b]p5.[/b] Sysyphus is having an birthday party and he has a square cake that is to be cut into $25$ square pieces. Zeus gets to make the first straight cut and messes up badly. What is the largest number of pieces Zeus can ruin (cut across)? Diagram? [b]p6.[/b] Given $(9x^2 - y^2)(9x^2 + 6xy + y^2) = 16$ and $3x + y = 2$. Find $x^y$. [b]p7.[/b] What is the prime factorization of the smallest integer $N$ such that $\frac{N}{2}$ is a perfect square, $\frac{N}{3}$ is a perfect cube, $\frac{N}{5}$ is a perfect fifth power? [b]p8.[/b] What is the maximum number of pieces that an spherical watermelon can be divided into with four straight planar cuts? [b]p9.[/b] How many ordered triples of integers $(x,y,z)$ are there such that $0 \le x, y, z \le 100$ and $$(x - y)^2 + (y - z)^2 + (z - x)^2 \ge (x + y - 2z) + (y + z - 2x)^2 + (z + x - 2y)^2.$$ [b]p10.[/b] Find all real solutions to $(2x - 4)^2 + (4x - 2)^3 = (4x + 2x - 6)^3$. [b]p11.[/b] Let $f$ be a function that takes integers to integers that also has $$f(x)=\begin{cases} x - 5\,\, if \,\, x \ge 50 \\ f (f (x + 12)) \,\, if \,\, x < 50 \end{cases}$$ Evaluate $f (2) + f (39) + f (58).$ [b]p12.[/b] If two real numbers are chosen at random (i.e. uniform distribution) from the interval $[0,1]$, what is the probability that theit difference will be less than $\frac35$? [b]p13.[/b] Let $a$, $b$, and $c$ be positive integers, not all even, such that $a < b$, $b = c - 2$, and $a^2 + b^2 = c^2$. What is the smallest possible value for $c$? [b]p14.[/b] Let $ABCD$ be a quadrilateral whose diagonals intersect at $O$. If $BO = 8$, $OD = 8$, $AO = 16$, $OC = 4$, and $AB = 16$, then find $AD$. [b]p15.[/b] Let $P_0$ be a regular icosahedron with an edge length of $17$ units. For each nonnegative integer $n$, recursively construct $P_{n+1}$ from Pn by performing the following procedure on each face of $P_n$: glue a regular tetrahedron to that face such that three of the vertices of the tetrahedron are the midpoints of the three adjacent edges of the face, and the last vertex extends outside of $P_n$. Express the number of square units in the surface area of $P_{17}$ in the form $$\frac{u^v\cdot w \sqrt{x}}{y^z}$$ , where $u, v, w, x, y$, and $z$ are integers, all greater than or equal to $2$, that satisfy the following conditions: the only perfect square that evenly divides $x$ is $1$, the GCD of $u$ and y is $1$, and neither $u$ nor $y$ divides $w$. Answers written in any other form will not be considered correct! PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A tetrahedron is given. Determine whether it is possible to put some 10 consecutive positive integers at 4 vertices and at 6 midpoints of the edges so that the number at the midpoint of each edge is equal to the arithmetic mean of two numbers at the endpoints of this edge.

There are $100$ white points on a circle. Asya and Borya play the following game: they alternate, starting with Asya, coloring a white point in green or blue. Asya wants to obtain as much as possible pairs of adjacent points of distinct colors, while Borya wants these pairs to be as less as possible. What is the maximal number of such pairs Asya can guarantee to obtain, no matter how Borya plays.

Find the smallest integer $n$ such that an $n\times n$ square can be partitioned into $40\times 40$ and $49\times 49$ squares, with both types of squares present in the partition, if a) $40|n$; b) $49|n$; c) $n\in \mathbb N$.

Let $n$ be an even positive integer. On a board n real numbers are written. In a single move we can erase any two numbers from the board and replace each of them with their product. Prove that for every $n$ initial numbers one can in finite number of moves obtain $n$ equal numbers on the board.

Alberto and Barbara are sitting one next to each other in front of a table onto which they arranged in a line $15$ chocolates. Some of them are milk chocolates, while the others are dark chocolates. Starting from Alberto, they play the following game: during their turn, each player eats a positive number of consecutive chocolates, starting from the leftmost of the remaining ones, so that the number of chocolates eaten that are of the same type as the first one is odd (for example, if after some turns the sequence of the remaining chocolates is $\text{MMDMD},$ where $\text{M}$ stands for $\emph{milk}$ and $\text{D}$ for $\emph{dark},$ the player could either eat the first chocolate, the first $4$ chocolates or all $5$ of them). The player eating the last chocolate wins. Among all $2^{15}$ possible initial sequences of chocolates, how many of them allow Barbara to have a winning strategy?

There are $n > 2022$ cities in the country. Some pairs of cities are connected with straight two-ways airlines. Call the set of the cities {\it unlucky}, if it is impossible to color the airlines between them in two colors without monochromatic triangle (i.e. three cities $A$, $B$, $C$ with the airlines $AB$, $AC$ and $BC$ of the same color). The set containing all the cities is unlucky. Is there always an unlucky set containing exactly 2022 cities?

Each face and each vertex of a regular tetrahedron is coloured red or blue. How many different ways of colouring are there? (Two tetrahedrons are said to have the same colouring if we can rotate them suitably so that corresponding faces and vertices are of the same colour.

Farhad has made a machine. When the machine starts, it prints some special numbers. The property of this machine is that for every positive integer $n$, it prints exactly one of the numbers $n,2n,3n$. We know that the machine prints $2$. Prove that it doesn't print $13824$.

Let $A$ be the sequence of zeroes and ones (binary sequence). The sequence can be modified by the following operation: we may pick a block or a contiguous subsequence where there are an unequal number of zeroes and ones, and then flip their order within the block (so block $a_1, a_2, \ldots, a_r$ becomes $a_r, a_{r-1}, \ldots, a_1$). As an example, let $A$ be the sequence $1,1,0,0,1$. We can pick block $1,0,0$ and flip it, so the sequence $1,\boxed{1,0,0},1$ becomes $1,\boxed{0,0,1},1$. However, we cannot pick block $1,1,0,0$ and flip their order since they contain the same number of $1$s and $0$s. Two sequences $A$ and $B$ are called [i]related[/i] if $A$ can be transformed into $B$ using a finite number the operation mentioned above. Determine the largest natural number $n$ for which there exists $n$ different sequences $A_1, A_2, \ldots, A_n$ where each sequence consists of 2022 digits, and for every index $i \neq j$, the sequence $A_i$ is not related to $A_j$.

At first, on a board, the number $1$ is written $100$ times. Every minute, we pick a number $a$ from the board, erase it, and write $a/3$ thrice instead. We say that a positive integer $n$ is [i]persistent[/i] if after any amount of time, regardless of the numbers we pick, we can find at least $n$ equal numbers on the board. Find the greatest persistent number.

Students are in classroom with $n$ rows. In each row there are $m$ tables. It's given that $m,n \geq 3$. At each table there is exactly one student. We call neighbours of the student students sitting one place right, left to him, in front of him and behind him. Each student shook hands with his neighbours. In the end there were $252$ handshakes. How many students were in the classroom?

By a partition $\pi$ of an integer $n\ge 1$, we mean here a representation of $n$ as a sum of one or more positive integers where the summands must be put in nondecreasing order. (E.g., if $n=4$, then the partitions $\pi$ are $1+1+1+1$, $1+1+2$, $1+3, 2+2$, and $4$). For any partition $\pi$, define $A(\pi)$ to be the number of $1$'s which appear in $\pi$, and define $B(\pi)$ to be the number of distinct integers which appear in $\pi$. (E.g., if $n=13$ and $\pi$ is the partition $1+1+2+2+2+5$, then $A(\pi)=2$ and $B(\pi) = 3$). Prove that, for any fixed $n$, the sum of $A(\pi)$ over all partitions of $\pi$ of $n$ is equal to the sum of $B(\pi)$ over all partitions of $\pi$ of $n$.

Determine all integers $n \geq 3$ for which there exists a conguration of $n$ points in the plane, no three collinear, that can be labelled $1$ through $n$ in two different ways, so that the following condition be satisfied: For every triple $(i,j,k), 1 \leq i < j < k \leq n$, the triangle $ijk$ in one labelling has the same orientation as the triangle labelled $ijk$ in the other, except for $(i,j,k) = (1,2,3)$.

The endpoints of a compass are at two lattice points of an infinite unit square grid. It is allowed to rotate the compass around one of its endpoints, not varying its radius, and thus move the other endpoint to another lattice point. Can the endpoints of the compass change places after several such steps?

Let there be a tiger, William, at the origin. William leaps $ 1$ unit in a random direction, then leaps $2$ units in a random direction, and so forth until he leaps $15$ units in a random direction to celebrate PUMaC’s 15th year. There exists a circle centered at the origin such that the probability that William is contained in the circle (assume William is a point) is exactly $1/2$ after the $15$ leaps. The area of that circle can be written as $A\pi$. What is $A$?

What is the smallest number of $3$-cell corners needed to be painted in a $6\times 6$ square so that it was impossible to paint more than one corner of it? (The painted corners should not overlap.)