Find the maximal possible numbers one can choose from $1,\ldots,100$ such that none of the products of non-empty subset of this numbers was a perfect square.

Juku has the first $100$ volumes of the Harrie Totter book series at his home. For every$ i$ and $j$, where $1 \le i < j \le 100$, call the pair $(i, j)$ reversed if volume No. $j$ is before volume No, $i$ on Juku’s shelf. Juku wants to arrange all volumes of the series to one row on his shelf in such a way that there does not exist numbers $i, j, k$, where $1 \le i < j < k \le 100$, such that pairs $(i, j)$ and $(j, k)$ are both reversed. Find the largest number of reversed pairs that can occur under this condition

For what values o f $n$ is it possible to place the integers from $1$ to $n$ inclusive on a circle (not necessarily in order) so that the sum of any two successive integers in the circle is divisible by the next one in the clockwise order? (A Shapovalov)

[b]p1.[/b] $ x,y,z$ are required to be non-negative whole numbers, find all solutions to the pair of equations $$x+y+z=40$$ $$2x + 4y + 17z = 301.$$ [b]p2.[/b] Let $P$ be a point lying between the sides of an acute angle whose vertex is $O$. Let $A,B$ be the intersections of a line passing through $P$ with the sides of the angle. Prove that the triangle $AOB$ has minimum area when $P$ bisects the line segment $AB$. [b]p3.[/b] Find all values of $x$ for which $|3x-2|+|3x+1|=3$. [b]p4.[/b] Prove that $x^2+y^2+z^2$ cannot be factored in the form $$(ax + by + cz) (dx + ey + fz),$$ $a, b, c, d, e, f$ real. [b]p5.[/b] Let $f(x)$ be a continuous function for all real values of $x$ such that $f(a)\le f(b)$ whenever $a\le b$. Prove that, for every real number $r$, the equation $$x + f(x) = r$$ has exactly one solution. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Is it possible to put together $27$ equal cubes, $9$ red, $9$ blue and $9$ white, so as to obtain a big cube in which each row (parallel to an arbitrary edge of the cube) contains three cubes with exactly two different colours? (S. Fomin, Leningrad)

In a certain magical country, there are banknotes in denominations of $2^0, 2^1, 2^2, \ldots$ UAH. Businessman Victor has to make cash payments to $44$ different companies totaling $44000$ UAH, but he does not remember how much he has to pay to each company. What is the smallest number of banknotes Victor should withdraw from an ATM (totaling exactly $44000$ UAH) to guarantee that he would be able to pay all the companies without leaving any change? [i]Proposed by Oleksii Masalitin[/i]

