Let $n>1$ be an integer. Prove that there exists an integer $n-1 \ge m \ge \left \lfloor \frac{n}{2} \right \rfloor$ such that the following equation has integer solutions with $a_m>0:$ $$\frac{a_{m}}{m+1}+\frac{a_{m+1}}{m+2}+ \cdots + \frac{a_{n-1}}{n}=\frac{1}{\textrm{lcm}\left ( 1,2, \cdots , n \right )}$$ [i]Proposed by Navid Safaei[/i]

We say that a rational number is [i]spheric[/i] if it is the sum of three squares of rational numbers (not necessarily distinct). Prove that: [b]a)[/b] $ 7 $ is not spheric. [b]b)[/b] a rational spheric number raised to the power of any natural number greater than $ 1 $ is spheric.

Integers $a, b$ and $c$ satisfy the condition $ab + bc + ca = 1$. Is it true that the number $(1+a^2)(1+b^2)(1+c^2)$ is a perfect square? Why?

Can be colored the positive integers with 2009 colors if we know that each color paints infinitive integers and that we can not find three numbers colored by three different colors for which the product of two numbers equal to the third one?

a) Find all the integers $m$ and $n$ such that \[9m^2+3n=n^2+8\] b) Let $a,b\in \mathbb{N}^*$ . If $x=a^{a+b}+(a+b)^a$ and $y=a^a+(a+b)^{a+b}$ which one is bigger? [i]Florin Nicoara, Valer Pop[/i]

For any set $A = \{x_1, x_2, x_3, x_4, x_5\}$ of five distinct positive integers denote by $S_A$ the sum of its elements, and denote by $T_A$ the number of triples $(i, j, k)$ with $1 \le i < j < k \le 5$ for which $x_i + x_j + x_k$ divides $S_A$. Find the largest possible value of $T_A$.

Let $k$ be a fixed integer greater than 1, and let ${m=4k^2-5}$. Show that there exist positive integers $a$ and $b$ such that the sequence $(x_n)$ defined by \[x_0=a,\quad x_1=b,\quad x_{n+2}=x_{n+1}+x_n\quad\text{for}\quad n=0,1,2,\dots,\] has all of its terms relatively prime to $m$. [i]Proposed by Jaroslaw Wroblewski, Poland[/i]

Suppose that $ m$ and $ n$ are odd integers such that $ m^2\minus{}n^2\plus{}1$ divides $ n^2\minus{}1$. Prove that $ m^2\minus{}n^2\plus{}1$ is a perfect square.

Find all pairs of integers $(x,y)$ such that $x \geq 0$ and \[ (6^x-y)^2 = 6^{x+1}-y. \]

Let $n,k$ be positive integers such that $n$ is not divisible by $3$ and $k\ge n$. Prove that there is an integer $m$ divisible by $n$ whose sum of digits in base $10$ equals $k$.

Let $r>1$ be a rational number. Alice plays a solitaire game on a number line. Initially there is a red bead at $0$ and a blue bead at $1$. In a move, Alice chooses one of the beads and an integer $k \in \mathbb{Z}$. If the chosen bead is at $x$, and the other bead is at $y$, then the bead at $x$ is moved to the point $x'$ satisfying $x'-y=r^k(x-y)$. Find all $r$ for which Alice can move the red bead to $1$ in at most $2021$ moves.

The President of the Bank "Glavny Central" Gerasim Shchenkov announced that from January $2$, $2001$ until January $31$ of the same year, the dollar exchange rate would not go beyond the boundaries of the corridor of $27$ rubles $50$ kopecks. and $28$ rubles $30$ kopecks for the dollar. On January $2$, the rate will be a multiple of $5$ kopecks, and starting from January 3, each day will differ from the rate of the previous day by exactly $5$ kopecks. Mr. Shchenkov suggested that citizens try to guess what the dollar exchange rate will be during the specified period. Anyone who can give an accurate forecast for at least one day, he promised to give a cash prize. One interesting person lives in our house, a tireless arguer. For his passion for arguments and constant winnings, he was even nicknamed Zhora Sporos. Zhora claims that he can give such a forecast of the dollar exchange rate for every day from January 424 to January 4314, which he will surely guess at least once, if, of course, the banker strictly acts in accordance with the announced rules. Is Zhora right? Note: 1 ruble =100 kopecks [hide=original wording]10-I-7. Президент банка "Главный централ" Герасим Щенков объявил, что со 2-го января 2001 года и до 31-го января этого же года курс доллара не будет выходить за границы коридора 27 руб. 50 коп. и 28 руб. 30 коп. за доллар. 2-го января курс будет кратен 5 копейкам, а, начиная с 3-го января, каждый день будет отличаться от курса предыдущего дня ровно на 5 копеек. Господин Щенков предложил гражданам попробовать угадать, каким будет курс доллара в течение указанного периода. Тому, кто сумеет дать точный прогноз хотя бы на один день, он обещал выдать денежный приз. В нашем доме живет один интересный человек, неутомимый спорщик. За страсть к спорам и постоянные выигрыши его даже прозвали Жора Спорос. Жора утверждает, что может дать такой прогноз курса доллара на каждый день со 2-го по 31-е января, что обязательно хотя бы один раз угадает, если, конечно, банкир будет строго действовать в соответствии с объявленными правилами. Прав ли Жора? [/hide]

