$A_1, A_2, ..., A_n$ are the subsets of $|S|=2019$ such that union of any three of them gives $S$ but if we combine two of subsets it doesn't give us $S$. Find the maximum value of $n$.

In the country of PUMaC-land, there are $5$ villages and $3$ cities. Vedant is building roads between the $8$ settlements according to the following rules: a) There is at most one road between any two settlements; b) Any city has exactly three roads connected to it; c) Any village has exactly one road connected to it; d) Any two settlements are connected by a path of roads. In how many ways can Vedant build the roads?

In the blackboard there are drawn $25$ points as shown in the figure. Gastón must choose $4$ points that are vertices of a square. In how many different ways can he make this choice?$$\begin{matrix}\bullet & \bullet & \bullet & \bullet & \bullet \\\bullet & \bullet & \bullet & \bullet & \bullet \\\bullet & \bullet & \bullet & \bullet & \bullet \\\bullet & \bullet & \bullet & \bullet & \bullet \\\bullet & \bullet & \bullet & \bullet & \bullet \end{matrix}$$

Among any four people at a party there is one who has met the three others before the party. Show that among any four people at the party there must be one who has met everyone at the party before the party

For all nonempty finite sets of point $S$ on the plane satisfying: $|S|$ is even and for all partitions of $S$ into two subsets $A,B$ of equal size, there is a reflection that maps $A$ to $B$.

[b]p1.[/b] Compute $17^2 + 17 \cdot 7 + 7^2$. [b]p2.[/b] You have $\$1.17$ in the minimum number of quarters, dimes, nickels, and pennies required to make exact change for all amounts up to $\$1.17$. How many coins do you have? [b]p3.[/b] Suppose that there is a $40\%$ chance it will rain today, and a $20\%$ chance it will rain today and tomorrow. If the chance it will rain tomorrow is independent of whether or not it rained today, what is the probability that it will rain tomorrow? (Express your answer as a percentage.) [b]p4.[/b] A number is called boxy if the number of its factors is a perfect square. Find the largest boxy number less than $200$. [b]p5.[/b] Alice, Bob, Carl, and Dave are either lying or telling the truth. If the four of them make the following statements, who has the coin? [i]Alice: I have the coin. Bob: Carl has the coin. Carl: Exactly one of us is telling the truth. Dave: The person who has the coin is male.[/i] [b]p6.[/b] Vicky has a bag holding some blue and some red marbles. Originally $\frac23$ of the marbles are red. After Vicky adds $25$ blue marbles, $\frac34$ of the marbles are blue. How many marbles were originally in the bag? [b]p7.[/b] Given pentagon $ABCDE$ with $BC = CD = DE = 4$, $\angle BCD = 90^o$ and $\angle CDE = 135^o$, what is the length of $BE$? [b]p8.[/b] A Berkeley student decides to take a train to San Jose, stopping at Stanford along the way. The distance from Berkeley to Stanford is double the distance from Stanford to San Jose. From Berkeley to Stanford, the train's average speed is $15$ meters per second. From Stanford to San Jose, the train's average speed is $20$ meters per second. What is the train's average speed for the entire trip? [b]p9.[/b] Find the area of the convex quadrilateral with vertices at the points $(-1, 5)$, $(3, 8)$, $(3,-1)$, and $(-1,-2)$. [b]p10.[/b] In an arithmetic sequence $a_1$, $a_2$, $a_3$, $...$ , twice the sum of the first term and the third term is equal to the fourth term. Find $a_4/a_1$. [b]p11.[/b] Alice, Bob, Clara, David, Eve, Fred, Greg, Harriet, and Isaac are on a committee. They need to split into three subcommittees of three people each. If no subcommittee can be all male or all female, how many ways are there to do this? [b]p12.[/b] Usually, spaceships have $6$ wheels. However, there are more advanced spaceships that have $9$ wheels. Aliens invade Earth with normal spaceships, advanced spaceships, and, surprisingly, bicycles (which have $2$ wheels). There are $10$ vehicles and $49$ wheels in total. How many bicycles are there? [b]p13.[/b] If you roll three regular six-sided dice, what is the probability that the three numbers showing will form an arithmetic sequence? (The order of the dice does matter, but we count both $(1,3, 2)$ and $(1, 2, 3)$ as arithmetic sequences.) [b]p14.[/b] Given regular hexagon $ABCDEF$ with center $O$ and side length $6$, what is the area of pentagon $ABODE$? [b]p15.[/b] Sophia, Emma, and Olivia are eating dinner together. The only dishes they know how to make are apple pie, hamburgers, hotdogs, cheese pizza, and ice cream. If Sophia doesn't eat dessert, Emma is vegetarian, and Olivia is allergic to apples, how many dierent options are there for dinner if each person must have at least one dish that they can eat? [b]p16.[/b] Consider the graph of $f(x) = x^3 + x + 2014$. A line intersects this cubic at three points, two of which have $x$-coordinates $20$ and $14$. Find the $x$-coordinate of the third intersection point. [b]p17.[/b] A frustum can be formed from a right circular cone by cutting of the tip of the cone with a cut perpendicular to the height. What is the surface area of such a frustum with lower radius $8$, upper radius $4$, and height $3$? [b]p18.[/b] A quadrilateral $ABCD$ is dened by the points $A = (2,-1)$, $B = (3, 6)$, $C = (6, 10)$ and $D = (5,-2)$. Let $\ell$ be the line that intersects and is perpendicular to the shorter diagonal at its midpoint. What is the slope of $\ell$? [b]p19.[/b] Consider the sequence $1$, $1$, $2$, $2$, $3$, $3$, $3$, $5$, $5$, $5$, $5$, $5$, $...$ where the elements are Fibonacci numbers and the Fibonacci number $F_n$ appears $F_n$ times. Find the $2014$th element of this sequence. (The Fibonacci numbers are defined as $F_1 = F_2 = 1$ and for $n > 2$, $F_n = F_{n-1}+F_{n-2}$.) [b]p20.[/b] Call a positive integer top-heavy if at least half of its digits are in the set $\{7, 8, 9\}$. How many three digit top-heavy numbers exist? (No number can have a leading zero.) PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The cities of Terra Brasilis are connected by some roads. There are no two cities directly connected by more than one road. It is known that it is possible to go from one city to any other using one or more roads. We call [i]role[/i] any closed road route (ie, it starts in a city and ends in the same city) that does not pass through a city more than once. At Terra Brasilis, all roles go through an odd number of cities. The government of Terra Brasilis decided to close some roles for reform. When you close a role, all it;s roads are closed, so traffic is not allowed on these roads. By doing this, Terra Brasilis was divided into several regions such that from any city in each region it is possible to reach any other in the same region by road, but it is not possible to reach cities in other regions. Prove that the number of regions is odd [hide=original wording]As cidades da Terra Brasilis sao conectadas por algumas estradas. Nao ha duas cidades conectadas diretamente por mais de uma estrada. Sabe-se que, e possivel ir de uma cidade para qualquer outra utilizando uma ou mais estradas. Chamamos de rol^e qualquer rota fechada de estradas (isto e, comeca em uma cidade e termina na mesma cidade) que nao passa por uma cidade mais de uma vez. Na Terra Brasilis, todos os roles passam por quantidades impares de cidades. O governo da Terra Brasilis decidiu fechar alguns roles para reforma. Ao fechar um role, todas as suas estradas sao interditadas, de modo que nao e permitido o trafego nessas estradas. Ao fazer isso, a Terra Brasilis ficou dividida em varias regioes de modo que, de qualquer cidade de cada regiao e possivel hegar a qualquer outra da mesma regiao atraves de estradas, mas nao e possivel hegar a cidades de outras regioes. Prove que o numero de regioes e impar.[/hide]