[b]p1.[/b] Evaluate $6^4 +5^4 +3^4 +2^4$. [b]p2.[/b] What digit is most frequent between $1$ and $1000$ inclusive? [b]p3.[/b] Let $n = gcd \, (2^2 \cdot 3^3 \cdot 4^4,2^4 \cdot 3^3 \cdot 4^2)$. Find the number of positive integer factors of $n$. [b]p4.[/b] Suppose $p$ and $q$ are prime numbers such that $13p +5q = 91$. Find $p +q$. [b]p5.[/b] Let $x = (5^3 -5)(4^3 -4)(3^3 -3)(2^3 -2)(1^3 -1)$. Evaluate $2018^x$ . [b]p6.[/b] Liszt the lister lists all $24$ four-digit integers that contain each of the digits $1,2,3,4$ exactly once in increasing order. What is the sum of the $20$th and $18$th numbers on Liszt’s list? [b]p7.[/b] Square $ABCD$ has center $O$. Suppose $M$ is the midpoint of $AB$ and $OM +1 =OA$. Find the area of square $ABCD$. [b]p8.[/b] How many positive $4$-digit integers have at most $3$ distinct digits? [b]p9.[/b] Find the sumof all distinct integers obtained by placing $+$ and $-$ signs in the following spaces $$2\_3\_4\_5$$ [b]p10.[/b] In triangle $ABC$, $\angle A = 2\angle B$. Let $I$ be the intersection of the angle bisectors of $B$ and $C$. Given that $AB = 12$, $BC = 14$,and $C A = 9$, find $AI$ . [b]p11.[/b] You have a $3\times 3\times 3$ cube in front of you. You are given a knife to cut the cube and you are allowed to move the pieces after each cut before cutting it again. What is the minimumnumber of cuts you need tomake in order to cut the cube into $27$ $1\times 1\times 1$ cubes? p12. How many ways can you choose $3$ distinct numbers fromthe set $\{1,2,3,...,20\}$ to create a geometric sequence? [b]p13.[/b] Find the sum of all multiples of $12$ that are less than $10^4$ and contain only $0$ and $4$ as digits. [b]p14.[/b] What is the smallest positive integer that has a different number of digits in each base from $2$ to $5$? [b]p15.[/b] Given $3$ real numbers $(a,b,c)$ such that $$\frac{a}{b +c}=\frac{b}{3a+3c}=\frac{c}{a+3b},$$ find all possible values of $\frac{a +b}{c}$. [b]p16.[/b] Let S be the set of lattice points $(x, y, z)$ in $R^3$ satisfying $0 \le x, y, z \le 2$. How many distinct triangles exist with all three vertices in $S$? [b]p17.[/b] Let $\oplus$ be an operator such that for any $2$ real numbers $a$ and $b$, $a \oplus b = 20ab -4a -4b +1$. Evaluate $$\frac{1}{10} \oplus \frac19 \oplus \frac18 \oplus \frac17 \oplus \frac16 \oplus \frac15 \oplus \frac14 \oplus \frac13 \oplus \frac12 \oplus 1.$$ [b]p18.[/b] A function $f :N \to N$ satisfies $f ( f (x)) = x$ and $f (2f (2x +16)) = f \left(\frac{1}{x+8} \right)$ for all positive integers $x$. Find $f (2018)$. [b]p19.[/b] There exists an integer divisor $d$ of $240100490001$ such that $490000 < d < 491000$. Find $d$. [b]p20.[/b] Let $a$ and $b$ be not necessarily distinct positive integers chosen independently and uniformly at random from the set $\{1,2, 3, ... ,511,512\}$. Let $x = \frac{a}{b}$ . Find the probability that $(-1)^x$ is a real number. [b]p21[/b]. In $\vartriangle ABC$ we have $AB = 4$, $BC = 6$, and $\angle ABC = 135^o$. $\angle ABC$ is trisected by rays $B_1$ and $B_2$. Ray $B_1$ intersects side $C A$ at point $F$, and ray $B_2$ intersects side $C A$ at point $G$. What is the area of $\vartriangle BFG$? [b]p22.[/b] A level number is a number which can be expressed as $x \cdot \lfloor x \rfloor \cdot \lceil x \rceil$ where $x$ is a real number. Find the number of positive integers less than or equal to $1000$ which are also level numbers. [b]p23.[/b] Triangle $\vartriangle ABC$ has sidelengths $AB = 13$, $BC = 14$, $C A = 15$ and circumcenter $O$. Let $D$ be the intersection of $AO$ and $BC$. Compute $BD/DC$. [b]p24.[/b] Let $f (x) = x^4 -3x^3 +2x^2 +5x -4$ be a quartic polynomial with roots $a,b,c,d$. Compute $$\left(a+1 +\frac{1}{a} \right)\left(b+1 +\frac{1}{b} \right)\left(c+1 +\frac{1}{c} \right)\left(d+1 +\frac{1}{d} \right).$$ [b]p25.[/b] Triangle $\vartriangle ABC$ has centroid $G$ and circumcenter $O$. Let $D$ be the foot of the altitude from $A$ to $BC$. If $AD = 2018$, $BD =20$, and $CD = 18$, find the area of triangle $\vartriangle DOG$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The positive integers from 1 to \(n\) are arranged in a sequence, initially in ascending order. In one move, we can swap the positions of two of the numbers, provided they share a common divisor greater than 1. Let \(s_n\) be the number of sequences that can be obtained with a finite number of moves. Prove that \(s_n = a_n!\), where the sequence of positive integers \((a_n)_{n\geq 1}\) is such that for any \(\delta > 0\), there exists an integer \(N\), for which for all \(n\geq N\), the following is true: \[ n - \left(\frac{1}{2}+\delta\right)\frac{n}{\log n} < a_n < n - \left(\frac{1}{2}-\delta\right)\frac{n}{\log n}. \]

