Find all positive integers $ n $ such that there exists an integer $ m $ satisfying $$ \frac{1}{n}\sum\limits_{k=m}^{m+n-1}{k^2} $$ is a perfect square.

Let $S$ be a sequence $n_1, n_2,..., n_{1995}$ of positive integers such that $n_1 +...+ n_{1995 }=m < 3990$. Prove that for each integer $q$ with $1 \le q \le m$, there is a sequence $n_{i_1} , n_{i_2} , ... , n_{i_k}$ , where $1 \le i_1 < i_2 < ...< i_k \le 1995$, $n_{i_1} + ...+ n_{i_k} = q$ and $k$ depends on $q$.

Let $k$ be a positive integer. Define $n_k$ to be the number with decimal representation $70...01$ where there are exactly $k$ zeroes. Prove the following assertions: a) None of the numbers $n_k$ is divisible by $13$. b) Infinitely many of the numbers $n_k$ are divisible by $17$.

[b]p1.[/b] Calculate $\left( \frac12 + \frac13 + \frac14 \right)^2$. [b]p2.[/b] Find the $2010^{th}$ digit after the decimal point in the expansion of $\frac17$. [b]p3.[/b] If you add $1$ liter of water to a solution consisting of acid and water, the new solutions will contain of $30\%$ water. If you add another $5$ liters of water to the new solution, it will contain $36\frac{4}{11}\%$ water. Find the number of liters of acid in the original solution. [b]p4.[/b] John places $5$ indistinguishable blue marbles and $5$ indistinguishable red marbles into two distinguishable buckets such that each bucket has at least one blue marble and one red marble. How many distinguishable marble distributions are possible after the process is completed? [b]p5.[/b] In quadrilateral $PEAR$, $PE = 21$, $EA = 20$, $AR = 15$, $RE = 25$, and $AP = 29$. Find the area of the quadrilateral. [b]p6.[/b] Four congruent semicircles are drawn within the boundary of a square with side length $1$. The center of each semicircle is the midpoint of a side of the square. Each semicircle is tangent to two other semicircles. Region $R$ consists of points lying inside the square but outside of the semicircles. The area of $R$ can be written in the form $a - b\pi$, where $a$ and $b$ are positive rational numbers. Compute $a + b$. [b]p7.[/b] Let $x$ and $y$ be two numbers satisfying the relations $x\ge 0$, $y\ge 0$, and $3x + 5y = 7$. What is the maximum possible value of $9x^2 + 25y^2$? [b]p8.[/b] In the Senate office in Exie-land, there are $6$ distinguishable senators and $6$ distinguishable interns. Some senators and an equal number of interns will attend a convention. If at least one senator must attend, how many combinations of senators and interns can attend the convention? [b]p9.[/b] Evaluate $(1^2 - 3^2 + 5^2 - 7^2 + 9^2 - ... + 2009^2) -(2^2 - 4^2 + 6^2 - 8^2 + 10^2- ... + 2010^2)$. [b]p10.[/b] Segment $EA$ has length $1$. Region $R$ consists of points $P$ in the plane such that $\angle PEA \ge 120^o$ and $PE <\sqrt3$. If point $X$ is picked randomly from the region$ R$, the probability that $AX <\sqrt3$ can be written in the form $a - \frac{\sqrt{b}}{c\pi}$ , where $a$ is a rational number, $b$ and $c$ are positive integers, and $b$ is not divisible by the square of a prime. Find the ordered triple $(a, b, c)$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n\geq2$ be an integer. An $n$-tuple $(a_1,a_2,\dots,a_n)$ of not necessarily different positive integers is [i]expensive[/i] if there exists a positive integer $k$ such that $$(a_1+a_2)(a_2+a_3)\dots(a_{n-1}+a_n)(a_n+a_1)=2^{2k-1}.$$ a) Find all integers $n\geq2$ for which there exists an expensive $n$-tuple. b) Prove that for every odd positive integer $m$ there exists an integer $n\geq2$ such that $m$ belongs to an expensive $n$-tuple. [i]There are exactly $n$ factors in the product on the left hand side.[/i]

