[b]p1[/b]. Prove that there is no interger $n$ such that $n^2 +1$ is divisible by $7$. [b]p2.[/b] Find all solutions of the system $$x^2-yz=1$$ $$y^2-xz=2$$ $$z^2-xy=3$$ [b]p3.[/b] A triangle with long legs is an isoceles triangle in which the length of the two equal sides is greater than or equal to the length of the remaining side. What is the maximum number, $n$ , of points in the plane with the property that every three of them form the vertices of a triangle with long legs? Prove all assertions. [b]p4.[/b] Prove that the area of a quadrilateral of sides $a, b, c, d$ which can be inscribed in a circle and circumscribed about another circle is given by $A=\sqrt{abcd}$ [b]p5.[/b] Prove that all of the squares of side length $$\frac{1}{2},\frac{1}{3},\frac{1}{4},\frac{1}{5},\frac{1}{6},...,\frac{1}{n},...$$ can fit inside a square of side length $1$ without overlap. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The lock of a safe consists of 3 wheels, each of which may be set in 8 different ways positions. Due to a defect in the safe mechanism the door will open if any two of the three wheels are in the correct position. What is the smallest number of combinations which must be tried if one is to guarantee being able to open the safe (assuming the "right combination" is not known)?

In the Cartesian plane, each point with integer coordinates is colored either red, green, or blue. It is possible to form right isosceles triangles ($45^\circ - 90^\circ - 45^\circ$) using colored points as vertices. Prove that regardless of how the coloring is done, there always exists a right isosceles triangle such that all its vertices are either the same color or all different colors.

[b]p1.[/b] Jose,, Luciano, and Placido enjoy playing cards after their performances, and you are invited to deal. They use just nine cards, numbered from $2$ through $10$, and each player is to receive three cards. You hope to hand out the cards so that the following three conditions hold: A) When Jose and Luciano pick cards randomly from their piles, Luciano most often picks a card higher than Jose, B) When Luciano and Placido pick cards randomly from their piles, Placido most often picks a card higher than Luciano, C) When Placido and Jose pick cards randomly from their piles, Jose most often picks a card higher than Placido. Explain why it is impossible to distribute the nine cards so as to satisfy these three conditions, or give an example of one such distribution. [b]p2.[/b] Is it possible to fill a rectangular box with a finite number of solid cubes (two or more), each with a different edge length? Justify your answer. [b]p3.[/b] Two parallel lines pass through the points $(0, 1)$ and $(-1, 0)$. Two other lines are drawn through $(1, 0)$ and $(0, 0)$, each perpendicular to the ¯rst two. The two sets of lines intersect in four points that are the vertices of a square. Find all possible equations for the first two lines. [b]p4.[/b] Suppose $a_1, a_2, a_3,...$ is a sequence of integers that represent data to be transmitted across a communication channel. Engineers use the quantity $$G(n) =(1 - \sqrt3)a_n -(3 - \sqrt3)a_{n+1} +(3 + \sqrt3)a_{n+2}-(1+ \sqrt3)a_{n+3}$$ to detect noise in the signal. a. Show that if the numbers $a_1, a_2, a_3,...$ are in arithmetic progression, then $G(n) = 0$ for all $n = 1, 2, 3, ...$. b. Show that if $G(n) = 0$ for all $n = 1, 2, 3, ...$, then $a_1, a_2, a_3,...$ is an arithmetic progression. [b]p5.[/b] The Olive View Airline in the remote country of Kuklafrania has decided to use the following rule to establish its air routes: If $A$ and $B$ are two distinct cities, then there is to be an air route connecting $A$ with $B$ either if there is no city closer to $A$ than $B$ or if there is no city closer to $B$ than $A$. No further routes will be permitted. Distances between Kuklafranian cities are never equal. Prove that no city will be connected by air routes to more than ¯ve other cities. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

On an infinite white checkered sheet, a square $Q$ of size $12$ × $12$ is selected. Petya wants to paint some (not necessarily all!) cells of the square with seven colors of the rainbow (each cell is just one color) so that no two of the $288$ three-cell rectangles whose centers lie in $Q$ are the same color. Will he succeed in doing this? (Two three-celled rectangles are painted the same if one of them can be moved and possibly rotated so that each cell of it is overlaid on the cell of the second rectangle having the same color.) (Bogdanov. I)

