A charity sells 140 benefit tickets for a total of $ \$2001$. Some tickets sell for full price (a whole dollar amount), and the rest sells for half price. How much money is raised by the full-price tickets? $ \textbf{(A)} \ \$782 \qquad \textbf{(B)} \ \$986 \qquad \textbf{(C)} \ \$1158 \qquad \textbf{(D)} \ \$1219 \qquad \textbf{(E)} \ \$1449$

For a positive integer $k\ge 2$ define $\mathcal{T}_k=\{(x,y)\mid x,y=0,1,\ldots, k-1\}$ to be a collection of $k^2$ lattice points on the cartesian coordinate plane. Let $d_1(k)>d_2(k)>\cdots$ be the decreasing sequence of the distinct distances between any two points in $T_k$. Suppose $S_i(k)$ be the number of distances equal to $d_i(k)$. Prove that for any three positive integers $m>n>i$ we have $S_i(m)=S_i(n)$.

Alex distributes some cookies into several boxes and records the number of cookies in each box. If the same number appears more than once, it is recorded only once. Serge takes one cookie from each box and puts them on the first plate. Then he takes one cookie from each box that is still non-empty and puts the cookies on the second plate. He continues until all the boxes are empty. Then Serge records the number of cookies on each plate. Again, if the same number appears more than once, it is recorded only once. Prove that Alex's record contains the same number of numbers as Serge's record.

A complete set of the Encyclopedia of Mathematics has $10$ volumes. There are ten mathematicians in Mathemagic Land, and each of them owns two volumes of the Encyclopedia. Together they own two complete sets. Show that there is a way for each mathematician to donate one book to the library such that the library receives a complete set.

You have a $4$-digit whole number that is a perfect square. Another number is built adding $ 1$ to the unit's digit, subtracting $ 1$ from the ten's digit, adding $ 1$ to the hundred's digit and subtracting $ 1$ from the ones digit of one thousand. If the number you get is also a perfect square, find the original number. It's unique?

Let $A=\{(x,y): 0\le x,y < 1\}.$ For $(x,y)\in A,$ let \[S(x,y)=\sum_{\frac12\le\frac mn\le2}x^my^n,\] where the sum ranges over all pairs $(m,n)$ of positive integers satisfying the indicated inequalities. Evaluate \[\lim_{(x,y)\to(1,1),(x,y)\in A}(1-xy^2)(1-x^2y)S(x,y).\]

In a zoo, there are five more foxes than rabbits, and three more foxes than pandas. Are there more pandas or rabbits, and by how much more? $\textbf{(A) }\text{Pandas, }1\qquad\textbf{(B) }\text{Pandas, }2\qquad\textbf{(C) }\text{Rabbits, }1\qquad\textbf{(D) }\text{Rabbits, }2\qquad\textbf{(E) }\text{Rabbits, }3$

Determine the largest positive integer $n$ for which there exist pairwise different sets $\mathbb{S}_1 , ..., \mathbb{S}_n$ with the following properties: $1$) $|\mathbb{S}_i \cup \mathbb{S}_j | \leq 2004$ for any two indices $1 \leq i, j\leq n$, and $2$) $\mathbb{S}_i \cup \mathbb{S}_j \cup \mathbb{S}_k = \{ 1,2,...,2008 \}$ for any $1 \leq i < j < k \leq n$ [i]Proposed by Ivan Matic[/i]

Find the number of subsets of $\{1,2,\ldots,7\}$ that do not contain two consecutive integers.

An ant, which is on an edge of a cube of side $8$, must travel on the surface and return to the starting point. It's path must contain interior points of the six faces of the cube and should visit only once each face of the cube. Find the length of the path that the ant can carry out and justify why it is the shortest path.

Given $ n$ countries with three representatives each, $ m$ committees $ A(1),A(2), \ldots, A(m)$ are called a cycle if [i](i)[/i] each committee has $ n$ members, one from each country; [i](ii)[/i] no two committees have the same membership; [i](iii)[/i] for $ i \equal{} 1, 2, \ldots,m$, committee $ A(i)$ and committee $ A(i \plus{} 1)$ have no member in common, where $ A(m \plus{} 1)$ denotes $ A(1);$ [i](iv)[/i] if $ 1 < |i \minus{} j| < m \minus{} 1,$ then committees $ A(i)$ and $ A(j)$ have at least one member in common. Is it possible to have a cycle of 1990 committees with 11 countries?