[b]p1.[/b] Joe owns stock. On Monday morning on October $20$th, $2008$, his stocks were worth $\$250,000$. The value of his stocks, for each day from Monday to Friday of that week, increased by $10\%$, increased by $5\%$, decreased by $5\%$, decreased by $15\%$, and decreased by $20\%$, though not necessarily in that order. Given this information, let $A$ be the largest possible value of his stocks on that Friday evening, and let $B$ be the smallest possible value of his stocks on that Friday evening. What is $A - B$? [b]p2.[/b] What is the smallest positive integer $k$ such that $2k$ is a perfect square and $3k$ is a perfect cube? [b]p3.[/b] Two competitive ducks decide to have a race in the first quadrant of the $xy$ plane. They both start at the origin, and the race ends when one of the ducks reaches the line $y = \frac12$ . The first duck follows the graph of $y = \frac{x}{3}$ and the second duck follows the graph of $y = \frac{x}{5}$ . If the two ducks move in such a way that their $x$-coordinates are the same at any time during the race, find the ratio of the speed of the first duck to that of the second duck when the race ends. [b]p4.[/b] There were grammatical errors in this problem as stated during the contest. The problem should have said: You play a carnival game as follows: The carnival worker has a circular mat of radius 20 cm, and on top of that is a square mat of side length $10$ cm, placed so that the centers of the two mats coincide. The carnival worker also has three disks, one each of radius $1$ cm, $2$ cm, and $3$ cm. You start by paying the worker a modest fee of one dollar, then choosing two of the disks, then throwing the two disks onto the mats, one at a time, so that the center of each disk lies on the circular mat. You win a cash prize if the center of the large disk is on the square AND the large disk touches the small disk, otherwise you just lost the game and you get no money. How much is the cash prize if choosing the two disks randomly and then throwing the disks randomly (i.e. with uniform distribution) will, on average, result in you breaking even? [b]p5.[/b] Four boys and four girls arrive at the Highball High School Senior Ball without a date. The principal, seeking to rectify the situation, asks each of the boys to rank the four girls in decreasing order of preference as a prom date and asks each girl to do the same for the four boys. None of the boys know any of the girls and vice-versa (otherwise they would have probably found each other before the prom), so all eight teenagers write their rankings randomly. Because the principal lacks the mathematical chops to pair the teenagers together according to their stated preference, he promptly ignores all eight of the lists and randomly pairs each of the boys with a girl. What is the probability that no boy ends up with his third or his fourth choice, and no girl ends up with her third or fourth choice? [b]p6.[/b] In the diagram below, $ABCDEFGH$ is a rectangular prism, $\angle BAF = 30^o$ and $\angle DAH = 60^o$. What is the cosine of $\angle CEG$? [img]https://cdn.artofproblemsolving.com/attachments/a/1/1af1a7d5d523884703b9ff95aaf301bcc18140.png[/img] [b]p7.[/b] Two cows play a game where each has one playing piece, they begin by having the two pieces on opposite vertices of an octahedron, and the two cows take turns moving their piece to an adjacent vertex. The winner is the first player who moves its piece to the vertex occupied by its opponent’s piece. Because cows are not the most intelligent of creatures, they move their pieces randomly. What is the probability that the first cow to move eventually wins? [b]p8.[/b] Find the last two digits of $$\sum^{2008}_{k=1}k {2008 \choose k}.$$ PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

a) Factorize $A= x^4+y^4+z^4-2x^2y^2-2y^2z^2-2z^2x^2$ b) Prove that there are no integers $x,y,z$ such that $x^4+y^4+z^4-2x^2y^2-2y^2z^2-2z^2x^2=2000 $

Find the smallest positive integer $n$ with the following property: For any integer $m$ with $0 < m < 2004$, there exists an integer $k$ such that \[\frac{m}{2004}<\frac{k}{n}<\frac{m+1}{2005}.\]

Let $n$ be a positive integer. Prove that there exist an infinity of multiples of $n$ which do not contain the digit “$9$” in their decimal representation

Prove that for any odd prime number $ p,$ the number of positive integer $ n$ satisfying $ p|n! \plus{} 1$ is less than or equal to $ cp^\frac{2}{3}.$ where $ c$ is a constant independent of $ p.$

Let $a,b$ be positive integers . How many integers numbers can be written in the form $ap+bq$, where $p,q$ are nonnegative integers and $p+q\le{2005}$ ?

$a, b, c$ are three distinct integers and $n$ is a positive integer. Show that $$\frac{a^n}{(a - b)(a - c)}+\frac{ b^n}{(b - a)(b - c)} +\frac{ c^n}{(c - a)(c - b)}$$ is an integer.

Write down $f(n)$ for the greatest odd divisor of $n \in N_0$. (a) Determine $f (n + 1) + f (n + 2) + ... + f(2n)$. (b) Determine $f(1) + f(2) + f(3) + ... + f(2n)$.

