Find all functions $f : Z \to Z$ for which $f(g(n)) - g(f(n))$ is independent on $n$ for any $g : Z \to Z$.

In a sequence of natural numbers $ a_1 $, $ a_2 $, $ \dots $, $ a_ {1999} $, $ a_n-a_ {n-1} -a_ {n-2} $ is divisible by $ 100 (3 \leq n \leq 1999) $. It is known that $ a_1 = 19$ and $ a_2 = 99$. Find the remainder of $ a_1 ^ 2 + a_2 ^ 2 + \dots + a_ {1999} ^ 2 $ by $8$.

Find all real numbers $x, y,z,t \in [0, \infty)$ so that $$x + y + z \le t, \,\,\, x^2 + y^2 + z^2 \ge t \,\,\, and \,\,\,x^3 + y^3 + z^3 \le t.$$

Evaluate \[\int_{-\ln 2}^0\ \frac{dx}{\cos ^2 h x \cdot \sqrt{1-2a\tanh x +a^2}}\ (a>0)\]

Define $f(x,y)=\frac{xy}{x^2+y^2\ln(x^2)^2}$ if $x\ne0$, and $f(0,y)=0$ if $y\ne0$. Determine whether $\lim_{(x,y)\to(0,0)}f(x,y)$ exists, and find its value is if the limit does exist.

Alex, Bob, and Chris are driving cars down a road at distinct constant rates. All people are driving a positive integer number of miles per hour. All of their cars are $15$ feet long. It takes Alex $1$ second longer to completely pass Chris than it takes Bob to completely pass Chris. The passing time is defined as the time where their cars overlap. Find the smallest possible sum of their speeds, in miles per hour. [i]Proposed by Sammy Charney[/i]

Let $D = \{z\in \mathbb{C}: |z| < 1\}$ be the open unit disk in the complex plane and let $f : D \to D$ be a holomorphic function such that $\lim_{|z|\to 1}|f(z)| = 1$. Let the Taylor series of $f$ be $f(z) = \sum_{n=0}^{\infty} a_nz^n$. Prove that the number of zeroes of $f$ (counted with multiplicities) equals $\sum_{n=0}^{\infty} n|a_n|^2$.

A square with side $1$ is intersected by two parallel lines as shown in the figure. Find the sum of the perimeters of the shaded triangles if the distance between the lines is also $1$. [img]https://cdn.artofproblemsolving.com/attachments/9/e/4e70610b80871325a72e923a0909eff06aebfa.png[/img]

Let $ABC$ be a triangle with $AB = AC \neq BC$ and let $I$ be its incentre. The line $BI$ meets $AC$ at $D$, and the line through $D$ perpendicular to $AC$ meets $AI$ at $E$. Prove that the reflection of $I$ in $AC$ lies on the circumcircle of triangle $BDE$.

Let $ABC$ be a right-angled triangle ($\angle C = 90^\circ$) and $D$ be the midpoint of an altitude from C. The reflections of the line $AB$ about $AD$ and $BD$, respectively, meet at point $F$. Find the ratio $S_{ABF}:S_{ABC}$. Note: $S_{\alpha}$ means the area of $\alpha$.

Suppose there are $n\geq{5}$ different points arbitrarily arranged on a circle, the labels are $1, 2,\dots $, and $n$, and the permutation is $S$. For a permutation , a “descending chain” refers to several consecutive points on the circle , and its labels is a clockwise descending sequence (the length of sequence is at least $2$), and the descending chain cannot be extended to longer .The point with the largest label in the chain is called the "starting point of descent", and the other points in the chain are called the “non-starting point of descent” . For example: there are two descending chains $5, 2$and $4, 1$ in $5, 2, 4, 1, 3$ arranged in a clockwise direction, and $5$ and $4$ are their starting points of descent respectively, and $2, 1$ is the non-starting point of descent . Consider the following operations: in the first round, find all descending chains in the permutation $S$, delete all non-starting points of descent , and then repeat the first round of operations for the arrangement of the remaining points, until no more descending chains can be found. Let $G(S)$ be the number of all descending chains that permutation $S$ has appeared in the operations, $A(S)$ be the average value of $G(S)$of all possible n-point permutations $S$. (1) Find $A(5)$. (2)For $n\ge{6}$ , prove that $\frac{83}{120}n-\frac{1}{2} \le A(S) \le \frac{101}{120}n-\frac{1}{2}.$

There are two letters in a language. Every word consists of seven letters, and two different words always have different letters on at least three places. a. Show that such a language cannot have more than $16$ words. b. Can there be $16$ words in the language?

Let $a$, $b$, $c$ be the three roots of the equation $x^3-(k+1)x^2+kx+12=0$, where $k$ is a real number. If $(a-2)^3+(b-2)^3+(c-2)^3=-18$, find the value of $k$.

Let $a, b, c$ be positive real numbers for which $ab + ac + bc \ge a + b + c$. Prove that $a + b + c \ge 3$.

