The function $f(n)$ is defined on the positive integers and takes non-negative integer values. $f(2)=0,f(3)>0,f(9999)=3333$ and for all $m,n:$ \[ f(m+n)-f(m)-f(n)=0 \text{ or } 1. \] Determine $f(1982)$.

Find all numbers $x \in \mathbb Z$ for which the number \[x^4 + x^3 + x^2 + x + 1\] is a perfect square.

Let $ABC$ be an acute-angled triangle, $\Gamma$ its circumcircle and $M$ the midpoint of $BC$. Let $N$ be a point in the arc $BC$ of $\Gamma$ not containing $A$ such that $\angle NAC= \angle BAM$. Let $R$ be the midpoint of $AM$, $S$ the midpoint of $AN$ and $T$ the foot of the altitude through $A$. Prove that $R$, $S$ and $T$ are collinear.

The number of points common to the graphs of \[(x-y+2)(3x+y-4)=0\text{ and }(x+y-2)(2x-5y+7)=0\] is: $\textbf{(A) }2\qquad \textbf{(B) }4\qquad \textbf{(C) }6\qquad \textbf{(D) }16\qquad \textbf{(E) }\text{infinite}$

Square $ABCD$ in the coordinate plane has vertices at the points $A(1,1), B(-1,1), C(-1,-1),$ and $D(1,-1).$ Consider the following four transformations: [list=] [*]$L,$ a rotation of $90^{\circ}$ counterclockwise around the origin; [*]$R,$ a rotation of $90^{\circ}$ clockwise around the origin; [*]$H,$ a reflection across the $x$-axis; and [*]$V,$ a reflection across the $y$-axis. [/list] Each of these transformations maps the squares onto itself, but the positions of the labeled vertices will change. For example, applying $R$ and then $V$ would send the vertex $A$ at $(1,1)$ to $(-1,-1)$ and would send the vertex $B$ at $(-1,1)$ to itself. How many sequences of $20$ transformations chosen from $\{L, R, H, V\}$ will send all of the labeled vertices back to their original positions? (For example, $R, R, V, H$ is one sequence of $4$ transformations that will send the vertices back to their original positions.) $\textbf{(A)}\ 2^{37} \qquad\textbf{(B)}\ 3\cdot 2^{36} \qquad\textbf{(C)}\ 2^{38} \qquad\textbf{(D)}\ 3\cdot 2^{37} \qquad\textbf{(E)}\ 2^{39}$

Find the number of positive integers $n \le 2014$ such that there exists integer $x$ that satisfies the condition that $\frac{x+n}{x-n}$ is an odd perfect square.

Define $S_n$ as the set ${1,2,\cdots,n}$. A non-empty subset $T_n$ of $S_n$ is called $balanced$ if the average of the elements of $T_n$ is equal to the median of $T_n$. Prove that, for all $n$, the number of balanced subsets $T_n$ is odd.

Let $P_1$, $P_2$, $\dots$, $P_{2n}$ be $2n$ distinct points on the unit circle $x^2+y^2=1$, other than $(1,0)$. Each point is colored either red or blue, with exactly $n$ red points and $n$ blue points. Let $R_1$, $R_2$, $\dots$, $R_n$ be any ordering of the red points. Let $B_1$ be the nearest blue point to $R_1$ traveling counterclockwise around the circle starting from $R_1$. Then let $B_2$ be the nearest of the remaining blue points to $R_2$ travelling counterclockwise around the circle from $R_2$, and so on, until we have labeled all of the blue points $B_1, \dots, B_n$. Show that the number of counterclockwise arcs of the form $R_i \to B_i$ that contain the point $(1,0)$ is independent of the way we chose the ordering $R_1, \dots, R_n$ of the red points.

How many ordered pairs of integers $(m, n)$ satisfy $\sqrt{n^2 - 49} = m$? $ \textbf{(A) }1 \qquad \textbf{(B) }2 \qquad \textbf{(C) }3 \qquad \textbf{(D) }4 \qquad \textbf{(E) } \text{Infinitely many} \qquad $

Do there exist positive integers $a$ and $b$ such that each of the numbers $2^a+3^b,$ $3^a+5^b$ and $5^a+2^b$ is divisible by 29?

Determine the roots of unity in the field of $ p$-adic numbers. [i]L. Fuchs[/i]

Find the greatest integer $k\leq 2023$ for which the following holds: whenever Alice colours exactly $k$ numbers of the set $\{1,2,\dots, 2023\}$ in red, Bob can colour some of the remaining uncoloured numbers in blue, such that the sum of the red numbers is the same as the sum of the blue numbers. Romania

Let $S$ denote $\{1, \dots , 100\}$, and let $f$ be a permutation of $S$ such that for all $x\in S$, $f(x)\ne x$. Over all such $f$, find the maximum number of elements $j$ that satisfy $\underbrace{f(\dots(f(j))\dots)}_{\text{j times}}=j$. [i]Proposed by Hari Desikan[/i]

The towns $A,B,C,D,E$ are located clockwise on a circular road such that the distance between $A$ and $B$, $B$ and $C$, $C$ and $D$, $E$ and $A$ are $5$, $5$, $2$, $1$ and $4$ km respectively. A health center will be located on that road such that the maximum of the shortest distance to each town will be minimum. How many alternative locations are there for the health center? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ \text{None of the preceding} $

The graph of the function $ f$ is shown below. How many solutions does the equation $ f(f(x)) \equal{} 6$ have? [asy]size(220); defaultpen(fontsize(10pt)+linewidth(.8pt)); dotfactor=4; pair P1=(-7,-4), P2=(-2,6), P3=(0,0), P4=(1,6), P5=(5,-6); real[] xticks={-7,-6,-5,-4,-3,-2,-1,1,2,3,4,5,6}; real[] yticks={-6,-5,-4,-3,-2,-1,1,2,3,4,5,6}; draw(P1--P2--P3--P4--P5); dot("(-7, -4)",P1); dot("(-2, 6)",P2,LeftSide); dot("(1, 6)",P4); dot("(5, -6)",P5); xaxis("$x$",-7.5,7,Ticks(xticks),EndArrow(6)); yaxis("$y$",-6.5,7,Ticks(yticks),EndArrow(6));[/asy]$ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 7$

Let $n$ be a positive integer and $M=\{1,2,\ldots, n\}.$ A subset $T\subset M$ is called [i]heavy[/i] if each of its elements is greater or equal than $|T|.$ Let $f(n)$ denote the number of heavy subsets of $M.$ Describe a method for finding $f(n)$ and use it to calculate $f(32).$