Let $A$ be a set containing $4k$ consecutive positive integers, where $k \geq 1$ is an integer. Find the smallest $k$ for which the set A can be partitioned into two subsets having the same number of elements, the same sum of elements, the same sum of the squares of elements, and the same sum of the cubes of elements.

2004 computers make up a network using several cables. If for a subset $S$ in the set of all computers, there isn't a cable that connects two computers in $S$, $S$ is called independant. One lets the arbitrary independant set consists at most 50 computers, and uses the least number of cables. (1) Let $c(L)$ be the number of cables which connects the computer $L$. Prove that for two computers $A,B$, $c(A)=c(B)$ if there is a cable which connects $A$ and $B$, $|c(A)-c(B)|\leq 1$ otherwise. (2) Determine the number of used cables.

Given any positive integer $n$, prove that: [b](a)[/b] Every $n$ points in the closed unit square $[0,1]\times [0,1]$ can be joined by a path of length less than $2\sqrt{n}+4$; and [b](b)[/b] There exist $n$ points in the closed unit square $[0,1]\times [0,1]$ that cannot be joined by a path of length less than $\sqrt{n}-1$.

Let a set $S$ of 2004 points in the plane be given, no three of which are collinear. Let ${\cal L}$ denote the set of all lines (extended indefinitely in both directions) determined by pairs of points from the set. Show that it is possible to colour the points of $S$ with at most two colours, such that for any points $p,q$ of $S$, the number of lines in ${\cal L}$ which separate $p$ from $q$ is odd if and only if $p$ and $q$ have the same colour. Note: A line $\ell$ separates two points $p$ and $q$ if $p$ and $q$ lie on opposite sides of $\ell$ with neither point on $\ell$.

$ N $ grasshoppers are lined up in a row. At any time, one grasshopper is allowed to jump over exactly two grasshoppers standing to the right or left of him. At what $ n $ can grasshoppers rearrange themselves in reverse order?

On the coast of a circular island there are eight different cities. Initially there are no routes between the cities. We have to construct five straight two-way routes, which do not intersect, so that from each city there are one or two routes. In how many ways can this happen?

The workers laid a floor of size $n\times n$ ($10 <n <20$) with two types of tiles: $2 \times 2$ and $5\times 1$. It turned out that they were able to completely lay the floor so that the same number of tiles of each type was used. For which $n$ could this happen? (You can’t cut tiles and also put them on top of each other.)

We define the following operation which will be applied to a row of bars being situated side-by-side on positions $ 1,2,...,N$. Each bar situated at an odd numbered position is left as is, while each bar at an even numbered position is replaced by two bars. After that, all bars will be put side-by-side in such a way that all bars form a new row and are situated on positions $ 1,...,M.$ From an initial number $ a_0>0$ of bars there originates a sequence $ (a_n)_{n \ge 0},$ where $ a_n$ is the number of bars after having applied the operation $ n$ times. $ (a)$ Prove that for no $ n>0$ can we have $ a_n\equal{}1997.$ $ (b)$ Determine all natural numbers that can only occur as $ a_0$ or $ a_1$.

There are $12$ candies on the table, four of which are rare candies. Chad has a friend who can tell rare candies apart from regular candies, but Chad can’t. Chad’s friend is allowed to take four candies from the table, but may not take any rare candies. Can his friend always take four candies in such a way that Chad will then be able to identify the four rare candies? If so, describe a strategy. If not, prove that it cannot be done. Note that Chad does not know anything about how the candies were selected (e.g. the order in which they were selected). However, Chad and his friend may communicate beforehand.

In a country there are $4^9$ schoolchildren living in four cities. At the end of the school year a state examination was held in 9 subjects. It is known that any two students have different marks at least in one subject. However, every two students from the same city got equal marks at least in one subject. Prove that there is a subject such that every two children living in the same city have equal marks in this subject. [i]Fedor Petrov[/i]

Given two forests $A$ and $B$ with \(V(A) = V(B)\), that is the graphs are over same vertex set. Suppose $A$ has [b]strictly more[/b] edges than $B$. Prove that there exists an edge of $A$ which if included in the edge set of $B$, then $B$ will still remain a forest. Graphs are undirected

There are $n$ people in a city, and each of them has exactly $1000$ friends (friendship is always symmetric). Prove that it is possible to select a group $S$ of people such that at least $\frac{n}{2017}$ persons in $S$ have exactly two friends in $S$.

Several soldiers are standing in a row. After a command each of them turned their head either to the left or to the right. After that every second every soldier performs the following operation simultaneously: 1) if the soldier is facing right and the majority of soldiers to the right of him are facing left, he starts facing left; 2) if the soldier is facing left and the majority of soldiers to the left of him are facing right, he starts facing right; 3) otherwise he does nothing. Prove that at some point the process will stop.

Dragoons take up $1\times 1$ squares in the plane with sides parallel to the coordinate axes such that the interiors of the squares do not intersect. A dragoon can fire at another dragoon if the difference in the $x$-coordinates of their centers and the difference in the y-coordinates of their centers are both at most $6$, regardless of any dragoons in between. For example, a dragoon centered at $(4, 5)$ can re at a dragoon centered at the origin, but a dragoon centered at $(7, 0)$ can not. A dragoon cannot fire at itself. What is the maximum number of dragoons that can fire at a single dragoon simultaneously?