The points of space are painted in two colors. Prove that there is a tetrahedron such that all its vertices and its centroid are of the same color.

A chessboard is covered with $32$ dominos. Each domino covers two adjacent squares. Show that the number of horizontal dominos with a white square on the left equals the number with a white square on the right.

[b]p1.[/b] One chilly morning, $10$ penguins ate a total of $50$ fish. No fish was shared by two or more penguins. Assuming that each penguin ate at least one fish, prove that at least two penguins ate the same number of fish. [b]p2.[/b] A triangle of area $1$ has sides of lengths $a > b > c$. Prove that $b > 2^{1/2}$. [b]p3.[/b] Imagine ducks as points in a plane. Three ducks are said to be in a row if a straight line passes through all three ducks. Three ducks, Huey, Dewey, and Louie, each waddle along a different straight line in the plane, each at his own constant speed. Although their paths may cross, the ducks never bump into each other. Prove: If at three separate times the ducks are in a row, then they are always in a row. [b]p4.[/b] Two computers and a number of humans participated in a large round-robin chess tournament (i.e., every participant played every other participant exactly once). In every game, the winner of the game received one point, the loser zero. If a game ended in a draw, each player received half a point. At the end of the tournament, the sum of the two computers' scores was $38$ points, and all of the human participants finished with the same total score. Describe (with proof) ALL POSSIBLE numbers of humans that could have participated in such a tournament. [b]p5.[/b] One thousand cows labeled $000$, $001$,$...$, $998$, $999$ are requested to enter $100$ empty barns labeled $00$, $01$,$...$,$98$, $99$. One hundred Dalmatians - one at the door of each barn - enforce the following rule: In order for a cow to enter a barn, the label of the barn must be obtainable from the label of the cow by deleting one of the digits. For example, the cow labeled $357$ would be admitted into any of the barns labeled $35$, $37$ or $57$, but would not admitted into any other barns. a) Demonstrate that there is a way for all $1000$ cows to enter the barns so that at least $50$ of the barns remain empty. b) Prove that no matter how they distribute themselves, after all $1000$ cows enter the barns, at most $50$ of the barns will remain empty. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A league consists of $2024$ players. A [i]round[/i] involves splitting the players into two different teams and having every member of one team play with every member of the other team. A round is called [i]balanced[/i] if both teams have an equal number of players. A tournament consists of several rounds at the end of which any two players have played each other. The committee organised a tournament last year which consisted of $N$ rounds. Prove that the committee can organise a tournament this year with $N$ balanced rounds. [i]Proposed by Anant Mudgal and Navilarekallu Tejaswi[/i]

A hunter and an invisible rabbit play a game on an infinite square grid. First the hunter fixes a colouring of the cells with finitely many colours. The rabbit then secretly chooses a cell to start in. Every minute, the rabbit reports the colour of its current cell to the hunter, and then secretly moves to an adjacent cell that it has not visited before (two cells are adjacent if they share an edge). The hunter wins if after some finite time either:[list][*]the rabbit cannot move; or [*]the hunter can determine the cell in which the rabbit started.[/list]Decide whether there exists a winning strategy for the hunter. [i]Proposed by Aron Thomas[/i]

Given $n>4$ points in the plane, no three collinear. Prove that there are at least $\frac{(n-3)(n-4)}{2}$ convex quadrilaterals with vertices amongst the $n$ points.

There are $4n$ pebbles of weights $1, 2, 3, \dots, 4n.$ Each pebble is coloured in one of $n$ colours and there are four pebbles of each colour. Show that we can arrange the pebbles into two piles so that the following two conditions are both satisfied: [list] [*]The total weights of both piles are the same. [*] Each pile contains two pebbles of each colour. [/list] [i]Proposed by Milan Haiman, Hungary and Carl Schildkraut, USA[/i]

We are given 5771 weights weighing 1,2,3,...,5770,5771. We partition the weights into $n$ sets of equal weight. What is the maximal $n$ for which this is possible?

Let $ S$ be a set that contains $ n$ elements. Let $ A_{1},A_{2},\cdots,A_{k}$ be $ k$ distinct subsets of $ S$, where $ k\geq 2, |A_{i}| \equal{} a_{i}\geq 1 ( 1\leq i\leq k)$. Prove that the number of subsets of $ S$ that don't contain any $ A_{i} (1\leq i\leq k)$ is greater than or equal to $ 2^n\prod_{i \equal{} 1}^k(1 \minus{} \frac {1}{2^{a_{i}}}).$

