Five people are gathered in a meeting. Some pairs of people shakes hands. An ordered triple of people $(A,B,C)$ is a [i]trio[/i] if one of the following is true: [list] [*]A shakes hands with B, and B shakes hands with C, or [*]A doesn't shake hands with B, and B doesn't shake hands with C. [/list] If we consider $(A,B,C)$ and $(C,B,A)$ as the same trio, find the minimum possible number of trios.

The expression $*3^5*3^4*3^3*3^2*3*1$ is given. Ana and Branka alternately change the signs $*$ to $+$ or $-$ (one time each turn). Can Branka, who plays second, do this so as to obtain an expression whose value is divisible by $7$?

Integer $n>2$ is given. Find the biggest integer $d$, for which holds, that from any set $S$ consisting of $n$ integers, we can find three different (but not necesarilly disjoint) nonempty subsets, such that sum of elements of each of them is divisible by $d$.

Let $n$ be a positive integer. Two players, Alice and Bob, are playing the following game: - Alice chooses $n$ real numbers; not necessarily distinct. - Alice writes all pairwise sums on a sheet of paper and gives it to Bob. (There are $\frac{n(n-1)}{2}$ such sums; not necessarily distinct.) - Bob wins if he finds correctly the initial $n$ numbers chosen by Alice with only one guess. Can Bob be sure to win for the following cases? a. $n=5$ b. $n=6$ c. $n=8$ Justify your answer(s). [For example, when $n=4$, Alice may choose the numbers 1, 5, 7, 9, which have the same pairwise sums as the numbers 2, 4, 6, 10, and hence Bob cannot be sure to win.]

A [i]mixing[/i] of the sequence $a_1,a_2,\dots ,a_{3n}$ is called the following sequence: $a_3,a_6,\dots ,a_{3n},a_2,a_5,\dots ,a_{3n-1},a_1,a_4,\dots ,a_{3n-2}$. Is it possible after finite amount of [i]mixings[/i] to reach the sequence $192,191,\dots ,1$ from $1,2,\dots ,192$?

Given is the set $M_n=\{0, 1, 2, \ldots, n\}$ of nonnegative integers less than or equal to $n$. A subset $S$ of $M_n$ is called [i]outstanding[/i] if it is non-empty and for every natural number $k\in S$, there exists a $k$-element subset $T_k$ of $S$. Determine the number $a(n)$ of outstanding subsets of $M_n$. [i](41st Austrian Mathematical Olympiad, National Competition, part 1, Problem 3)[/i]