Find the coefficient of $a^5b^5c^5d^6$ in the expansion of the following expression $(bcd +acd +abd +abc)^7$

Find the number of non-congruent scalene triangles whose sides all have integral length, and the longest side has length $11$.

[b]p1.[/b] In the following $3$ by $3$ grid, $a, b, c$ are numbers such that the sum of each row is listed at the right and the sum of each column is written below it: [center][img]https://cdn.artofproblemsolving.com/attachments/d/9/4f6fd2bc959c25e49add58e6e09a7b7eed9346.png[/img][/center] What is $n$? [b]p2.[/b] Suppose in your sock drawer of $14$ socks there are 5 different colors and $3$ different lengths present. One day, you decide you want to wear two socks that have both different colors and different lengths. Given only this information, what is the maximum number of choices you might have? [b]p3.[/b] The population of Arveymuddica is $2014$, which is divided into some number of equal groups. During an election, each person votes for one of two candidates, and the person who was voted for by $2/3$ or more of the group wins. When neither candidate gets $2/3$ of the vote, no one wins the group. The person who wins the most groups wins the election. What should the size of the groups be if we want to minimize the minimum total number of votes required to win an election? [b]p4.[/b] A farmer learns that he will die at the end of the year (day $365$, where today is day $0$) and that he has a number of sheep. He decides that his utility is given by ab where a is the money he makes by selling his sheep (which always have a fixed price) and $b$ is the number of days he has left to enjoy the profit; i.e., $365-k$ where $k$ is the day. If every day his sheep breed and multiply their numbers by $103/101$ (yes, there are small, fractional sheep), on which day should he sell them all? [b]p5.[/b] Line segments $\overline{AB}$ and $\overline{AC}$ are tangent to a convex arc $BC$ and $\angle BAC = \frac{\pi}{3}$ . If $\overline{AB} = \overline{AC} = 3\sqrt3$, find the length of arc $BC$. [b]p6.[/b] Suppose that you start with the number $8$ and always have two legal moves: $\bullet$ Square the number $\bullet$ Add one if the number is divisible by $8$ or multiply by $4$ otherwise How many sequences of $4$ moves are there that return to a multiple of $8$? [b]p7.[/b] A robot is shuffling a $9$ card deck. Being very well machined, it does every shuffle in exactly the same way: it splits the deck into two piles, one containing the $5$ cards from the bottom of the deck and the other with the $4$ cards from the top. It then interleaves the cards from the two piles, starting with a card from the bottom of the larger pile at the bottom of the new deck, and then alternating cards from the two piles while maintaining the relative order of each pile. The top card of the new deck will be the top card of the bottom pile. The robot repeats this shuffling procedure a total of n times, and notices that the cards are in the same order as they were when it started shuffling. What is the smallest possible value of $n$? [b]p8.[/b] A secant line incident to a circle at points $A$ and $C$ intersects the circle's diameter at point $B$ with a $45^o$ angle. If the length of $AB$ is $1$ and the length of $BC$ is $7$, then what is the circle's radius? [b]p9.[/b] If a complex number $z$ satisfies $z + 1/z = 1$, then what is $z^{96} + 1/z^{96}$? [b]p10.[/b] Let $a, b$ be two acute angles where $\tan a = 5 \tan b$. Find the maximum possible value of $\sin (a - b)$. [b]p11.[/b] A pyramid, represented by $SABCD$ has parallelogram $ABCD$ as base ($A$ is across from $C$) and vertex $S$. Let the midpoint of edge $SC$ be $P$. Consider plane $AMPN$ where$ M$ is on edge $SB$ and $N$ is on edge $SD$. Find the minimum value $r_1$ and maximum value $r_2$ of $\frac{V_1}{V_2}$ where $V_1$ is the volume of pyramid $SAMPN$ and $V_2$ is the volume of pyramid $SABCD$. Express your answer as an ordered pair $(r_1, r_2)$. [b]p12.[/b] A $5 \times 5$ grid is missing one of its main diagonals. In how many ways can we place $5$ pieces on the grid such that no two pieces share a row or column? [b]p13.[/b] There are $20$ cities in a country, some of which have highways connecting them. Each highway goes from one city to another, both ways. There is no way to start in a city, drive along the highways of the country such that you travel through each city exactly once, and return to the same city you started in. What is the maximum number of roads this country could have? [b]p14.[/b] Find the area of the cyclic quadrilateral with side lengths given by the solutions to $$x^4-10x^3+34x^2- 45x + 19 = 0.$$ [b]p15.[/b] Suppose that we know $u_{0,m} = m^2 + m$ and $u_{1,m} = m^2 + 3m$ for all integers $m$, and that $$u_{n-1,m} + u_{n+1,m} = u_{n,m-1} + u_{n,m+1}$$ Find $u_{30,-5}$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