The sets $A$ and $B$ are subsets of the positive integers. The sum of any two distinct elements of $A$ is an element of $B$. The quotient of any two distinct elements of $B$ (where we divide the largest by the smallest of the two) is an element of $A$. Determine the maximum number of elements in $A\cup B$.

Prove that there is no natural number $k$ such that $k^{1999} - k^{1998} = 2k + 2$.

Let $a, b$ and $n$ be positive integers with $a>b$ such that all of the following hold: i. $a^{2021}$ divides $n$, ii. $b^{2021}$ divides $n$, iii. 2022 divides $a-b$. Prove that there is a subset $T$ of the set of positive divisors of the number $n$ such that the sum of the elements of $T$ is divisible by 2022 but not divisible by $2022^2$. [i]Proposed by Silouanos Brazitikos, Greece[/i]

Prove that one can find a $n_{0} \in \mathbb{N}$ such that $\forall m \geq n_{0}$, there exist three positive integers $a$, $b$ , $c$ such that (i) $m^3 < a < b < c < (m+1)^3$; (ii) $abc$ is the cube of an integer.

Let $ a $ , $ b $ , $ c $ , $ d $ , $ (a + b + c + 18 + d) $ , $ (a + b + c + 18 - d) $ , $ (b + c) $ , and $ (c + d) $ be distinct prime numbers such that $ a + b + c = 2010 $, $ a $, $ b $, $ c $, $ d \neq 3 $ , and $ d \le 50 $. Find the maximum value of the difference between two of these prime numbers.

We call polynomials $A(x) = a_n x^n +. . .+a_1 x+a_0$ and $B(x) = b_m x^m +. . .+b_1 x+b_0$ ($a_n b_m \neq 0$) similar if the following conditions hold: $(i)$ $n = m$; $(ii)$ There is a permutation $\pi$ of the set $\{ 0, 1, . . . , n\} $ such that $b_i = a_{\pi (i)}$ for each $i \in {0, 1, . . . , n}$. Let $P(x)$ and $Q(x)$ be similar polynomials with integer coefficients. Given that $P(16) = 3^{2012}$, find the smallest possible value of $|Q(3^{2012})|$. [i]Proposed by Milos Milosavljevic[/i]

For positive integers $m, n$ define the function $f_n(m) = 1^{2n} + 2^{2n} + 3^{2n} + \ldots +m^{2n}$. Prove that there are only finitely many pairs of positive integers $(a, b)$ such that $f_n(a) + f_n(b)$ is a prime number. [i]Proposed by Nazar Serdyuk[/i]

Find all functions $f : Z \to Z$ satisfying $\bullet$ $ f(p) > 0$ for all prime numbers $p$, $\bullet$ $p| (f(x) + f(p))^{f(p)}- x$ for all $x \in Z$ and all prime numbers $p$.

Let n be the sum of the digits in a natural number A. The number A it's said to be "surtido" if every number 1,2,3,4....,n can be expressed as a sum of digits in A. a)Prove that, if 1,2,3,4,5,6,7,8 are sums of digits in A, then A is "Surtido" b)If 1,2,3,4,5,6,7 are sums of digits in A, does it follow that A is "Surtido"?

Determine whether there exist an infinite number of positive integers $x,y $ satisfying the condition: $x^2+y \mid x+y^2.$ Please prove it.

Show that there are infinitely many pairs of prime numbers $(p,q)$ such that $p\mid 2^{q-1}-1$ and $q\mid 2^{p-1}-1$.

Steve needed to address a letter to $2743$ Becker Road. He remembered the digits of the address, but he forgot the correct order of the digits, so he wrote them down in random order. The probability that Steve got exactly two of the four digits in their correct positions is $\tfrac m n$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

let p be a prime and a and n be natural numbers such that (p^a -1 )/ (p-1) = 2 ^n find the number of natural divisors of na. :)