[b]p1.[/b] It can be shown in Calculus that the area between the x-axis and the parabola $y=kx^2$ (к is a positive constant) on the $x$-interval $0 \le x \le a$ is $\frac{ka^3}{3}$ a) Find the area between the parabola $y=4x^2$ and the x-axis for $0 \le x \le 3$. b) Find the area between the parabola $y=5x^2$ and the x-axis for $-2 \le x \le 4$. c) A square $2$ by $2$ dartboard is situated in the $xy$-plane with its center at the origin and its sides parallel to the coordinate axes. Darts that are thrown land randomly on the dartboard. Find the probability that a dart will land at a point of the dartboard that is nearer to the point $(0, 1)$ than to the bottom edge of the dartboard. [b]p2.[/b] When two rows of a determinant are interchanged, the value of the determinant changes sign. There are also certain operations which can be performed on a determinant which leave its value unchanged. Two such operations are changing any row by adding a constant multiple of another row to it, and changing any column by adding a constant multiple of another column to it. Often these operations are used to generate lots of zeroes in a determinant in order to simplify computations. In fact, if we can generate zeroes everywhere below the main diagonal in a determinant, the value of the determinant is just the product of all the entries on that main diagonal. For example, given the determinant $\begin{vmatrix} 1 & 2 & 3 \\ 2 & 6 & 2 \\ 3 & 10 & 4 \end{vmatrix}$ we add $-2$ times the first row to the second row, then add $-2$ times the second row to the third row, giving the new determinant $\begin{vmatrix} 1 & 2 & 3 \\ 0 & 2 & -4 \\ 0 & 0 & 3 \end{vmatrix}$ , and the value is the product of the diagonal entries: $6$. a) Transform this determinant into another determinant with zeroes everywhere below the main diagonal, and find its value: $\begin{vmatrix} 1 & 3 & -1 \\ 4 & 7 & 2 \\ 3 & -6 & 5 \end{vmatrix}$ b) Do the same for this determinant: $\begin{vmatrix} 0 & 1 & 2 & 3 \\ 1 & 0 & 1 & 2 \\ 2 & 1 & 0 & 1 \\ 3 & 2 & 1 & 0 \end{vmatrix}$ [b]p3.[/b] In Pascal’s triangle, the entries at the ends of each row are both $1$, and otherwise each entry is the sum of the two entries diagonally above it: Row Number $0\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,1$ $1\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\, 1 \,\,\,1$ $2\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\, 1 \,\, 2 \,\,1$ $3\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\, 1\,\, 3 \,\, 3 \,\, 1$ $4\,\,\,\,\,\,\,\,\,\,\,\,\,\,1 \,\,4 \,\, 6 \,\, 4 \,\, 1$ $...\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,...$ This triangle gives the binomial coefficients in expansions like $( a + b)^3 = 1a^3 + 3a^2 b + 3 ab^2 + 1b^3$ . a) What is the sum of the numbers in row #$5$ of Pascal's triangle? b) What is the sum of the numbers in row #$n$ of Pascal's triangle? c) Show that in row #$6$ of Pascal's triangle, the sum of all the numbers is exactly twice the sum of the first, third, fifth, and seventh numbers in the row. d) Prove that in row #$n$ of Pascal's triangle, the sum of ail the numbers is exactly twice the sum of the numbers in the odd positions of that row. [b]p4.[/b] The product: of several terms is sometimes described using the symbol $\Pi$ which is capital pi, the Greek equivalent of $p$, for the word "product". For example the symbol $\prod^4_{k=1}(2k +1)$ means the product of numbers of the form $(2k + 1)$, for $k=1,2,3,4$. Thus it equals $945$. a) Evaluate as a reduced fraction $\prod_{k=1}^{10} \frac{k}{k + 2}$ b) Evaluate as a reduced fraction $\prod_{k=1}^{10} \frac{k^2 + 10k+ 17}{k^2+4k + 41}$ c) Evaluate as a reduced fraction $\prod_{k=1}^{\infty}\frac{k^3-1}{k^3+1}$ [b]p5.[/b] a) In right triangle $CAB$, the median $AF$, the angle bisector $AE$, and the altitude $AD$ divide the right angld $A$ into four equal angles. If $AB = 1$, find the area of triangle $AFE$. [img]https://cdn.artofproblemsolving.com/attachments/5/1/0d4a83e58a65c2546ce25d1081b99d45e30729.png[/img] b) If in any triangle, an angle is divided into four equal angles by the median, angle bisector, and altitude drawn from that angle, prove that the angle must be a right angle. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[u]Round 1[/u] [b]p1. [/b]The Queen of Bees invented a new language for her hive. The alphabet has only $6$ letters: A, C, E, N, R, T; however, the alphabetic order is different than in English. A word is any sequence of $6$ different letters. In the dictionary for this language, the word TRANCE immediately follows NECTAR. What is the last word in the dictionary? [b]p2.[/b] Is it possible to solve the equation $\frac{1}{x}= \frac{1}{y} +\frac{1}{z}$ with $x,y,z$ integers (positive or negative) such that one of the numbers $x,y,z$ has one digit, another has two digits, and the remaining one has three digits? [b]p3.[/b] The $10,000$ dots in a $100\times 100$ square grid are all colored blue. Rekha can paint some of them red, but there must always be a blue dot on the line segment between any two red dots. What is the largest number of dots she can color red? The picture shows a possible coloring for a $5\times 7$ grid. [img]https://cdn.artofproblemsolving.com/attachments/0/6/795f5ab879938ed2a4c8844092b873fb8589f8.jpg[/img] [b]p4.[/b] Six flies rest on a table. You have a swatter with a checkerboard pattern, much larger than the table. Show that there is always a way to position and orient the swatter to kill at least five of the flies. Each fly is much smaller than a swatter square and is killed if any portion of a black square hits any part of the fly. [b]p5.[/b] Maryam writes all the numbers $1-81$ in the cells of a $9\times 9$ table. Tian calculates the product of the numbers in each of the nine rows, and Olga calculates the product of the numbers in every column. Could Tian's and Olga's lists of nine products be identical? [u]Round 2[/u] [b]p6.[/b] A set of points in the plane is epic if, for every way of coloring the points red or blue, it is possible to draw two lines such that each blue point is on a line, but none of the red points are. The figure shows a particular set of $4$ points and demonstrates that it is epic. What is the maximum possible size of an epic set? [img]https://cdn.artofproblemsolving.com/attachments/e/f/44fd1679c520bdc55c78603190409222d0b721.jpg[/img] [b]p7.[/b] Froggy Chess is a game played on a pond with lily pads. First Judit places a frog on a pad of her choice, then Magnus places a frog on a different pad of his choice. After that, they alternate turns, with Judit moving first. Each player, on his or her turn, selects either of the two frogs and another lily pad where that frog must jump. The jump must reduce the distance between the frogs (all distances between the lily pads are different), but both frogs cannot end up on the same lily pad. Whoever cannot make a move loses. The picture below shows the jumps permitted in a particular situation. Who wins the game if there are $2017$ lily pads? [img]https://cdn.artofproblemsolving.com/attachments/a/9/1a26e046a2a614a663f9d317363aac61654684.jpg[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[i]25 problems for 30 minutes.[/i] [b]p1.[/b] Chad, Ravi, Kevin, and Meena are four of the $551$ residents of Chadwick, Illinois. Expressing your answer to the nearest percent, how much of the population do they represent? [b]p2.[/b] Points $A$, $B$, and $C$ are on a line for which $AB = 625$ and $BC = 256$. What is the sum of all possible values of the length $AC$? [b]p3.[/b] An increasing arithmetic sequence has first term $2014$ and common difference $1337$. What is the least odd term of this sequence? [b]p4.[/b] How many non-congruent scalene triangles with integer side lengths have two sides with lengths $3$ and $4$? [b]p5.[/b] Let $a$ and $b$ be real numbers for which the function $f(x) = ax^2+bx+3$ satisfies $f(0)+2^0 = f(1)+2^1 = f(2) + 2^2$. What is $f(0)$? [b]p6.[/b] A pentomino is a set of five planar unit squares that are joined edge to edge. Two pentominoes are considered the same if and only if one can be rotated and translated to be identical to the other. We say that a pentomino is compact if it can fit within a $2$ by $3$ rectangle. How many distinct compact pentominoes exist? [b]p7.[/b] Consider a hexagon with interior angle measurements of $91$, $101$, $107$, $116$, $152$, and $153$ degrees. What is the average of the interior angles of this hexagon, in degrees? [b]p8.[/b] What is the smallest positive number that is either one larger than a perfect cube and one less than a perfect square, or vice versa? [b]p9.[/b] What is the first time after $4:56$ (a.m.) when the $24$-hour expression for the time has three consecutive digits that form an increasing arithmetic sequence with difference $1$? (For example, $23:41$ is one of those moments, while $23:12$ is not.) [b]p10.[/b] Chad has trouble counting. He wants to count from $1$ to $100$, but cannot pronounce the word "three," so he skips every number containing the digit three. If he tries to count up to $100$ anyway, how many numbers will he count? [b]p11.[/b] In square $ABCD$, point $E$ lies on side $BC$ and point $F$ lies on side $CD$ so that triangle $AEF$ is equilateral and inside the square. Point $M$ is the midpoint of segment $EF$, and $P$ is the point other than $E$ on $AE$ for which $PM = FM$. The extension of segment $PM$ meets segment $CD$ at $Q$. What is the measure of $\angle CQP$, in degrees? [b]p12.[/b] One apple is five cents cheaper than two bananas, and one banana is seven cents cheaper than three peaches. How much cheaper is one apple than six peaches, in cents? [b]p13.[/b] How many ordered pairs of integers $(a, b)$ exist for which |a| and |b| are at most $3$, and $a^3-a = b^3-b$? [b]p14.[/b] Five distinct boys and four distinct girls are going to have lunch together around a table. They decide to sit down one by one under the following conditions: no boy will sit down when more boys than girls are already seated, and no girl will sit down when more girls than boys are already seated. How many possible sequences of taking seats exist? [b]p15.[/b] Jordan is swimming laps in a pool. For each lap after the first, the time it takes her to complete is five seconds more than that of the previous lap. Given that she spends 10 minutes on the first six laps, how long does she spend on the next six laps, in minutes? [b]p16.[/b] Chad decides to go to trade school to ascertain his potential in carpentry. Chad is assigned to cut away all the vertices of a wooden regular tetrahedron with sides measuring four inches. Each vertex is cut away by a plane which passes through the three midpoints of the edges adjacent to that vertex. What is the surface area of the resultant solid, in square inches? Note: A tetrahedron is a solid with four triangular faces. In a regular tetrahedron, these faces are all equilateral triangles. [b]p17.[/b] Chad and Jordan independently choose two-digit positive integers. The two numbers are then multiplied together. What is the probability that the result has a units digit of zero? [b]p18.[/b] For art class, Jordan needs to cut a circle out of the coordinate grid. She would like to find a circle passing through at least $16$ lattice points so that her cut is accurate. What is the smallest possible radius of her circle? Note: A lattice point is defined as one whose coordinates are both integers. For example, $(5, 8)$ is a lattice point whereas $(3.5, 5)$ is not. [b]p19.[/b] Chad's ant Arctica is on one of the eight corners of Chad's toolbox, which measures two decimeters in width, three decimeters in length, and four decimeters in height. One day, Arctica wanted to go to the opposite corner of this box. Assuming she can only crawl on the surface of the toolbox, what is the shortest distance she has to crawl to accomplish this task, in decimeters? (You may assume that the toolbox is oating in the Exeter Space Station, so that Arctica can crawl on all six faces.) [b]p20.[/b] Jordan is counting numbers for fun. She starts with the number $1$, and then counts onward, skipping any number that is a divisor of the product of all previous numbers she has said. For example, she starts by counting $1$, $2$, $3$, $4$, $5$, but skips 6, a divisor of $1 \cdot 2 \cdot 3 \cdot 4 \cdot 5 = 120$. What is the $20^{th}$ number she counts? [b]p21.[/b] Chad and Jordan are having a race in the lake shown below. The lake has a diameter of four kilometers and there is a circular island in the middle of the lake with a diameter of two kilometers. They start at one point on the edge of the lake and finish at the diametrically opposite point. Jordan makes the trip only by swimming in the water, while Chad swims to the island, runs across it, and then continues swimming. They both take the fastest possible route and, amazingly, they tie! Chad swims at two kilometers an hour and runs at five kilometers an hour. At what speed does Jordan swim? [img]https://cdn.artofproblemsolving.com/attachments/f/6/22b3b0bba97d25ab7aabc67d30821d0b12efc0.png[/img] [b]p22.[/b] Cameron has stolen Chad's barrel of oil and is driving it around on a truck on the coordinate grid on his truck. Cameron is a bad truck driver, so he can only move the truck forward one kilometer at a $4$ $EMC^2$ $2014$ Problems time along one of the gridlines. In fact, Cameron is so bad at driving the truck that between every two one-kilometer movements, he has to turn exactly $90$ degrees. After $50$ one-kilometer movements, given that Cameron's first one-kilometer movement was westward, how many points he could be on? [b]p23.[/b] Let $a$, $b$, and $c$ be distinct nonzero base ten digits. Assume there exist integers $x$ and $y$ for which $\overline{abc} \cdot \overline{cb} = 100x^2 + 1$ and $\overline{acb} \cdot \overline{bc} = 100y^2 + 1$. What is the minimum value of the number $\overline{abbc}$? Note: The notation $\overline{pqr}$ designates the number whose hundreds digit is $p$, tens digit is $q$, and units digit is $r$, not the product $p \cdot q \cdot r$. [b]p24.[/b] Let $r_1, r_2, r_3, r_4$ and $r_5$ be the five roots of the equation $x^5-4x^4+3x^2-2x+1 = 0$. What is the product of $(r_1 +r_2 +r_3 +r_4)$, $(r_1 +r_2 +r_3 +r_5)$, $(r_1 +r_2 +r_4 +r_5)$, $(r_1 +r_3 +r_4 +r_5)$, and $(r_2 +r_3 +r_4 +r_5)$? [b]p25.[/b] Chad needs seven apples to make an apple strudel for Jordan. He is currently at 0 on the metric number line. Every minute, he randomly moves one meter in either the positive or the negative direction with equal probability. Arctica's parents are located at $+4$ and $-4$ on the number line. They will bite Chad for kidnapping Arctica if he walks onto those numbers. Also, there is one apple located at each integer between $-3$ and $3$, inclusive. Whenever Chad lands on an integer with an unpicked apple, he picks it. What is the probability that Chad picks all the apples without getting bitten by Arctica's parents? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Pieces are placed in some squares of an $8 \times 8$ board sothat: a) There is at least one token in any rectangle with sides $2 \times 1$ or $1\times 2$. b) There are at least two neighboring pieces in any rectangle with sides $7\times 1$ or $1\times 7$. Find the smallest number of tokens that can be taken to fulfill with both conditions.

