Consider the integral lattice $\mathbb{Z}^n$, $n \geq 2$, in the Euclidean $n$-space. Define a [i]line[/i] in $\mathbb{Z}^n$ to be a set of the form $a_1 \times \cdots \times a_{k-1} \times \mathbb{Z} \times a_{k+1} \times \cdots \times a_n$ where $k$ is an integer in the range $1,2,\ldots,n$, and the $a_i$ are arbitrary integers. A subset $A$ of $\mathbb{Z}^n$ is called [i]admissible[/i] if it is non-empty, finite, and every [i]line[/i] in $\mathbb{Z}^{n}$ which intersects $A$ contains at least two points from $A$. A subset $N$ of $\mathbb{Z}^n$ is called [i]null[/i] if it is non-empty, and every [i]line[/i] in $\mathbb{Z}^n$ intersects $N$ in an even number of points (possibly zero). [b](a)[/b] Prove that every [i]admissible[/i] set in $\mathbb{Z}^2$ contains a [i]null[/i] set. [b](b)[/b] Exhibit an [i]admissible[/i] set in $\mathbb{Z}^3$ no subset of which is a [i]null[/i] set .

A man has a seven-candle chandellier. The first evening he lighted one candle for one hour, the second evening he lighted two candles, also for one hour, and so on. After one hour the seventh evening, all seven candles simultaneously finished. How did the man choose the candles to light every evening?

The sum of several positive integers, not necessarily different, all of them less than or equal to $10$, is equal to $S$. We want to distribute all these numbers into two groups such that the sum of the numbers in each group is less than or equal to $80.$ Determine all values ​​of $S$ for which this is possible.

In a row, $1000$ numbers \(2\) and $2000$ numbers \(-1\) are written in some order. Mykhailo counted the number of groups of adjacent numbers, consisting of at least two numbers, whose sum equals \(0\). (a) Find the smallest possible value of this number. (b) Find the largest possible value of this number. [i]Proposed by Anton Trygub[/i]

There is a number written in each square of a $13\times13$ board such that any two numbers in squares with a common side differ by exactly $1$. Each of the numbers $2$ and $24$ is written twice. How many times is the number $13$ written? Find all possibilities.

