Decide whether there exists a set $M$ of positive integers satisfying the following conditions: (i) For any natural number $m>1$ there exist $a, b \in M$ such that $a+b = m.$ (ii) If $a, b, c, d \in M$, $a, b, c, d > 10$ and $a + b = c + d$, then $a = c$ or $a = d.$

Let $n$ be a composite number and $a_1,a_2… a_k\in \mathbb{N}$ are the numbers smaller than $n$ and not coprime with it (in this case $k=n-\phi (n)$). Let $b_1,b_2…b_k$ be a permutation of $a_1,a_2… a_k$ Prove that there exist indexes $i$ and $j$, $i\neq j$ for which $a_i b_i\equiv a_j b_j (mod $ $n)$.

In the expansion of $(ax+b)^{2000},$ where $a$ and $b$ are relatively prime positive integers, the coefficients of $x^{2}$ and $x^{3}$ are equal. Find $a+b.$

Prove that there exists a function $f : \mathbb{N} \mapsto \mathbb{N}$ that satisfies the following: [color=#FFFFFF]___[/color]1. For all positive integers $m, n$ we have \[\gcd(|f(m)-f(n)|, f(mn)) = f(\gcd(m, n))\] [color=#FFFFFF]___[/color]2. For all positive integers $m$, we have $f(f(m)) = f(m)$. [color=#FFFFFF]___[/color]3. For all positive integers $k$, there exists a positive integer $n$ with $2024^{k} \mid f(n)$. [i]Proposed by MV Adhitya, Archit Manas[/i]

The number obtained from the last two nonzero digits of $ 90!$ is equal to $ n$. What is $ n$? $ \textbf{(A)}\ 12 \qquad \textbf{(B)}\ 32 \qquad \textbf{(C)}\ 48 \qquad \textbf{(D)}\ 52 \qquad \textbf{(E)}\ 68$

Suppose in a given collection of $2016$ integer, the sum of any $1008$ integers is positive. Show that sum of all $2016$ integers is positive.

[b]a)[/b] Solve the system $$ \left\{\begin{matrix} 3^y-4^x=11\\ \log_4{x} +\log_3 y =3/2\end{matrix}\right. $$ [b]b)[/b] Solve the equation $ \quad 9^{\log_5 (x-2)} -5^{\log_9 (x+2)} = 4. $

Show that for any positive integer $n$ there exists an integer $m > 1$ such that $(\sqrt2-1)^n=\sqrt{m}-\sqrt{m-1}$.

Find all odd primes $ p$, if any, such that $ p$ divides $ \sum_{n\equal{}1}^{103}n^{p\minus{}1}$

Let $n{}$ $(n\geq 1)$ be an integer and a set $A=\{1,2,\ldots,n\}$. The set $A{}$ is $k-partitionable$ if it can be partitioned in $k{}$ disjoint sets with the same sum of elements. Show that $A{}$ is $k-partitionable$ if and only if $2k$ divides $n(n+1)$ and $2k\leq n+1$.

The circle $x^2+ y^2 = r^2$ meets the coordinate axis at $A = (r,0), B = (-r,0), C = (0,r)$ and $D = (0,-r).$ Let $P = (u,v)$ and $Q = (-u,v)$ be two points on the circumference of the circle. Let $N$ be the point of intersection of $PQ$ and the $y$-axis, and $M$ be the foot of the perpendicular drawn from $P$ to the $x$-axis. If $r^2$ is odd, $u = p^m > q^n = v,$ where $p$ and $q$ are prime numbers and $m$ and $n$ are natural numbers, show that \[ |AM| = 1, |BM| = 9, |DN| = 8, |PQ| = 8. \]

Determine a subset $ A\subset \mathbb{N}^*$ having $ 5$ different elements, so that the sum of the squares of its elements equals their product. Do not simply post the subset, show how you found it.

Let $a_1,a_2,\dots, a_n$ be positive integers with product $P,$ where $n$ is an odd positive integer. Prove that $$\gcd(a_1^n+P,a_2^n+P,\dots, a_n^n+P)\le 2\gcd(a_1,\dots, a_n)^n.$$ [i]Proposed by Daniel Liu[/i]