[u]Round 1[/u] [b]p1.[/b] Goldilocks enters the home of the three bears – Papa Bear, Mama Bear, and Baby Bear. Each bear is wearing a different-colored shirt – red, green, or blue. All the bears look the same to Goldilocks, so she cannot otherwise tell them apart. The bears in the red and blue shirts each make one true statement and one false statement. The bear in the red shirt says: “I'm Blue's dad. I'm Green's daughter.” The bear in the blue shirt says: “Red and Green are of opposite gender. Red and Green are my parents.” Help Goldilocks find out which bear is wearing which shirt. [b]p2.[/b] The University of Washington is holding a talent competition. The competition has five contests: math, physics, chemistry, biology, and ballroom dancing. Any student can enter into any number of the contests but only once for each one. For example, a student may participate in math, biology, and ballroom. It turned out that each student participated in an odd number of contests. Also, each contest had an odd number of participants. Was the total number of contestants odd or even? [b]p3.[/b] The $99$ greatest scientists of Mars and Venus are seated evenly around a circular table. If any scientist sees two colleagues from her own planet sitting an equal number of seats to her left and right, she waves to them. For example, if you are from Mars and the scientists sitting two seats to your left and right are also from Mars, you will wave to them. Prove that at least one of the $99$ scientists will be waving, no matter how they are seated around the table. [b]p4.[/b] One hundred boys participated in a tennis tournament in which every player played each other player exactly once and there were no ties. Prove that after the tournament, it is possible for the boys to line up for pizza so that each boy defeated the boy standing right behind him in line. [b]p5.[/b] To celebrate space exploration, the Science Fiction Museum is going to read Star Wars and Star Trek stories for $24$ hours straight. A different story will be read each hour for a total of $12$ Star Wars stories and $12$ Star Trek stories. George and Gene want to listen to exactly $6$ Star Wars and $6$ Star Trek stories. Show that no matter how the readings are scheduled, the friends can find a block of $12$ consecutive hours to listen to the stories together. [u]Round 2[/u] [b]p6.[/b] $2013$ people attended Cinderella's ball. Some of the guests were friends with each other. At midnight, the guests started turning into mice. After the first minute, everyone who had no friends at the ball turned into a mouse. After the second minute, everyone who had exactly one friend among the remaining people turned into a mouse. After the third minute, everyone who had two human friends left in the room turned into a mouse, and so on. What is the maximal number of people that could have been left at the ball after $2013$ minutes? [b]p7.[/b] Bill and Charlie are playing a game on an infinite strip of graph paper. On Bill’s turn, he marks two empty squares of his choice (not necessarily adjacent) with crosses. Charlie, on his turn, can erase any number of crosses, as long as they are all adjacent to each other. Bill wants to create a line of $2013$ crosses in a row. Can Charlie stop him? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Suppose that for some $m,n\in\mathbb{N}$ we have $\varphi (5^m-1)=5^n-1$, where $\varphi$ denotes the Euler function. Show that $(m,n)>1$.

Find the natural solutions of the equation $x^3 - y^3 = xy + 61$.

Let $T$ be a finite set of positive integers greater than 1. A subset $S$ of $T$ is called [i]good[/i] if for every $t \in T$ there exists some $s \in S$ with $\gcd(s, t) > 1$. Prove that the number of good subsets of $T$ is odd.

Let $A = \{a_1, \dots, a_{2024}\}$ be a set of $2024$ pairwise distinct real numbers. Assume that there exist positive integers $b_1, b_2,\dotsc,b_{2024}$ such that \[ a_1b_1 + a_2b_2 + \dots + a_{2024}b_{2024} = 0. \] Prove that one can choose $a_{2025}, a_{2026}, a_{2027}, \dots$ such that $a_k \in A$ for all $k \ge 2025$ and, for every positive integer $d$, there exist infinitely many positive integers $n$ satisfying \[ \sum_{k=1}^n a_k k^d = 0. \] [i]Daniel Zhu[/i]

The cells of a $100 \times 100$ table contain non-zero numbers. It turned out that all $100$ hundred-digit numbers written horizontally are divisible by 11. Could it be that exactly $99$ hundred-digit numbers written vertically are also divisible by $11$?

Determine all positive integers $n > 2$ , such that \[ \frac{1}{2} \varphi(n) \equiv 1 ( \bmod 6) \]

For some positive integer $n$, the number $110n^3$ has $110$ positive integer divisors, including $1$ and the number $110n^3$. How many positive integer divisors does the number $81n^4$ have? $\textbf{(A) }110 \qquad \textbf{(B) } 191 \qquad \textbf{(C) } 261 \qquad \textbf{(D) } 325 \qquad \textbf{(E) } 425$

The decimal representation of all integers from $1$ to an arbitrary integer $n$ are written one after another as such: $$123... 91011... 99100... (n).$$ Does there exist $n$ such that each of the digits $0,1,2,...,9$ appears the same number of times in the given sequence? (A Andzans)

There are $100$ boxes that were labeled with the numbers $00$, $01$, $02$,$…$, $99$ . The numbers $000$, $001$, $002$, $…$, $999$ were written on a thousand cards, one on each card. Placing a card in a box is permitted if the box number can be obtained by removing one of the digits from the card number. For example, it is allowed to place card $037$ in box $07$, but it is not allowed to place the card $156$ in box $65$.Can it happen that after placing all the cards in the boxes, there will be exactly $50$ empty boxes? If the answer is yes, indicate how the cards are placed in the boxes; If the answer is no, explain why it is impossible

Let $p > 7$ be a prime which leaves residue 1 when divided by 6. Let $m=2^p-1,$ then prove $2^{m-1}-1$ can be divided by $127m$ without residue.

Prove that the following equation has no solution in integer numbers: \[ x^2 + 4 = y^5. \] [i]Bulgaria[/i]