Prove that among arbitrary $13$ points in plane with coordinates as integers, such that no three are collinear, we can pick three points as vertices of triangle such that its centroid has coordinates as integers.

A [i] magic square[/i] is a $3\times 3$ grid of numbers in which the sums of the numbers in each row, column, and long diagonal are all equal. How many magic squares exist where each of the integers from $11$ to $19$ inclusive is used exactly once and two of the numbers are already placed as shown below? $\begin{tabular}{|l|l|l|l|} \hline & & 18 \\ \hline & 15 & \\ \hline & & \\ \hline \end{tabular}$

There are $100$ apparently identical coins, where at least one of them is counterfeit . The real ones coins are of equal weight and counterfeit coins are also of equal weight, but lighter than the real ones. Explain how the number of counterfeit coins can be found, using a pan balance, at most $51$ times.

Students in a school are arranged in an order that when you count from left to right, there will be $n$ students in the first row, $n-1$ students in the second row, $n - 2$ students in the third row,... until there is one student in the $n$th row. All the students face to the first row. For example, here is an arrangement for $n = 5$, where each $*$ represents one student: $*$ $* *$ $* * *$ $* * * *$ $* * * * *$ (first row) Each student will pick one of two following statement (except the student standing at the beginning of the row): i) The guy before me is telling the truth, while the guy standing next to him on the left is lying. ii) The guy before me is lying, while the guy standing next to him on the left is telling the truth. For $n = 2015$, find the maximum number of students telling the truth. (A student is lying if what he said is not true. Otherwise, he is telling the truth.)

There are two round tables with $n{}$ dwarves sitting at each table. Each dwarf has only two friends: his neighbours to the left and to the right. A good wizard wants to seat the dwarves at one round table so that each two neighbours are friends. His magic allows him to make any $2n$ pairs of dwarves into pairs of friends (the dwarves in a pair may be from the same or from different tables). However, he knows that an evil sorcerer will break $n{}$ of those new friendships. For which $n{}$ is the good wizard able to achieve his goal no matter what the evil sorcerer does? [i]Mikhail Svyatlovskiy[/i]

9.2 Given 19 cards. Is it possible to write a nonzero digit on each card in such a way that you can compose from these cards an unique 19-digits number, which is divisible by 11? ([i]R. Zhenodarov, I. Bogdanov[/i])

The positive numbers $a_1, a_2, \ldots , a_{2024}$ are placed on a circle clockwise in this order. Let $A_i$ be the arithmetic mean of the number $a_i$ and one or several following it clockwise. Prove that the largest of the numbers $A_1, A_2, \ldots , A_{2024}$ is not less than the arithmetic mean of all numbers $a_1, a_2, \ldots , a_{2024}$.

On the plane painted $101$ points in brown and another $101$ points in green so that there are no three lying on one line. It turns out that the sum of the lengths of all $5050$ segments with brown ends equals the length of all $5050$ segments with green ends equal to $1$, and the sum of the lengths of all $10201$ segments with multicolored equals $400$. Prove that it is possible to draw a straight line so that all brown points are on one side relative to it and all green points are on the other.

Alice and Bob play a number game. Starting with a positive integer $n$ they take turns changing the number with Alice going first. Each player may change the current number $k$ to either $k-1$ or $\lceil k/2\rceil$. The person who changes $1$ to $0$ wins. Determine all $n$ such that Alice has a winning strategy.

We call a subset $B$ of natural numbers [i]loyal[/i] if there exists natural numbers $i\le j$ such that $B=\{i,i+1,\ldots,j\}$. Let $Q$ be the set of all [i]loyal[/i] sets. For every subset $A=\{a_1<a_2<\ldots<a_k\}$ of $\{1,2,\ldots,n\}$ we set \[f(A)=\max_{1\le i \le k-1}{a_{i+1}-a_i}\qquad\text{and}\qquad g(A)=\max_{B\subseteq A, B\in Q} |B|.\] Furthermore, we define \[F(n)=\sum_{A\subseteq \{1,2,\ldots,n\}} f(A)\qquad\text{and}\qquad G(n)=\sum_{A\subseteq \{1,2,\ldots,n\}} g(A).\] Prove that there exists $m\in \mathbb N$ such that for each natural number $n>m$ we have $F(n)>G(n)$. (By $|A|$ we mean the number of elements of $A$, and if $|A|\le 1$, we define $f(A)$ to be zero). [i]Proposed by Javad Abedi[/i]