Passing through the origin of the coordinate plane are $180$ lines, including the coordinate axes, which form $1$ degree angles with one another at the origin. Determine the sum of the x-coordinates of the points of intersection of these lines with the line $y = 100-x$

[b]p1.[/b] The Evergreen School booked buses for a field trip. Altogether, $138$ people went to West Lake, while $115$ people went to East Lake. The buses all had the same number of seats, and every bus has more than one seat. All seats were occupied and everybody had a seat. How many seats were there in each bus? [b]p2.[/b] In New Scotland there are three kinds of coins: $1$ cent, $6$ cent, and $36$ cent coins. Josh has $50$ of the $36$-cent coins (and no other coins). He is allowed to exchange a $36$ cent coin for $6$ coins of $6$ cents, and to exchange a 6 cent coin for $6$ coins of $1$ cent. Is it possible that after several exchanges Josh will have $150$ coins? [b]p3.[/b] Pinocchio multiplied two $2$ digit numbers. But witch Masha erased some of the digits. The erased digits are the ones marked with a $*$. Could you help Pinocchio to restore all the erased digits? $\begin{tabular}{ccccc} & & & 9 & 5 \\ x & & & * & * \\ \hline & & & * & * \\ + & 1 & * & * & \\ \hline & * & * & * & * \\ \end{tabular}$ Find all solutions. [b]p4.[/b] There are $50$ senators and $435$ members of House of Representatives. On Friday all of them voted a very important issue. Each senator and each representative was required to vote either "yes" or "no". The announced results showed that the number of "yes" votes was greater than the number of "no" votes by $24$. Prove that there was an error in counting the votes. [b]p5.[/b] Was there a year in the last millennium (from $1000$ to $2000$) such that the sum of the digits of that year is equal to the product of the digits? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find the least natural number $ n$ such that, if the set $ \{1,2, \ldots, n\}$ is arbitrarily divided into two non-intersecting subsets, then one of the subsets contains 3 distinct numbers such that the product of two of them equals the third.

Let $(m,n)$ be a pair of positive integers. (a) Prove that the set of all positive integers can be partitioned into four pairwise disjoint nonempty subsets such that none of them has two numbers with absolute value of their difference equal to either $m$, $n$, or $m+n$. (b) Find all pairs $(m,n)$ such that the set of all positive integers can not be partitioned into three pairwise disjoint nonempty subsets satisfying the above condition.