The numbers $ x,\,y,\,z$ are proportional to $ 2,\,3,\,5$. The sum of $ x$, $ y$, and $ z$ is $ 100$. The number $ y$ is given by the equation $ y \equal{} ax \minus{} 10$. Then $ a$ is: $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ \frac{3}{2}\qquad \textbf{(C)}\ 3\qquad \textbf{(D)}\ \frac{5}{2}\qquad \textbf{(E)}\ 4$

Let there be given two sequences of integers $f_i(1), f_i(2), \cdots (i = 1, 2)$ satisfying: $(i) f_i(nm) = f_i(n)f_i(m)$ if $\gcd(n,m) = 1$; $(ii)$ for every prime $P$ and all $k = 2, 3, 4, \cdots$, $f_i(P^k) = f_i(P)f_i(P^{k-1}) - P^2f(P^{k-2}).$ Moreover, for every prime $P$: $(iii) f_1(P) = 2P,$ $(iv) f_2(P) < 2P.$ Prove that $|f_2(n)| < f_1(n)$ for all $n$.

Prove that, for all integer $a>1$, the prime divisors of $5a^4-5a^2+1$ have the form $20k\pm1,k\in\mathbb{Z}$. [i]Proposed by Géza Kós.[/i]

The points $E, F, G$ and $H{}$ are located on the sides $DA, AB, BC$ and $CD$ of the rhombus $ABCD$ respectively, so that the segments $EF$ and $GH$ touch the circle inscribed in the rhombus. Prove that $FG\parallel HE$. [i]Proposed by V. Eisenstadt[/i]

Given rational numbers $a_1,...,a_n$ such that $\sum_{i=1}^n \{ka_i\}<\frac{n}{2}$ for any positive integer $k$. a) Prove that at least one of $a_1,...,a_n$ is integer. b) Is the previous statement true, if the number $\frac{n}{2}$ is replaced by the greater number? (Here $\{x\}$ means a fractional part of $x$.) (N. Selinger)

In the diagram below, $AB$ is a diameter of circle $O$. Point C is drawn such that $\overline{BC}$ is tangent to circle $O$, and $AB = BC$. A point $F$ is selected on line $AB$ and a point $D$ is selected on circle $O$ such that $\angle CDF = 90^\circ$. Line $\overline{BD}$ is then extended to point $E$ such that $AE$ is tangent to circle $O$. Given that $AE = 5$, calculate the length of $\overline{AF}$. (Diagram not to scale) [asy] size(120); pair A,O,F,B,D,EE,C; A=(-5,0); O=(0,0); B=(5,0); EE=(-5,6); F=(3.8,0); D=(-2.5,4.33); C=(5,10); dot(A^^O^^B^^EE^^F^^D^^C); draw(circle(O,5)); draw(A--EE--F--cycle); draw(D--B--C--cycle); draw(A--B); label("$A$",A,W); label("$O$",O,S); label("$B$",B,E); label("$F$",F,S); label("$E$",EE,N); label("$D$",D,N); label("$C$",C,N); [/asy] $\textbf{(A) }\dfrac92\qquad\textbf{(B) }5\qquad\textbf{(C) }3\sqrt3\qquad\textbf{(D) }7\qquad\textbf{(E) }\text{impossible to determine}$

There are $2023$ distinct points on a plane, which are coloured in white or red, such that for each white point, there are exactly two red points whose distance is $2023$ to that white point. Find the minimum number of red points.

Let $\mathbb C$ denote the set of all complex numbers. Define $$A=\{(z,w)|z,w\in\mathbb C\text{ and }|z|=|w|\}$$$$B=\{(z,w)|z,w\in\mathbb C\text{ and }z^2=w^2\}$$$\textbf{(A)}~A=B$ $\textbf{(B)}~A\subset B\text{ and }A\ne B$ $\textbf{(C)}~B\subset A\text{ and }B\ne A$ $\textbf{(D)}~\text{None of the above}$

For each positive integer, define a function \[ f(n)=\begin{cases}0, &\text{if n is the square of an integer}\\ \\ \left\lfloor\frac{1}{\{\sqrt{n}\}}\right\rfloor, &\text{if n is not the square of an integer}\end{cases}. \] Find the value of $\sum_{k=1}^{200} f(k)$.

All squares of a $ 20\times 20$ table are empty. Misha* and Sasha** in turn put chips in free squares (Misha* begins). The player after whose move there are four chips on the intersection of two rows and two columns wins. Which of the players has a winning strategy? [i]Proposed by A. Golovanov[/i] [b]US Name Conversions: [/b] [i]Misha*: Naoki Sasha**: Richard[/i]

There exists a unique positive integer $a$ for which the sum \[U=\sum_{n=1}^{2023}\left\lfloor\dfrac{n^{2}-na}{5}\right\rfloor\] is an integer strictly between $-1000$ and $1000$. For that unique $a$, find $a+U$. (Note that $\lfloor x\rfloor$ denotes the greatest integer that is less than or equal to $x$.)