All positive integers are coloured either red or green, such that the following conditions are satisfied: - There are equally many red as green integers. - The sum of three (not necessarily distinct) red integers is red. - The sum of three (not necessarily distinct) green integers is green. Find all colourings that satisfy these conditions.

Alice and Bob play the following game. It begins with a set of $1000$ $1\times 2$ rectangles. A [i]move[/i] consists of choosing two rectangles (a rectangle may consist of one or several $1\times 2$ rectangles combined together) that share a common side length and combining those two rectangles into one rectangle along those sides sharing that common length. The first player who cannot make a move loses. Alice moves first. Describe a winning strategy for Bob.

Find the maximum number $E$ such that the following holds: there is an edge-colored graph with 60 vertices and $E$ edges, with each edge colored either red or blue, such that in that coloring, there is no monochromatic cycles of length 3 and no monochromatic cycles of length 5.

[b]p1.[/b] We say that six positive integers form a magic triangle if they are arranged in a triangular array as in the figure below in such a way that each number in the top two rows is equal to the sum of its two neighbors in the row directly below it. The triangle shown is magic because $4 = 1 + 3$, $5 = 3 + 2$, and $9 = 4 + 5$. $$9$$ $$4\,\,\,\,5$$ $$1\,\,\,\,3\,\,\,\,2$$ (a) Find a magic triangle such that the numbers at the three corners are $10$, $20$, and $2010$, with $2010$ at the top. (b) Find a magic triangle such that the numbers at the three corners are $20$, $201$, and $2010$, with $2010$ at the top, or prove that no such triangle exists. [b]p2.[/b] (a) The equalities $\frac12+\frac13+\frac16= 1$ and $\frac12+\frac13+\frac17+\frac{1}{42}= 1$ express $1$ as a sum of the reciprocals of three (respectively four) distinct positive integers. Find five positive integers $a < b < c <d < e$ such that $$\frac{1}{a}+\frac{1}{b}+\frac{1}{c}+\frac{1}{d}+\frac{1}{e}= 1.$$ (b) Prove that for any integer $m \ge 3$, there exist $m$ positive integers $d_1 < d_2 <... < d_m$ such that $$\frac{1}{d_1}+\frac{1}{d_2}+ ... +\frac{1}{d_m}= 1.$$ [b]p3.[/b] Suppose that $P(x) = a_nx^n +... + a_1x + a_0$ is a polynomial of degree n with real coefficients. Say that the real number $b$ is a balance point of $P$ if for every pair of real numbers $a$ and $c$ such that $b$ is the average of $a$ and $c$, we have that $P(b)$ is the average of $P(a)$ and $P(c)$. Assume that $P$ has two distinct balance points. Prove that $n$ is at most $1$, i.e., that $P$ is a linear function. [b]p4.[/b] A roller coaster at an amusement park has a train consisting of $30$ cars, each seating two people next to each other. $60$ math students want to take as many rides as they can, but are told that there are two rules that cannot be broken. First, all $60$ students must ride each time, and second, no two students are ever allowed to sit next to each other more than once. What is the maximal number of roller coaster rides that these students can take? Justify your answer. [b]p5.[/b] Let $ABCD$ be a convex quadrilateral such that the lengths of all four sides and the two diagonals of $ABCD$ are rational numbers. If the two diagonals $AC$ and $BD$ intersect at a point $M$, prove that the length of $AM$ is also a rational number. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine the planar finite configurations $C$ consisting of at least $3$ points, satisfying the following conditions; if $x$ and $y$ are distinct points of $C$, there exist $z\in C$ such that $xyz$ are three vertices of equilateral triangles

A frog started from the origin of the coordinate plane and made $3$ jumps. Each time, the frog jumped a distance of $5$ units and landed on a point with integer coordinates. How many different position possibilities end of the frog there?

Find the maximum number of rectangles with sides equal to 1 and 2 and parallel to the coordinate axes such that each two have an area equal to 1 in common.

Let $a_1, a_2, a_3, \dots$ be an infinite sequence of positive integers, and let $N$ be a positive integer. Suppose that, for each $n > N$, $a_n$ is equal to the number of times $a_{n-1}$ appears in the list $a_1, a_2, \dots, a_{n-1}$. Prove that at least one of the sequence $a_1, a_3, a_5, \dots$ and $a_2, a_4, a_6, \dots$ is eventually periodic. (An infinite sequence $b_1, b_2, b_3, \dots$ is eventually periodic if there exist positive integers $p$ and $M$ such that $b_{m+p} = b_m$ for all $m \ge M$.)

How does one tile a plane, without gaps or overlappings, with the tiles equal to a given irregular quadrilateral?

$5.$Let x be a real number with $0<x<1$ and let $0.c_1c_2c_3...$ be the decimal expansion of x.Denote by $B(x)$ the set of all subsequences of $c_1c_2c_3$ that consist of 6 consecutive digits. For instance , $B(\frac{1}{22})={045454,454545,545454}$ Find the minimum number of elements of $B(x)$ as $x$ varies among all irrational numbers with $0<x<1$

Let $n\geq3$ be an integer. Find the smallest positive integer $k$ with the property that if in a group of $n$ boys for each boy there are at least $k$ other boys that are born in the same year with him, then all the boys are born in the same year.