With three different digits, all greater than $0$, six different three-digit numbers are formed. If we add these six numbers together the result is $4.218$. The sum of the three largest numbers minus the sum of the three smallest numbers equals $792$. Find the three digits.

Find all primes $p$ and all positive integers $a$ and $m$ such that $a\leq 5p^2$ and $(p-1)!+a=p^m$

A scientist begins an experiment with a cell culture that starts with some integer number of identical cells. After the first second, one of the cells dies, and every two seconds from there another cell will die (so one cell dies every odd-numbered second from the starting time). Furthermore, after exactly $60$ seconds, all of the living cells simultaneously split into two identical copies of itself, and this continues to happen every $60$ seconds thereafter. After performing the experiment for awhile, the scientist realizes the population of the culture will be unbounded and quickly shuts down the experiment before the cells take over the world. What is the smallest number of cells that the experiment could have started with? $\text{(A) }30\qquad\text{(B) }31\qquad\text{(C) }60\qquad\text{(D) }61\qquad\text{(E) }62$

If $x, y, z \in \mathbb{R}$ are solutions to the system of equations $$\begin{cases} x - y + z - 1 = 0\\ xy + 2z^2 - 6z + 1 = 0\\ \end{cases}$$ what is the greatest value of $(x - 1)^2 + (y + 1)^2$?

In $\triangle PAT,$ $\angle P=36^{\circ},$ $\angle A=56^{\circ},$ and $PA=10.$ Points $U$ and $G$ lie on sides $\overline{TP}$ and $\overline{TA},$ respectively, so that $PU=AG=1.$ Let $M$ and $N$ be the midpoints of segments $\overline{PA}$ and $\overline{UG},$ respectively. What is the degree measure of the acute angle formed by lines $MN$ and $PA?$ $\textbf{(A) } 76 \qquad \textbf{(B) } 77 \qquad \textbf{(C) } 78 \qquad \textbf{(D) } 79 \qquad \textbf{(E) } 80 $

Compute the number of $0\leq n\leq2015$ such that $6^n+8^n$ is divisible by $7$.

Given a circle $\omega$, on which marks the points $A,B,C$. Let $BF$ and $CE$ be the altitudes of the triangle $ABC$, $M$ be the midpoint of the side $AC$. Find a the locus of the intersection points of the lines $BF$ and E$M$ for all positions of point $A$ , as $A$ moves on $\omega$.

Are there positive real numbers $a$ and $b$ such that $[an+b]$ is prime for all natural values of $n$ ? $[x]$ denotes the integer part of the number $x$, the largest integer that does not exceed $x$.

Let $I$ be the incircle and $O$ a circumcenter of triangle $ABC$ such that $\angle ACB=30^{\circ}$. On sides $AC$ and $BC$ there are points $E$ and $D$, respectively, such that $EA=AB=BD$. Prove that $DE=IO$ and $DE \perp IO$

Find all surjective functions $f: \mathbb R \to \mathbb R$ such that for every $x,y\in \mathbb R,$ we have \[f(x+f(x)+2f(y))=f(2x)+f(2y).\]

Define $x\star y$ to be $x^y+y^x$.Compute $2\star (2\star 2)$.