[i]20 problems for 20 minutes.[/i] [b]p1.[/b] Euclid eats $\frac17$ of a pie in $7$ seconds. Euler eats $\frac15$ of an identical pie in $10$ seconds. Who eats faster? [b]p2.[/b] Given that $\pi = 3.1415926...$ , compute the circumference of a circle of radius 1. Express your answer as a decimal rounded to the nearest hundred thousandth (i.e. $1.234562$ and $1.234567$ would be rounded to $1.23456$ and $1.23457$, respectively). [b]p3.[/b] Alice bikes to Wonderland, which is $6$ miles from her house. Her bicycle has two wheels, and she also keeps a spare tire with her. If each of the three tires must be used for the same number of miles, for how many miles will each tire be used? [b]p4.[/b] Simplify $\frac{2010 \cdot 2010}{2011}$ to a mixed number. (For example, $2\frac12$ is a mixed number while $\frac52$ and $2.5$ are not.) [b]p5.[/b] There are currently $175$ problems submitted for $EMC^2$. Chris has submitted $51$ of them. If nobody else submits any more problems, how many more problems must Chris submit so that he has submitted $\frac13$ of the problems? [b]p6.[/b] As shown in the diagram below, points $D$ and $L$ are located on segment $AK$, with $D$ between $A$ and $L$, such that $\frac{AD}{DK}=\frac{1}{3}$ and $\frac{DL}{LK}=\frac{5}{9}$. What is $\frac{DL}{AK}$? [img]https://cdn.artofproblemsolving.com/attachments/9/a/3f92bd33ffbe52a735158f7ebca79c4c360d30.png[/img] [b]p7.[/b] Find the number of possible ways to order the letters $G, G, e, e, e$ such that two neighboring letters are never $G$ and $e$ in that order. [b]p8.[/b] Find the number of odd composite integers between $0$ and $50$. [b]p9.[/b] Bob tries to remember his $2$-digit extension number. He knows that the number is divisible by $5$ and that the first digit is odd. How many possibilities are there for this number? [b]p10.[/b] Al walks $1$ mile due north, then $2$ miles due east, then $3$ miles due south, and then $4$ miles due west. How far, in miles, is he from his starting position? (Assume that the Earth is flat.) [b]p11.[/b] When n is a positive integer, $n!$ denotes the product of the first $n$ positive integers; that is, $n! = 1 \cdot 2 \cdot 3 \cdot ... \cdot n$. Given that $7! = 5040$, compute $8! + 9! + 10!$. [b]p12.[/b] Sam's phone company charges him a per-minute charge as well as a connection fee (which is the same for every call) every time he makes a phone call. If Sam was charged $\$4.88$ for an $11$-minute call and $\$6.00$ for a $19$-minute call, how much would he be charged for a $15$-minute call? [b]p13.[/b] For a positive integer $n$, let $s_n$ be the sum of the n smallest primes. Find the least $n$ such that $s_n$ is a perfect square (the square of an integer). [b]p14.[/b] Find the remainder when $2011^{2011}$ is divided by $7$. [b]p15.[/b] Let $a, b, c$, and $d$ be $4$ positive integers, each of which is less than $10$, and let $e$ be their least common multiple. Find the maximum possible value of $e$. [b]p16.[/b] Evaluate $100 - 1 + 99 - 2 + 98 - 3 + ... + 52 - 49 + 51 - 50$. [b]p17.[/b] There are $30$ basketball teams in the Phillips Exeter Dorm Basketball League. In how ways can $4$ teams be chosen for a tournament if the two teams Soule Internationals and Abbot United cannot be chosen at the same time? [b]p18.[/b] The numbers $1, 2, 3, 4, 5, 6$ are randomly written around a circle. What is the probability that there are four neighboring numbers such that the sum of the middle two numbers is less than the sum of the other two? [b]p19.[/b] What is the largest positive $2$-digit factor of $3^{2^{2011}} - 2^{2^{2011}}$? [b]p20.[/b] Rhombus $ABCD$ has vertices $A = (-12,-4)$, $B = (6, b)$, $C = (c,-4)$ and $D = (d,-28)$, where $b$, $c$, and $d$ are integers. Find a constant $m$ such that the line y = $mx$ divides the rhombus into two regions of equal area. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[u]Round 1[/u] [b]p1.[/b] Alec rated the movie Frozen $1$ out of $5$ stars. At least how many ratings of $5$ out of $5$ stars does Eric need to collect to make the average rating for Frozen greater than or equal to $4$ out of $5$ stars? [b]p2.[/b] Bessie shuffles a standard $52$-card deck and draws five cards without replacement. She notices that all five of the cards she drew are red. If she draws one more card from the remaining cards in the deck, what is the probability that she draws another red card? [b]p3.[/b] Find the value of $121 \cdot 1020304030201$. [u]Round 2[/u] [b]p4.[/b] Find the smallest positive integer $c$ for which there exist positive integers $a$ and $b$ such that $a \ne b$ and $a^2 + b^2 = c$ [b]p5.[/b] A semicircle with diameter $AB$ is constructed on the outside of rectangle $ABCD$ and has an arc length equal to the length of $BC$. Compute the ratio of the area of the rectangle to the area of the semicircle. [b]p6.[/b] There are $10$ monsters, each with $6$ units of health. On turn $n$, you can attack one monster, reducing its health by $n$ units. If a monster's health drops to $0$ or below, the monster dies. What is the minimum number of turns necessary to kill all of the monsters? [u]Round 3[/u] [b]p7.[/b] It is known that $2$ students make up $5\%$ of a class, when rounded to the nearest percent. Determine the number of possible class sizes. [b]p8.[/b] At $17:10$, Totoro hopped onto a train traveling from Tianjin to Urumuqi. At $14:10$ that same day, a train departed Urumuqi for Tianjin, traveling at the same speed as the $17:10$ train. If the duration of a one-way trip is $13$ hours, then how many hours after the two trains pass each other would Totoro reach Urumuqi? [b]p9.[/b] Chad has $100$ cookies that he wants to distribute among four friends. Two of them, Jeff and Qiao, are rivals; neither wants the other to receive more cookies than they do. The other two, Jim and Townley, don't care about how many cookies they receive. In how many ways can Chad distribute all $100$ cookies to his four friends so that everyone is satisfied? (Some of his four friends may receive zero cookies.) [u]Round 4[/u] [b]p10.[/b] Compute the smallest positive integer with at least four two-digit positive divisors. [b]p11.[/b] Let $ABCD$ be a trapezoid such that $AB$ is parallel to $CD$, $BC = 10$ and $AD = 18$. Given that the two circles with diameters $BC$ and $AD$ are tangent, find the perimeter of $ABCD$. [b]p12.[/b] How many length ten strings consisting of only $A$s and Bs contain neither "$BAB$" nor "$BBB$" as a substring? PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2934037p26256063]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are $25$ students in Peter’s class (not counting him). Peter has observed that all $25$ have different numbers of friends in this class. How many friends does Peter have in this class? (Give all possible answers.) (S Toparev)

