A set of distinct positive integers is called [i]singular [/i] if, for each of its elements, after crossing out that element, the remaining ones can be grouped into two sets with no common elements such that the sum of the elements in the two groups is the same. Find the smallest positive integer $n>1$ such that there exists a singular set $A$ with $n$ items.

On an infinite chessboard, a solitaire game is played as follows: at the start, we have $n^2$ pieces occupying a square of side $n.$ The only allowed move is to jump over an occupied square to an unoccupied one, and the piece which has been jumped over is removed. For which $n$ can the game end with only one piece remaining on the board?

Let $n$ be a positive integer. We call a $n$-tuple $(a_1, . . . , a_n)$ of positive integers [i]nice [/i] if $\bullet$ $gcd (a_1, . . . , a_n) = 1$, and $\bullet$ $a_i|a_{i-1} + a_{i+1}$, for all $i = 1, . . . , n$ (we define $a_0 = a_n$ and $a_{n+1} = a1$ here). Find the maximal possible value of the sum $a_1 +...+ a_n$ if $(a_1, . . . , a_n)$ is a nice $n$-tuple.

In the Cartesian plane consider the hyperbola \[\Gamma=\{M(x,y)\in\mathbb{R}^2 \vert \frac{x^2}{4}-y^2=1\} \] and a conic $\Gamma '$, disjoint from $\Gamma$. Let $n(\Gamma ,\Gamma ')$ be the maximal number of pairs of points $(A,A')\in\Gamma\times\Gamma '$ such that $AA'\le BB'$, for any $(B,B')$ For each $p\in\{0,1,2,4\}$, find the equation of $\Gamma'$ for which $n(\Gamma ,\Gamma ')=p$. Justify the answer.

Let $(x_n)_{n\geq 1}$ be an increasing and unbounded sequence of positive integers such that $x_1=1$ and $x_{n+1}\leq 2x_n$ for all $n\geq 1$. Prove that every positive integer can be written as a finite sum of distinct terms of the sequence. [i]Note:[/i] Two terms $x_i$ and $x_j$ of the sequence are considered distinct if $i\neq j$.

Suppose that $S$ is a finite set of positive integers. If the greatest integer in $S$ is removed from $S$, then the average value (arithmetic mean) of the integers remaining is $32$. If the least integer is $S$ is [i]also[/i] removed, then the average value of the integers remaining is $35$. If the greatest integer is then returned to the set, the average value of the integers rises to $40$. The greatest integer in the original set $S$ is $72$ greater than the least integer in $S$. What is the average value of all the integers in the set $S$? $\textbf{(A)} ~36.2 \qquad\textbf{(B)} ~36.4 \qquad\textbf{(C)} ~36.6 \qquad\textbf{(D)} ~36.8 \qquad\textbf{(E)} ~37$

Find the set $S$ of primes such that $p \in S$ if and only if there exists an integer $x$ such that $x^{2010} + x^{2009} + \cdots + 1 \equiv p^{2010} \pmod{p^{2011}}$. [i]Brian Hamrick.[/i]

In how many ways can one choose distinct numbers a and b from {1, 2, 3, ..., 2005} such that a + b is a multiple of 5?

[b]p1.[/b] Farmer James goes to Kristy’s Krispy Chicken to order a crispy chicken sandwich. He can choose from $3$ types of buns, $2$ types of sauces, $4$ types of vegetables, and $4$ types of cheese. He can only choose one type of bun and cheese, but can choose any nonzero number of sauces, and the same with vegetables. How many different chicken sandwiches can Farmer James order? [b]p2.[/b] A line with slope $2$ and a line with slope $3$ intersect at the point $(m, n)$, where $m, n > 0$. These lines intersect the $x$ axis at points $A$ and $B$, and they intersect the y axis at points $C$ and $D$. If $AB = CD$, find $m/n$. [b]p3.[/b] A multi-set of $11$ positive integers has a median of $10$, a unique mode of $11$, and a mean of $ 12$. What is the largest possible number that can be in this multi-set? (A multi-set is a set that allows repeated elements.) [b]p4.[/b] Farmer James is swimming in the Eggs-Eater River, which flows at a constant rate of $5$ miles per hour, and is recording his time. He swims $ 1$ mile upstream, against the current, and then swims $1$ mile back to his starting point, along with the current. The time he recorded was double the time that he would have recorded if he had swum in still water the entire trip. To the nearest integer, how fast can Farmer James swim in still water, in miles per hour? [b]p5.[/b] $ABCD$ is a square with side length $60$. Point $E$ is on $AD$ and $F$ is on $CD$ such that $\angle BEF = 90^o$. Find the minimum possible length of $CF$. [b]p6.[/b] Farmer James makes a trianglomino by gluing together $5$ equilateral triangles of side length $ 1$, with adjacent triangles sharing an entire edge. Two trianglominoes are considered the same if they can be matched using only translations and rotations (but not reflections). How many distinct trianglominoes can Farmer James make? [b]p7.[/b] Two real numbers $x$ and $y$ satisfy $x^2 - y^2 = 2y - 2x$ , and $x + 6 = y^2 + 2y$. What is the sum of all possible values of$ y$? [b]p8.[/b] Let $N$ be a positive multiple of $840$. When $N$ is written in base $6$, it is of the form $\overline{abcdef}_6$ where $a, b, c, d, e, f$ are distinct base $6$ digits. What is the smallest possible value of $N$, when written in base $6$? [b]p9.[/b] For $S = \{1, 2,..., 12\}$, find the number of functions $f : S \to S$ that satisfy the following $3$ conditions: (a) If $n$ is divisible by $3$, $f(n)$ is not divisible by $3$, (b) If $n$ is not divisible by $3$, $f(n)$ is divisible by $3$, and (c) $f(f(n)) = n$ holds for exactly $8$ distinct values of $n$ in $S$. [b]p10.[/b] Regular pentagon $JAMES$ has area $ 1$. Let $O$ lie on line $EM$ and $N$ lie on line $MA$ so that $E, M, O$ and $M, A, N$ lie on their respective lines in that order. Given that $MO = AN$ and $NO = 11 \cdot ME$, find the area of $NOM$. [b]p11.[/b] Hen Hao is flipping a special coin, which lands on its sunny side and its rainy side each with probability $1/2$. Hen Hao flips her coin ten times. Given that the coin never landed with its rainy side up twice in a row, find the probability that Hen Hao’s last flip had its sunny side up. [b]p12.[/b] Find the product of all integer values of a such that the polynomial $x^4 + 8x^3 + ax^2 + 2x - 1$ can be factored into two non-constant polynomials with integer coefficients. [b]p13.[/b] Isosceles trapezoid $ABCD$ has $AB = CD$ and $AD = 6BC$. Point $X$ is the intersection of the diagonals $AC$ and $BD$. There exist a positive real number $k$ and a point $P$ inside $ABCD$ which satisfy $$[PBC] : [PCD] : [PDA] = 1 : k : 3,$$ where $[XYZ]$ denotes the area of triangle $XYZ$. If $PX \parallel AB$, find the value of $k$. [b]p14.[/b] How many positive integers $n < 1000$ are there such that in base $10$, every digit in $3n$ (that isn’t a leading zero) is greater than the corresponding place value digit (possibly a leading zero) in $n$? For example, $n = 56$, $3n = 168$ satisfies this property as $1 > 0$, $6 > 5$, and $8 > 6$. On the other hand, $n = 506$, $3n = 1518$ does not work because of the hundreds place. [b]p15.[/b] Find the greatest integer that is smaller than $$\frac{2018}{37^2}+\frac{2018}{39^2}+ ... +\frac{2018}{ 107^2}.$$ PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $x$ and $y$ be positive real numbers and $\theta$ an angle such that $\theta \neq \frac{\pi}{2}n$ for any integer $n$. Suppose \[\frac{\sin\theta}{x}=\frac{\cos\theta}{y}\] and \[ \frac{\cos^4 \theta}{x^4}+\frac{\sin^4\theta}{y^4}=\frac{97\sin2\theta}{x^3y+y^3x}. \] Compute $\frac xy+\frac yx.$

The parallel sides of a trapezoid are $ 3$ and $ 9$. The non-parallel sides are $ 4$ and $ 6$. A line parallel to the bases divides the trapezoid into two trapezoids of equal perimeters. The ratio in which each of the non-parallel sides is divided is: [asy]defaultpen(linewidth(.8pt)); unitsize(2cm); pair A = origin; pair B = (2.25,0); pair C = (2,1); pair D = (1,1); pair E = waypoint(A--D,0.25); pair F = waypoint(B--C,0.25); draw(A--B--C--D--cycle); draw(E--F); label("6",midpoint(A--D),NW); label("3",midpoint(C--D),N); label("4",midpoint(C--B),NE); label("9",midpoint(A--B),S);[/asy]$ \textbf{(A)}\ 4: 3\qquad \textbf{(B)}\ 3: 2\qquad \textbf{(C)}\ 4: 1\qquad \textbf{(D)}\ 3: 1\qquad \textbf{(E)}\ 6: 1$

A frog is jumping on $N$ stones which are numbered from $1$ to $N$ from left to right. The frog is jumping to the previous stone (to the left) with probability $p$ and is jumping to the next stone (to the right) with probability $1-p$. If the frog has jumped to the left from the leftmost stone or to the right from the rightmost stone, it will fall into the water. The frog is initially on the leftmost stone. If $p< \tfrac 13$, show that the frog will fall into the water from the rightmost stone with a probability higher than $\tfrac 12$.

Let $ABC$ be a given triangle. Find the locus $\mathbf M$ of all vertices $Z$ such that triangle $XYZ$ is equilateral where $X$ is any point of segment $AB$ and $Y\neq X$ lies on ray $AC.$

We have a number of towns, with bus routes between some of them (each bus route goes from a town to another town without any stops). It is known that you can get from any town to any other by bus (possibly changing buses several times). Mr. Ivanov bought one ticket for each of the bus routes (a ticket allows single travel in either direction, but not returning on the same route). Mr. Petrov bought n tickets for each of the bus routes. Both Ivanov and Petrov started at town A. Ivanov used up all his tickets without buying any new ones and finished his travel at town B. Petrov, after using some of his tickets, got stuck at town X: he can not leave it without buying a new ticket. Prove that X is either A or B.

Determine the smallest integer $j$ such that it is possible to fill the fields of the table $10\times 10$ with numbers from $1$ to $100$ so that every $10$ consecutive numbers lie in some of the $j\times j$ squares of the table. Czech Republic

Given an integer $c$, the sequence $a_0, a_1, a_2, ...$ is generated using the recurrence relation $a_0 = c$ and $a_i = a^i_{i-1} + 2021a_{i-1}$ for all $i \ge 1$. Given that $a_0 = c$, let $f(c)$ be the smallest positive integer $n$ such that $a_n - 1$ is a multiple of $47$. Compute $$\sum^{46}_{k=1} f(k).$$