PUMaCDonalds, a newly-opened fast food restaurant, has 5 menu items. If the first 4 customers each choose one menu item at random, the probability that the 4th customer orders a previously unordered item is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Given $100$ points on the plane. Prove that you can cover them with a family of circles with the sum of their diameters less than $100$ and the distance between any two of the circles more than one.

In a table $4\times 4$ we put $k$ blocks such that i) Each block covers exactly 2 cells ii) Each cell is covered by, at least, one block iii) If we delete a block; there is, at least, one cell that is not covered. Find the maximum value of $k$. Note: The blocks can overlap.

Three generations of the Wen family are going to the movies, two from each generation. The two members of the youngest generation receive a $ 50\%$ discount as children. The two members of the oldest generation receive a $ 25\%$ discount as senior citizens. The two members of the middle generation receive no discount. Grandfather Wen, whose senior ticket costs $ \$6.00$, is paying for everyone. How many dollars must he pay? $ \textbf{(A)}\ 34 \qquad \textbf{(B)}\ 36 \qquad \textbf{(C)}\ 42 \qquad \textbf{(D)}\ 46 \qquad \textbf{(E)}\ 48$

Problems 17, 18, and 19 refer to the following: At Central Middle School the 108 students who take the AMC8 meet in the evening to talk about problems and eat an average of two cookies apiece. Walter and Gretel are baking Bonnie's Best Bar Cookies this year. Their recipe, which makes a pan of 15 cookies, lists this items: 1.5 cups flour, 2 eggs, 3 tablespoons butter, 3/4 cups sugar, and 1 package of chocolate drops. They will make only full recipes, not partial recipes. The drummer gets sick. The concert is cancelled. Walter and Gretel must make enough pans of cookies to supply 216 cookies. There are 8 tablespoons in a stick of butter. How many sticks of butter will be needed? (Some butter may be left over, of course.) $ \text{(A)}\ 5\qquad\text{(B)}\ 6\qquad\text{(C)}\ 7\qquad\text{(D)}\ 8\qquad\text{(E)}\ 9 $

The real numbers $a, b, c, d$ are such that $a\geq b\geq c\geq d>0$ and $a+b+c+d=1$. Prove that \[(a+2b+3c+4d)a^ab^bc^cd^d<1\] [i]Proposed by Stijn Cambie, Belgium[/i]

Determine all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that for all $x, y, z,$ \[f(x+y^2+z)=f(f(x))+yf(y)+f(z). \]

A trapezoid $ABCD$ with bases $AD$ and $BC$ is such that $AB = BD$. Let $M$ be the midpoint of $DC$. Prove that $\angle MBC$ = $\angle BCA$.

The total area of all the faces of a rectangular solid is $22 \text{cm}^2$, and the total length of all its edges is $24 \text{cm}$. Then the length in $\text{cm}$ of any one of its internal diagonal is A. $\sqrt{11}$ B. $\sqrt{12}$ C. $\sqrt{13}$ D. $\sqrt{14}$ E. Not uniquely determined

The traffic on a certain east-west highway moves at a constant speed of 60 miles per hour in both directions. An eastbound driver passes 20 west-bound vehicles in a five-minute interval. Assume vehicles in the westbound lane are equally spaced. Which of the following is closest to the number of westbound vehicles present in a 100-mile section of highway? $\text{(A)} \ 100 \qquad \text{(B)} \ 120 \qquad \text{(C)} \ 200 \qquad \text{(D)} \ 240 \qquad \text{(E)} \ 400$

Let $ n, k$ be positive integers and suppose that the polynomial $ x^{2k}\minus{}x^k\plus{}1$ divides $ x^{2n}\plus{}x^n\plus{}1$. Prove that $ x^{2k}\plus{}x^k\plus{}1$ divides $ x^{2n}\plus{}x^n\plus{}1$.

Determine if there exists a subset $E$ of $Z \times Z$ with the properties: (i) $E$ is closed under addition, (ii) $E$ contains $(0,0),$ (iii) For every $(a,b) \ne (0,0), E$ contains exactly one of $(a,b)$ and $-(a,b)$. Remark: We define $(a,b)+(a',b') = (a+a',b+b')$ and $-(a,b) = (-a,-b)$.

Consider the two square matrices \[A=\begin{bmatrix} +1 & +1 &+1& +1 &+1 \\+1 &+1 &+1&-1 &-1 \\ +1 &-1&-1 &+1& +1 \\ +1 & -1 & -1 & -1 & +1 \\ +1 &+1&-1 &+1&-1 \end{bmatrix} \quad \text{ and } \quad B=\begin{bmatrix} +1 & +1 &+1& +1 &+1 \\+1 &+1 &+1&-1 &-1 \\ +1 &+1&-1& +1&-1 \\ +1 &-1& -1& +1& +1 \\ +1 & -1& +1&-1 &+1 \end{bmatrix}\] with entries $+1$ and $-1$. The following operations will be called elementary: (1) Changing signs of all numbers in one row; (2) Changing signs of all numbers in one column; (3) Interchanging two rows (two rows exchange their positions); (4) Interchanging two columns. Prove that the matrix $B$ cannot be obtained from the matrix $A$ using these operations.