The lettes $A,C,F,H,L$ and $S$ represent six not necessarily distinct decimal digits so that $S \ne 0$ and $F \ne 0$. We form the two six-digit numbers $SCHLAF$ and $FLACHS$. Show that the difference of these two numbers is divisible by $271$ if and only if $C=L$ and $H=A$. [i]Remark:[/i] The words "Schlaf" and "Flachs" are German for "sleep" and "flax".

Denote $\textrm{SL}_2 (\mathbb{Z})$ and $\textrm{SL}_3 (\mathbb{Z})$ the sets of matrices with $2$ rows and $2$ columns, respectively with $3$ rows and $3$ columns, with integer entries and their determinant equal to $1$. $\textbf{(a)}$ Let $N$ be a positive integer and let $g$ be a matrix with $3$ rows and $3$ columns, with rational entries. Suppose that for each positive divisor $M$ of $N$ there exists a rational number $q_M$, a positive divisor $f (M)$ of $N$ and a matrix $\gamma_M \in \textrm{SL}_3 (\mathbb{Z})$ such that \[ g = q_M \left(\begin{array}{ccc} 1 & 0 & 0\\ 0 & 1 & 0\\ 0 & 0 & f (M) \end{array}\right) \gamma_M \left(\begin{array}{ccc} 1 & 0 & 0\\ 0 & 1 & 0\\ 0 & 0 & M^{} \end{array}\right) . \] Moreover, if $q_1 = 1$, prove that $\det (g) = N$ and $g$ has the following shape: \[ g = \left(\begin{array}{ccc} a_{11} & a_{12} & Na_{13}\\ a_{21} & a_{22} & Na_{23}\\ Na_{31} & Na_{32} & Na_{33} \end{array}\right), \] where $a_{ij}$ are all integers, $i, j \in \{ 1, 2, 3 \} .$ $\textbf{(b)}$ Provide an example of a matrix $g$ with $2$ rows and $2$ columns which satisfies the following properties: $\bullet$ For each positive divisor $M$ of $6$ there exists a rational number $q_M$, a positive divisor $f (M)$ of $6$ and a matrix $\gamma_M \in \textrm{SL}_2 (\mathbb{Z})$ such that \[ g = q_M \left(\begin{array}{cc} 1 & 0\\ 0 & f (M) \end{array}\right) \gamma_M \left(\begin{array}{cc} 1 & 0\\ 0 & M^{} \end{array}\right) \] and $q_1 = 1$. $\bullet$ $g$ does not have its determinant equal to $6$ and is not of the shape \[ g = \left(\begin{array}{cc} a_{22} & 6 a_{23}\\ 6 a_{32} & 6 a_{33} \end{array}\right), \] where $a_{ij}$ are all positive integers, $i, j \in \{ 2, 3 \}$. [i](Radu Toma)[/i]

Show that [list=a][*] infinitely many perfect squares are a sum of a perfect square and a prime number, [*] infinitely many perfect squares are not a sum of a perfect square and a prime number. [/list]

[b]p1[/b]. Is it possible to find $n$ positive numbers such that their sum is equal to $1$ and the sum of their squares is less than $\frac{1}{10}$? [b]p2.[/b] In the country of Sepulia, there are several towns with airports. Each town has a certain number of scheduled, round-trip connecting flights with other towns. Prove that there are two towns that have connecting flights with the same number of towns. [b]p3.[/b] A $4 \times 4$ magic square is a $4 \times 4$ table filled with numbers $1, 2, 3,..., 16$ - with each number appearing exactly once - in such a way that the sum of the numbers in each row, in each column, and in each diagonal is the same. Is it possible to complete $\begin{bmatrix} 2 & 3 & * & * \\ 4 & * & * & *\\ * & * & * & *\\ * & * & * & * \end{bmatrix}$ to a magic square? (That is, can you replace the stars with remaining numbers $1, 5, 6,..., 16$, to obtain a magic square?) [b]p4.[/b] Is it possible to label the edges of a cube with the numbers $1, 2, 3, ... , 12$ in such a way that the sum of the numbers labelling the three edges coming into a vertex is the same for all vertices? [b]p5.[/b] (Bonus) Several ants are crawling along a circle with equal constant velocities (not necessarily in the same direction). If two ants collide, both immediately reverse direction and crawl with the same velocity. Prove that, no matter how many ants and what their initial positions are, they will, at some time, all simultaneously return to the initial positions. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that the sequence defined by: $$ y_ {n + 1} = \frac {1} {2} (3y_ {n} + \sqrt {5y_ {n} ^ {2} -4}) , \,\, \forall n \ge 0$$ with $ y_ {0} = 1$ consists only of integers.