How many 6-tuples $ (a_1,a_2,a_3,a_4,a_5,a_6)$ are there such that each of $ a_1,a_2,a_3,a_4,a_5,a_6$ is from the set $ \{1,2,3,4\}$ and the six expressions \[ a_j^2 \minus{} a_ja_{j \plus{} 1} \plus{} a_{j \plus{} 1}^2\] for $ j \equal{} 1,2,3,4,5,6$ (where $ a_7$ is to be taken as $ a_1$) are all equal to one another?

Prove that the squares with sides $\frac{1}{1}, \frac{1}{2}, \frac{1}{3},\ldots$ may be put into the square with side $\frac{3}{2} $ in such a way that no two of them have any interior point in common.

A group of people is divided over two busses in such a way that there are as many seats in total as people. The chance that two friends are seated on the same bus is $\frac{1}{2}$. a) Show that the number of people in the group is a square. b) Show that the number of seats on each bus is a triangular number.

If you have $65$ points in a plane, we will make the lines that passes by any two points in this plane and we obtain exactly $2015$ distinct lines, prove that least $4$ points are collinears!!

A set of lines in the plane is in [i]general position[/i] if no two are parallel and no three pass through the same point. A set of lines in general position cuts the plane into regions, some of which have finite area; we call these its [i]finite regions[/i]. Prove that for all sufficiently large $n$, in any set of $n$ lines in general position it is possible to colour at least $\sqrt{n}$ lines blue in such a way that none of its finite regions has a completely blue boundary. [i]Note[/i]: Results with $\sqrt{n}$ replaced by $c\sqrt{n}$ will be awarded points depending on the value of the constant $c$.