Jeff rolls a standard $6$ sided die repeatedly until he rolls either all of the prime numbers possible at least once, or all the of even numbers possible at least once. Find the probability that his last roll is a $2$.

A graph $G(V,E)$ is triangle-free, but adding any edges to the graph will form a triangle. It's given that $|V|=2019$, $|E|>2018$, find the minimum of $|E|$ .

Call a set $A$ of integers [i]non-isolated[/i], if for every $a\in A$ at least one of the numbers $a-1$ and $a+1$ also belongs to $A$. Prove that the number of five-element non-isolated subsets of $\{1, 2,\ldots ,n\}$ is $(n-4)^2$.

Each of the numbers in the set \(A = \{1,2, \cdots, 2017\}\) is colored either red or white. Prove that for \(n \geq 18\), there exists a coloring of the numbers in \(A\) such that any of its n-term arithmetic sequences contains both colors.

Consider the infinite grid of lattice points in $\mathbb{Z}^3$. Little D and Big Z play a game, where Little D first loses a shoe on an unmunched point in the grid. Then, Big Z munches a shoe-free plane perpendicular to one of the coordinate axes. They continue to alternate turns in this fashion, with Little D's goal to lose a shoe on each of $n$ consecutive lattice points on a line parallel to one of the coordinate axes. Determine all $n$ for which Little D can accomplish his goal. [i]David Yang.[/i]

There are $n$ points in the page such that no three of them are collinear.Prove that number of triangles that vertices of them are chosen from these $n$ points and area of them is 1,is not greater than $\frac23(n^2-n)$.

Given a positive integer $n$, consider a triangular array with entries $a_{ij}$ where $i$ ranges from $1$ to $n$ and $j$ ranges from $1$ to $n-i+1$. The entries of the array are all either $0$ or $1$, and, for all $i > 1$ and any associated $j$ , $a_{ij}$ is $0$ if $a_{i-1,j} = a_{i-1,j+1}$, and $a_{ij}$ is $1$ otherwise. Let $S$ denote the set of binary sequences of length $n$, and define a map $f \colon S \to S$ via $f \colon (a_{11}, a_{12},\cdots ,a_{1n}) \to (a_{n1}, a_{n-1,2}, \cdots , a_{1n})$. Determine the number of fixed points of $f$.

A collection of $n$ positive numbers, where repeats are allowed, adds to $500$. They can be split into $20$ groups each adding to $25$, and can also be split into $25$ groups each adding to $20$. (A group is allowed to contain any amount of integers, even just one integer.) What is the least possible value of $n$? [i]Aaron Wang[/i]

Arnaldo and Bernardo play a Super Naval Battle. Each has a board $n \times n$. Arnaldo puts boats on his board (at least one but not known how many). Each boat occupies the $n$ houses of a line or a column and the boats they can not overlap or have a common side. Bernardo marks $m$ houses (representing shots) on your board. After Bernardo marked the houses, Arnaldo says which of them correspond to positions occupied by ships. Bernardo wins, and then discovers the positions of all Arnaldo's boats. Determine the lowest value of $m$ for which Bernardo can guarantee his victory.

Let $f(x,y)$ and $g(x,y)$ be real valued functions defined for every $x,y \in \{1,2,..,2000\}$. If there exist $X,Y \subset \{1,2,..,2000\}$ such that $s(X)=s(Y)=1000$ and $x\notin X$ and $y\notin Y$ implies that $f(x,y)=g(x,y)$ than, what is the maximum number of $(x,y)$ couples where $f(x,y)\neq g(x,y)$.