A subset $S$ of the set of integers 0 - 99 is said to have property $A$ if it is impossible to fill a crossword-puzzle with 2 rows and 2 columns with numbers in $S$ (0 is written as 00, 1 as 01, and so on). Determine the maximal number of elements in the set $S$ with the property $A.$

Find all positive integers $n$ for which it is possible to partition a regular $n$-gon into triangles with diagonals not intersecting inside the $n$-gon such that at every vertex of the $n$-gon an odd number of triangles meet.

Let $n \geq 2$ be a positive integer. Determine the number of $n$-tuples $(x_1, x_2, \ldots, x_n)$ such that $x_k \in \{0, 1, 2\}$ for $1 \leq k \leq n$ and $\sum_{k = 1}^n x_k - \prod_{k = 1}^n x_k$ is divisible by $3$.

In a country of $n$ cities, an express train runs both ways between any two cities. For any train, ticket prices either direction are equal, but for any different routes these prices are different. Prove that the traveler can select the starting city, leave it and go on, successively, $n-1$ trains, such that each fare is smaller than that of the previous fare. (A traveler can enter the same city several times.)

Define a regular $n$-pointed star to be a union of $n$ lines segments $P_1P_2, P_2P_3, ..., P_nP_1$ such that $\bullet$ the points $P_1,P_2,...,P_n$ are coplanar and no three of them are collinear, $\bullet$ each of the $n$ line segments intersects at least one of the other line segments at a point other than an endpoint, $\bullet$ all of the angles at $P_1, P_2,..., P_n$ are congruent , $\bullet$ all of the $n$ line segments $P_1P_2, P_2P_3, ..., P_nP_1$ are congruent, and $\bullet$ the path $P_1P_2...P_nP_1$ turns counterclockwise at an angle less than $180^o$ at each vertex. There are no regular $3$-pointed, $4$-pointed, or $6$-pointed stars. All regular $5$-pointed star are similar, but there are two non-similar regular $7$-pointed stars. Find all possible values of $n$ such that there are exactly $29$ non-similar regular $n$-pointed stars.

On each of the 2006 cards a natural number is written. Cards are placed arbitrarily in a row. 2 players take in turns a card from any end of the row until all the cards are taken. After that each player calculates sum of the numbers written of his cards. If the sum of the first player is not less then the sum of the second one then the first player wins. Show that there's a winning strategy for the first player.

There are $212$ points inside or on a given unit circle. Prove that there are at least $2001$ pairs of points having distances at most $1$.

Suppose a table with one row and infinite columns. We call each $1\times1$ square a [i]room[/i]. Let the table be finite from left. We number the rooms from left to $\infty$. We have put in some rooms some coins (A room can have more than one coin.). We can do $2$ below operations: $a)$ If in $2$ adjacent rooms, there are some coins, we can move one coin from the left room $2$ rooms to right and delete one room from the right room. $b)$ If a room whose number is $3$ or more has more than $1$ coin, we can move one of its coins $1$ room to right and move one other coin $2$ rooms to left. $i)$ Prove that for any initial configuration of the coins, after a finite number of movements, we cannot do anything more. $ii)$ Suppose that there is exactly one coin in each room from $1$ to $n$. Prove that by doing the allowed operations, we cannot put any coins in the room $n+2$ or the righter rooms.

Let $\{x_n\}$ be a Van Der Corput series,that is,if the binary representation of $n$ is $\sum a_{i}2^{i}$ then $x_n=\sum a_i2^{-i-1}$.Let $V$ be the set of points on the plane that have the form $(n,x_n)$.Let $G$ be the graph with vertex set $V$ that is connecting any two points $(p,q)$ if there is a rectangle $R$ which lies in parallel position with the axes and $R\cap V= \{p,q\}$.Prove that the chromatic number of $G$ is finite.

Is it possible to color positive integers with three colors so that whenever two numbers with different colors are added, the result of their addition is the third color? (All three colors must be used.) If the answer is yes, indicate a possible coloration; if not, explain why.

A square is divided into 169 identical small squares and in every small square is written 0 or 1. It isn’t allowed in one row or column to have the following arrangements of adjacent digits in this order: 101, 111 or 1001. What is the the biggest possible number of 1’s in the table?

Let $S$ be an infinite set of positive integers, such that there exist four pairwise distinct $a,b,c,d \in S$ with $\gcd(a,b) \neq \gcd(c,d)$. Prove that there exist three pairwise distinct $x,y,z \in S$ such that $\gcd(x,y)=\gcd(y,z) \neq \gcd(z,x)$.

In the following illustration, starting from point X, we move one square along the segment until we arrive at point Y. Calculate the number of times a point has passed once and does not pass again, from X to Y. (However, starting point X is considered to have passed.)

How many lines pass through exactly two points in the following hexagonal grid? [img]https://cdn.artofproblemsolving.com/attachments/2/e/35741c80d0e0ee0ca56f1297b1e377c8db9e22.png[/img]