On the set $\Sigma$ of points of the plane $\Pi$ we define the operation $*$ which maps each pair $(X, Y )$ of points in $\Sigma$ to the point $Z = X * Y$ that is symmetric to $X$ with respect to $Y .$ Consider a square $ABCD$ in $\Pi$. Is it possible, using the points $A, B, C$ and applying the operation $*$ finitely many times, to construct the point $D?$

Let $A$ be a subset of $\{1, 2, \dots , 1000000\}$ such that for any $x, y \in A$ with $x\neq y$, we have $xy\notin A$. Determine the maximum possible size of $A$.

The plane is divided into regions by $ n \ge 3$ lines, no two of which are parallel, and no three of which are concurrent. Some regions are coloured , in such a way that no two coloured regions share a common segment or half-line of their borders. Prove that the number of coloured regions is at most $ \frac{n(n\plus{}1)}{3}$

In the calculation $HE \times EH = WHEW$, where different letters stand for different nonzero digits. Find the values of all the letters.

There are five smart kids sitting around a round table. Their teacher says: "I gave a few apples to some of you, and none of you have the same amount of apple. Also each of you will know the amount of apple that the person to your left and the person to your right has." The teacher tells the total amount of apples, then asks the kids to guess the difference of the amount of apple that the two kids in front of them have. $a)$ If the total amount of apples is less than $16$, prove that at least one of the kids will guess the difference correctly. $b)$ Prove that the teacher can give the total of $16$ apples such that no one can guess the difference correctly.