[b]p1.[/b] What is the slope of the line perpendicular to the the graph $\frac{x}{4}+\frac{y}{9}= 1$ at $(0, 9)$? [b]p2.[/b] A boy is standing in the middle of a very very long staircase and he has two pogo sticks. One pogo stick allows him to jump $220$ steps up the staircase. The second pogo stick allows him to jump $125$ steps down the staircase. What is the smallest positive number of steps that he can reach from his original position by a series of jumps? [b]p3.[/b] If you roll three fair six-sided dice, what is the probability that the product of the results will be a multiple of $3$? [b]p4.[/b] Right triangle $ABC$ has squares $ABXY$ and $ACWZ$ drawn externally to its legs and a semicircle drawn externally to its hypotenuse $BC$. If the area of the semicircle is $18\pi$ and the area of triangle $ABC$ is $30$, what is the sum of the areas of squares $ABXY$ and $ACWZ$? [img]https://cdn.artofproblemsolving.com/attachments/5/1/c9717e7731af84e5286335420b73b974da2643.png[/img] [b]p5.[/b] You have a bag containing $3$ types of pens: red, green, and blue. $30\%$ of the pens are red pens, and $20\%$ are green pens. If, after you add $10$ blue pens, $60\%$ of the pens are blue pens, how many green pens did you start with? [b]p6.[/b] Canada gained partial independence from the United Kingdom in $1867$, beginning its long role as the headgear of the United States. It gained its full independence in $1982$. What is the last digit of $1867^{1982}$? [b]p7.[/b] Bacon, Meat, and Tomato are dealing with paperwork. Bacon can fill out $5$ forms in $3$ minutes, Meat can fill out $7$ forms in $5$ minutes, and Tomato can staple $3$ forms in $1$ minute. A form must be filled out and stapled together (in either order) to complete it. How long will it take them to complete $105$ forms? [b]p8.[/b] Nice numbers are defined to be $7$-digit palindromes that have no $3$ identical digits (e.g., $1234321$ or $5610165$ but not $7427247$). A pretty number is a nice number with a $7$ in its decimal representation (e.g., $3781873$). What is the $7^{th}$ pretty number? [b]p9.[/b] Let $O$ be the center of a semicircle with diameter $AD$ and area $2\pi$. Given square $ABCD$ drawn externally to the semicircle, construct a new circle with center $B$ and radius $BO$. If we extend $BC$, this new circle intersects $BC$ at $P$. What is the length of $CP$? [img]https://cdn.artofproblemsolving.com/attachments/b/1/be15e45cd6465c7d9b45529b6547c0010b8029.png[/img] [b]p10.[/b] Derek has $10$ American coins in his pocket, summing to a total of $53$ cents. If he randomly grabs $3$ coins from his pocket, what is the probability that they're all different? [b]p11.[/b] What is the sum of the whole numbers between $6\sqrt{10}$ and $7\pi$ ? [b]p12.[/b] What is the volume of a cylinder whose radius is equal to its height and whose surface area is numerically equal to its volume? [b]p13.[/b] $15$ people, including Luke and Matt, attend a Berkeley Math meeting. If Luke and Matt sit next to each other, a fight will break out. If they sit around a circular table, all positions equally likely, what is the probability that a fight doesn't break out? [b]p14.[/b] A non-degenerate square has sides of length $s$, and a circle has radius $r$. Let the area of the square be equal to that of the circle. If we have a rectangle with sides of lengths $r$, $s$, and its area has an integer value, what is the smallest possible value for $s$? [b]p15.[/b] How many ways can you arrange the letters of the word "$BERKELEY$" such that no two $E$'s are next to each other? [b]p16.[/b] Kim, who has a tragic allergy to cake, is having a birthday party. She invites $12$ people but isn't sure if $11$ or $12$ will show up. However, she needs to cut the cake before the party starts. What is the least number of slices (not necessarily of equal size) that she will need to cut to ensure that the cake can be equally split among either $11$ or $12$ guests with no excess? [b]p17.[/b] Tom has $2012$ blue cards, $2012$ red cards, and $2012$ boxes. He distributes the cards in such a way such that each box has at least $1$ card. Sam chooses a box randomly, then chooses a card randomly. Suppose that Tom arranges the cards such that the probability of Sam choosing a blue card is maximized. What is this maximum probability? [b]p18.[/b] Allison wants to bake a pie, so she goes to the discount market with a handful of dollar bills. The discount market sells different fruit each for some integer number of cents and does not add tax to purchases. She buys $22$ apples and $7$ boxes of blueberries, using all of her dollar bills. When she arrives back home, she realizes she needs more fruit, though, so she grabs her checkbook and heads back to the market. This time, she buys $31$ apples and $4$ boxes of blueberries, for a total of $60$ cents more than her last visit. Given she spent less than $100$ dollars over the two trips, how much (in dollars) did she spend on her first trip to the market? [b]p19.[/b] Consider a parallelogram $ABCD$. Let $k$ be the line passing through A and parallel to the bisector of $\angle ABC$, and let $\ell$ be the bisector of $\angle BAD$. Let $k$ intersect line $CD$ at $E$ and $\ell$ intersect line $CD$ at $F$. If $AB = 13$ and $BC = 37$, find the length $EF$. [b]p20.[/b] Given for some real $a, b, c, d,$ $$P(x) = ax^4 + bx^3 + cx^2 + dx$$ $$P(-5) = P(-2) = P(2) = P(5) = 1$$ Find $P(10).$ PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