Let $2n + 3$ points be given in the plane in such a way that no three lie on a line and no four lie on a circle. Prove that the number of circles that pass through three of these points and contain exactly $n$ interior points is not less than $\frac 13 \binom{2n+3}{2}.$

A zig-zag in the plane consists of two parallel half-lines connected by a line segment. Find $z_n$, the maximum number of regions into which $n$ zig-zags can divide the plane. For example, $z_1=2,z_2=12$(see the diagram). Of these $z_n$ regions how many are bounded? [The zig-zags can be as narrow as you please.] Express your answers as polynomials in $n$ of degree not exceeding $2$. [asy] draw((30,0)--(-70,0), Arrow); draw((30,0)--(-20,-40)); draw((-20,-40)--(80,-40), Arrow); draw((0,-60)--(-40,20), dashed, Arrow); draw((0,-60)--(0,15), dashed); draw((0,15)--(40,-65),dashed, Arrow); [/asy]

There are three colleges in a town. Each college has $n$ students. Any student of any college knows $n+1$ students of the other two colleges. Prove that it is possible to choose a student from each of the three colleges so that all three students would know each other.

[b]p1.[/b] A function $f$ defined on the set of positive numbers satisfies the equality $$f(xy) = f(x) + f(y), x, y > 0.$$ Find $f(2007)$ if $f\left( \frac{1}{2007} \right) = 1$. [b]p2.[/b] The plane is painted in two colors. Show that there is an isosceles right triangle with all vertices of the same color. [b]p3.[/b] Show that the number of ways to cut a $2n \times 2n$ square into $1\times 2$ dominoes is divisible by $2$. [b]p4.[/b] Two mirrors form an angle. A beam of light falls on one mirror. Prove that the beam is reflected only finitely many times (even if the angle between mirrors is very small). [b]p5.[/b] A sequence is given by the recurrence relation $a_{n+1} = (s(a_n))^2 +1$, where $s(x)$ is the sum of the digits of the positive integer $x$. Prove that starting from some moment the sequence is periodic. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Suppose $n$ is a positive integer, $4n$ teams participate in a football tournament. In each round of the game, we will divide the $4n$ teams into $2n$ pairs, and each pairs play the game at the same time. After the tournament, it is known that every two teams have played at most one game. Find the smallest positive integer $a$, so that we can arrange a schedule satisfying the above conditions, and if we take one more round, there is always a pair of teams who have played in the game.

For a convex $n$-gon $P_n$, we say that a convex quadrangle $Q$ is a [i]diagonal-quadrangle[/i] of $P_n$, if its vertices are vertices of $P_n$ and its sides are diagonals of $P_n$. Let $d_n$ be the number of diagonal-quadrangles of a convex $n$-gon. Determine $d_n$ for all $n\geq 8$.

Prove that from an $n\times n$ grid, one can find $\Omega (n^{\frac{5}{3}})$ points such that no four of them are vertices of a square with sides parallel to lines of the grid. Imagine yourself as Erdos (!) and guess what is the best exponent instead of $\frac{5}{3}$!

Danny likes seven-digit numbers with the following property: the 1's digit is divisible by the 10's digit, the 10's digit is divisible by the 100's digit, and so on. For example, Danny likes the number $1133366$ but doesn't like $9999993$. Is the amount of numbers Danny likes divisible by $7$?

Let $n$ be a positive integer relatively prime to $6$. We paint the vertices of a regular $n$-gon with three colours so that there is an odd number of vertices of each colour. Show that there exists an isosceles triangle whose three vertices are of different colours.

Let $n$ be an even positive integer. There are $n$ real numbers written on the blackboard. In every step, we choose two numbers, erase them, and replace each of them with their product. Show that for any initial $n$-tuple it is possible to obtain $n$ equal numbers on the blackboard after a finite number of steps.