Let $a, b, c, d, e$ be real numbers such that $a<b<c<d<e.$ The least possible value of the function $f: \mathbb R \to \mathbb R$ with $f(x) = |x-a| + |x - b|+ |x - c| + |x - d|+ |x - e|$ is $$ \mathrm a. ~ e+d+c+b+a\qquad \mathrm b.~e+d+c-b-a\qquad \mathrm c. ~e+d+|c|-b-a \qquad \mathrm d. ~e+d+b-a \qquad \mathrm e. ~e+d-b-a $$

Let $n$ be an integer greater than 2. A positive integer is said to be [i]attainable [/i]if it is 1 or can be obtained from 1 by a sequence of operations with the following properties: 1.) The first operation is either addition or multiplication. 2.) Thereafter, additions and multiplications are used alternately. 3.) In each addition, one can choose independently whether to add 2 or $n$ 4.) In each multiplication, one can choose independently whether to multiply by 2 or by $n$. A positive integer which cannot be so obtained is said to be [i]unattainable[/i]. [b]a.)[/b] Prove that if $n\geq 9$, there are infinitely many unattainable positive integers. [b]b.)[/b] Prove that if $n=3$, all positive integers except 7 are attainable.

Consider the sequence $(x_n)$ given by $$x_1=2,\enspace x_{n+1}=\frac{x_n+1+\sqrt{x_n^2+2x_n+5}}2,\enspace n\ge2.$$Prove that the sequence $y_n=\sum_{k=1}^n\frac1{x_k^2-1},\enspace n\ge1$ is convergent and find its limit.

There are several candles of the same size on the Chapel of Bones. On the first day a candle is lit for a hour. On the second day two candles are lit for a hour, on the third day three candles are lit for a hour, and successively, until the last day, when all the candles are lit for a hour. On the end of that day, all the candles were completely consumed. Find all the possibilities for the number of candles.

Consider a convex polygon having $n$ vertices, $n\geq 4$. We arbitrarily decompose the polygon into triangles having all the vertices among the vertices of the polygon, such that no two of the triangles have interior points in common. We paint in black the triangles that have two sides that are also sides of the polygon, in red if only one side of the triangle is also a side of the polygon and in white those triangles that have no sides that are sides of the polygon. Prove that there are two more black triangles that white ones.

Let $N$ be the number of ways of distributing $52$ identical balls into $4$ distinguishable boxes such that no box is empty and the difference between the number of balls in any two of the boxes is not a multiple of $6$ If $N=100a+b$, where $a,b$ are positive integers less than $100$, find $a+b.$

Let $a_1, a_2, . . . , a_{2019}$ be any positive real numbers such that $\frac{1}{a_1 + 2019}+\frac{1}{a_2 + 2019}+ ... +\frac{1}{a_{2019} + 2019}=\frac{1}{2019}$. Find the minimum value of $a_1a_2... a_{2019}$ and determine for which values of $a_1, a_2, . . . , a_{2019}$ this minimum occurs

Let $ABCDEF$ regular hexagon of side length $1$ and $O$ is its center. In addition to the sides of the hexagon, line segments from $O$ to the every vertex are drawn, making as total of $12$ unit segments. Find the number paths of length $2003$ along these segments that star at $O$ and terminate at $O$.

The cells of a square $2011 \times 2011$ array are labelled with the integers $1,2,\ldots, 2011^2$, in such a way that every label is used exactly once. We then identify the left-hand and right-hand edges, and then the top and bottom, in the normal way to form a torus (the surface of a doughnut). Determine the largest positive integer $M$ such that, no matter which labelling we choose, there exist two neighbouring cells with the difference of their labels at least $M$. (Cells with coordinates $(x,y)$ and $(x',y')$ are considered to be neighbours if $x=x'$ and $y-y'\equiv\pm1\pmod{2011}$, or if $y=y'$ and $x-x'\equiv\pm1\pmod{2011}$.) [i](Romania) Dan Schwarz[/i]

We divide the set $\{1,2,\cdots,2n\}$ into two disjoint sets : $\{a_1,a_2,\cdots,a_n\}$ and $\{b_1,b_2,\cdots,b_n\}$ such that : $$a_1<a_2<\cdots<a_n\text{ and } b_1>b_2>\cdots>b_n.$$ Show that : $$|a_1-b_1|+\cdots+|a_n-b_n|=n^2. $$

You are cheating at a trivia contest. For each question, you can peek at each of the $n > 1$ other contestants' guesses before writing down your own. For each question, after all guesses are submitted, the emcee announces the correct answer. A correct guess is worth $0$ points. An incorrect guess is worth $-2$ points for other contestants, but only $-1$ point for you, since you hacked the scoring system. After announcing the correct answer, the emcee proceeds to read the next question. Show that if you are leading by $2^{n - 1}$ points at any time, then you can surely win first place. [i]Linus Hamilton[/i]

Let $APBCQ$ be a cyclic pentagon. A point $M$ inside triangle $ABC$ is such that $\angle MAB = \angle MCA$, $\angle MAC = \angle MBA$ and $\angle PMB = \angle QMC = 90^\circ$. Prove that $AM$, $BP$, and $CQ$ concur. [i]Anant Mudgal and Navilarekallu Tejaswi[/i]