For $ n\ge 2$, let $ S_1$, $ S_2$, $ \ldots$, $ S_{2^n}$ be $ 2^n$ subsets of $ A \equal{} \{1, 2, 3, \ldots, 2^{n \plus{} 1}\}$ that satisfy the following property: There do not exist indices $ a$ and $ b$ with $ a < b$ and elements $ x$, $ y$, $ z\in A$ with $ x < y < z$ and $ y$, $ z\in S_a$, and $ x$, $ z\in S_b$. Prove that at least one of the sets $ S_1$, $ S_2$, $ \ldots$, $ S_{2^n}$ contains no more than $ 4n$ elements. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

On a line $n+1$ segments are marked such that one of the points of the line is contained in all of them. Prove that one can find $2$ distinct segments $I, J$ which intersect at a segment of length at least $\frac{n-1}{n}d$, where $d$ is the length of the segment $I$.

When Pablo turns $15$, he throws a party inviting $43$ friends. He presents them with a cake n the form of a regular $15$-sided polygon and on it $15$ candles. The candles are arranged so that between candles and vertices there are never three aligned (any three candles are not aligned, nor are any two candles with a vertex of the polygon, nor are any two vertices of the polygon with a candle). Then Pablo divides the cake into triangular pieces, by means of cuts that join candles to each other or candles and vertices, but also do not intersect with others already made. Why, by doing this, Paul was able to distribute a piece to each of his guests but he was left without eating?

To a sheet of paper, we glue $2011$ “handles” that do not intersect, that is, strips of paper glued to the sheet in your ends. No handle can be twisted. Prove that the surface boundary thus formed has at least two cycles (closed curves). That is, an ant that only walks along the edge of the paper never runs through the entire surface boundary. For example, the configuration represented in the figure has three cycles: one in dashed lines, one in lines dotted lines and another in a continuous line (this cycle passes under a tab twice). [img]https://cdn.artofproblemsolving.com/attachments/f/e/121146a240215f241278b3aabde13a67544e7a.png[/img]

Ati has $ 7$ pots of flower, ordered in $ P_1,P_2,P_3,P_4,P_5,P_6,P_7$. She wants to rearrange the position of those pots to $ B_1,B_2,B_2,B_3,B_4,B_5,B_6,B_7$ such that for every positive integer $ n<7$, $ B_1,B_2,\dots,B_n$ is not the permutation of $ P_1,P_2,\dots,P_7$. In how many ways can Ati do this?

Let $ m,n$ be two natural nonzero numbers and sets $ A \equal{} \{ 1,2,...,n\}, B \equal{} \{1,2,...,m\}$. We say that subset $ S$ of Cartesian product $ A \times B$ has property $ (j)$ if $ (a \minus{} x)(b \minus{} y)\le 0$ for each pairs $ (a,b),(x,y) \in S$. Prove that every set $ S$ with propery $ (j)$ has at most $ m \plus{} n \minus{} 1$ elements. [color=#FF0000]The statement was edited, in order to reflect the actual problem asked. The sign of the inequality was inadvertently reversed into $ (a \minus{} x)(b \minus{} y)\ge 0$, and that accounts for the following two posts.[/color]

4 tokens are placed in the plane. If the tokens are now at the vertices of a convex quadrilateral $P$, then the following move could be performed: choose one of the tokens and shift it in the direction perpendicular to the diagonal of $P$ not containing this token; while shifting tokens it is prohibited to get three collinear tokens. Suppose that initially tokens were at the vertices of a rectangle $\Pi$, and after a number of moves tokens were at the vertices of one another rectangle $\Pi'$ such that $\Pi'$ is similar to $\Pi$ but not equal to $\Pi $. Prove that $\Pi$ is a square.

A chess tournament took place between $2n+1$ players. Every player played every other player once, with no draws. In addition, each player had a numerical rating before the tournament began, with no two players having equal ratings. It turns out there were exactly $k$ games in which the lower-rated player beat the higher-rated player. Prove that there is some player who won no less than $n-\sqrt{2k}$ and no more than $n+\sqrt{2k}$ games.