Find the greatest natural number $n$ such there exist natural numbers $x_{1}, x_{2}, \ldots, x_{n}$ and natural $a_{1}< a_{2}< \ldots < a_{n-1}$ satisfying the following equations for $i =1,2,\ldots,n-1$: \[x_{1}x_{2}\ldots x_{n}= 1980 \quad \text{and}\quad x_{i}+\frac{1980}{x_{i}}= a_{i}.\]

Show that for each positive integer $n$, there is a positive integer $k$ such that the decimal representation of each of the numbers $k, 2k,\ldots, nk$ contains all of the digits $0, 1, 2,\ldots, 9$.

Given a natural $n>1$ and its prime fatorization $n=p_1^{\alpha 1}p_2^{\alpha_2} \cdots p_k^{\alpha_k}$, its [i]false derived[/i] is defined by $$f(n)=\alpha_1p_1^{\alpha_1-1}\alpha_2p_2^{\alpha_2-1}...\alpha_kp_k^{\alpha_k-1}.$$ Prove that there exist infinitely many naturals $n$ such that $f(n)=f(n-1)+1$.

p1. It is known that $m$ and $n$ are two positive integer numbers consisting of four digits and three digits respectively. Both numbers contain the number $4$ and the number $5$. The number $59$ is a prime factor of $m$. The remainder of the division of $n$ by $38$ is $ 1$. If the difference between $m$ and $n$ is not more than $2015$. determine all possible pairs of numbers $(m,n)$. p2. It is known that the equation $ax^2 + bx + c = $0 with $a> 0$ has two different real roots and the equation $ac^2x^4 + 2acdx^3 + (bc + ad^2) x^2 + bdx + c = 0$ has no real roots. Is it true that $ad^2 + 2ad^2 <4bc + 16c^3$ ? p3. A basketball competition consists of $6$ teams. Each team carries a team flag that is mounted on a pole located on the edge of the match field. There are four locations and each location has five poles in a row. Pairs of flags at each location starting from the far right pole in sequence. If not all poles in each location must be flagged, determine as many possible flag arrangements. p4. It is known that two intersecting circles $L_1$ and $L_2$ have centers at $M$ and $N$ respectively. The radii of the circles $L_1$ and $L_2$ are $5$ units and $6$ units respectively. The circle $L_1$ passes through the point $N$ and intersects the circle $L_2$ at point $P$ and at point $Q$. The point $U$ lies on the circle $L_2$ so that the line segment $PU$ is a diameter of the circle $L_2$. The point $T$ lies at the extension of the line segment $PQ$ such that the area of ​​the quadrilateral $QTUN$ is $792/25$ units of area. Determine the length of the $QT$. p5. An ice ball has an initial volume $V_0$. After $n$ seconds ($n$ is natural number), the volume of the ice ball becomes $V_n$ and its surface area is $L_n$. The ice ball melts with a change in volume per second proportional to its surface area, i.e. $V_n - V_{n+1} = a L_n$, for every n, where a is a positive constant. It is also known that the ratio between the volume changes and the change of the radius per second is proportional to the area of ​​the property, that is $\frac{V_n - V_{n+1}}{R_n - R_{n+1}}= k L_n$ , where $k$ is a positive constant. If $V_1=\frac{27}{64} V_0$ and the ice ball melts totally at exactly $h$ seconds, determine the value of $h$.

Prove that for every positive integer $m$ there exists a positive integer N such that $S(2^n) > m$ for every positive integer $n > N$, where by $S(x)$ we denote the sum of digits of a positive integer $x$.

Find all functions $f: \mathbb{N} \to \mathbb{N}$ such that for any pair of naturals $m,n$, $$\gcd(f(m),n) = \gcd(m,f(n)).$$

Find all positive integers $n$ such that $n!$ can be written as the product of two Fibonacci numbers.