Let $S$ be a set containing $n^{2}+n-1$ elements, for some positive integer $n$. Suppose that the $n$-element subsets of $S$ are partitioned into two classes. Prove that there are at least $n$ pairwise disjoint sets in the same class.

In a plane, there is an infinite triangular grid consists of equilateral triangles whose lengths of the sides are equal to $ 1$, call the vertices of the triangles the lattice points, call two lattice points are adjacent if the distance between the two points is equal to $ 1;$ A jump game is played by two frogs $ A,B,$ "A jump" is called if the frogs jump from the point which it is lying on to its adjacent point, " A round jump of $ A,B$" is called if first $ A$ jumps and then $ B$ by the following rules: Rule (1): $ A$ jumps once arbitrarily, then $ B$ jumps once in the same direction, or twice in the opposite direction; Rule (2): when $ A,B$ sits on adjacent lattice points, they carry out Rule (1) finishing a round jump, or $ A$ jumps twice continually, keep adjacent with $ B$ every time, and $ B$ rests on previous position; If the original positions of $ A,B$ are adjacent lattice points, determine whether for $ A$ and $ B$,such that the one can exactly land on the original position of the other after a finite round jumps.

One eastern country was ruled by an old Shah. The population of the country consisted of inhabitants and satraps. Each resident had his own place of residence (place of registration). Satraps moved around the country and carried out the decrees of the Shah. One day the Shah issued a decree containing the following points: 1) Some residents are bandits. 2) Every bandit must be destroyed. 3) Together with the bandit, all those residents who are located closer to the bandit than the Shah (in other words, than the location of the Shah’s palace) must be destroyed. Finding out which of the residents was a bandit was entrusted to the Shah's adviser, known for his connections with one hostile state. Prove that: a) if the country in question is on a plane, then the adviser has the opportunity to declare no more than six inhabitants bandits in such a way that all inhabitants of the country must be destroyed in accordance with the decrees; b) if the country is located on a sphere, then you can get by with five bandits.

Construct a tetromino by attaching two $2 \times 1$ dominoes along their longer sides such that the midpoint of the longer side of one domino is a corner of the other domino. This construction yields two kinds of tetrominoes with opposite orientations. Let us call them $S$- and $Z$-tetrominoes, respectively. Assume that a lattice polygon $P$ can be tiled with $S$-tetrominoes. Prove that no matter how we tile $P$ using only $S$- and $Z$-tetrominoes, we always use an even number of $Z$-tetrominoes. [i]Proposed by Tamas Fleiner and Peter Pal Pach, Hungary[/i]

$37$ points are arbitrarily marked on the plane. Prove that among them there must be either two points at a distance greater than $6$, or two points at a distance less than $1.5$.