3 countries $A, B, C$ participate in a competition where each country has 9 representatives. The rules are as follows: every round of competition is between 1 competitor each from 2 countries. The winner plays in the next round, while the loser is knocked out. The remaining country will then send a representative to take on the winner of the previous round. The competition begins with $A$ and $B$ sending a competitor each. If all competitors from one country have been knocked out, the competition continues between the remaining 2 countries until another country is knocked out. The remaining team is the champion. [b]I.[/b] At least how many games does the champion team win? [b]II.[/b] If the champion team won 11 matches, at least how many matches were played?

In a tournament, each of $15$ teams played with each other exactly once. Let us call the game “[i]odd[/i]” if the total number of games previously played by both competing teams was odd. [b](a)[/b] Prove that there was at least one “[i]odd[/i]” game. [b](b)[/b] Could it happen that there was exactly one “[i]odd[/i]” game?

In chess tournament participates $n$ participants ($n >1$). In tournament each of participants plays with each other exactly $1$ game. For each game participant have $1$ point if he wins game, $0,5$ point if game is drow and $0$ points if he lose game. If after ending of tournament participant have at least $ 75 % $ of maximum possible points he called $winner$ $of$ $tournament$. Find maximum possible numbers of $winners$ $of$ $tournament$.

The squares of an $8 \times 8$ board are coloured alternatingly black and white. A rectangle consisting of some of the squares of the board is called [i]important[/i] if its sides are parallel to the sides of the board and all its corner squares are coloured black. The side lengths can be anything from $1$ to $8$ squares. On each of the $64$ squares of the board, we write the number of important rectangles in which it is contained. The sum of the numbers on the black squares is $B$, and the sum of the numbers on the white squares is $W$. Determine the difference $B - W$.

Triangle $\Delta GRB$ is dissected into $25$ small triangles as shown. All vertices of these triangles are painted in three colors so that the following conditions are satisfied: Vertex $G$ is painted in green, vertex $R$ in red, and $B$ in blue; Each vertex on side $GR$ is either green or red, each vertex on $RB$ is either red or blue, and each vertex on $GB$ is either green or blue. The vertices inside the big triangle are arbitrarily colored. Prove that, regardless of the way of coloring, at least one of the $25$ small triangles has vertices of three different colors.

[b]p1.[/b] Trung has $2$ bells. One bell rings $6$ times per hour and the other bell rings $10$ times per hour. At the start of the hour both bells ring. After how much time will the bells ring again at the same time? Express your answer in hours. [b]p2.[/b] In a soccer tournament there are $n$ teams participating. Each team plays every other team once. The matches can end in a win for one team or in a draw. If the match ends with a win, the winner gets $3$ points and the loser gets $0$. If the match ends in a draw, each team gets $1$ point. At the end of the tournament the total number of points of all the teams is $21$. Let $p$ be the number of points of the team in the first place. Find $n + p$. [b]p3.[/b] What is the largest $3$ digit number $\overline{abc}$ such that $b \cdot \overline{ac} = c \cdot \overline{ab} + 50$? [b]p4.[/b] Let s(n) be the number of quadruplets $(x, y, z, t)$ of positive integers with the property that $n = x + y + z + t$. Find the smallest $n$ such that $s(n) > 2014$. [b]p5.[/b] Consider a decomposition of a $10 \times 10$ chessboard into p disjoint rectangles such that each rectangle contains an integral number of squares and each rectangle contains an equal number of white squares as black squares. Furthermore, each rectangle has different number of squares inside. What is the maximum of $p$? [b]p6.[/b] If two points are selected at random from a straight line segment of length $\pi$, what is the probability that the distance between them is at least $\pi- 1$? [b]p7.[/b] Find the length $n$ of the longest possible geometric progression $a_1, a_2,..,, a_n$ such that the $a_i$ are distinct positive integers between $100$ and $2014$ inclusive. [b]p8.[/b] Feng is standing in front of a $100$ story building with two identical crystal balls. A crystal ball will break if dropped from a certain floor $m$ of the building or higher, but it will not break if it is dropped from a floor lower than $m$. What is the minimum number of times Feng needs to drop a ball in order to guarantee he determined $m$ by the time all the crystal balls break? [b]p9.[/b] Let $A$ and $B$ be disjoint subsets of $\{1, 2,..., 10\}$ such that the product of the elements of $A$ is equal to the sum of the elements in $B$. Find how many such $A$ and $B$ exist. [b]p10.[/b] During the semester, the students in a math class are divided into groups of four such that every two groups have exactly $2$ students in common and no two students are in all the groups together. Find the maximum number of such groups. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].