Call a positive integer $N \ge 2$ [i]special [/i] if for every k such that $2 \le k \le N, N$ can be expressed as a sum of $k$ positive integers that are relatively prime to $N$ (although not necessarily relatively prime to each other). Find all special positive integers.

$a$ is a $2000$ digit natural number of the form $$a=2(A)99…99(B)(C)$$ expressed in base $10$. $a$ is not a multiple of $10$, and $2(A)+(B)(C)=99$. $a=2899..9971$ is a possible example of $a$. $b$ is a number you earn when you write the digits of $a$ in a reverse order(Writing the digits of some number in a reverse order means like reordering $1234$ into $4321$). Find every positive integer $a$ that makes $ab$ a square number.

Prove that for any given number $a_k, 1 \le k \le 5$, there are $\lambda_k \in \{-1, 0, 1\}, 1 \le k \le 5$, which are not all equal zero, such that $11 | \lambda_1a_1^2+\lambda_2a_2^2+\lambda_3a_3^2+\lambda_4a_4^2+\lambda_5a_5^2$

Prove that a binomial coefficient $\binom nk$ is odd if and only if all digits $1$ of $k$, when $k$ is written in binary, are on the same positions when $n$ is written in binary. [i]I. Dimovski[/i]

Find all pairs of natural numbers $(a,b)$ satisfying the following conditions: [list] [*]$b-1$ is divisible by $a+1$ and [*]$a^2+a+2$ is divisible by $b$. [/list]

Calculates the sum of all numbers that can be formed using each of the odd digits once, that is, the numbers $13579$, $13597$, ..., $97531$.

For any $h = 2^{r}$ ($r$ is a non-negative integer), find all $k \in \mathbb{N}$ which satisfy the following condition: There exists an odd natural number $m > 1$ and $n \in \mathbb{N}$, such that $k \mid m^{h} - 1, m \mid n^{\frac{m^{h}-1}{k}} + 1$.

Find all positive integers $k$, so that there exists a polynomial $f(x)$ with rational coefficients, such that for all sufficiently large $n$, $$f(n)=\text{lcm}(n+1, n+2, \ldots, n+k).$$

Let $m$ be a positive integer such that $m=2\pmod{4}$. Show that there exists at most one factorization $m=ab$ where $a$ and $b$ are positive integers satisfying \[0<a-b<\sqrt{5+4\sqrt{4m+1}}\]

Consider the equation \[ x^{2001}=y^x .\] [list] [*] Find all pairs $(x,y)$ of solutions where $x$ is a prime number and $y$ is a positive integer. [*] Find all pairs $(x,y)$ of solutions where $x$ and $y$ are positive integers.[/list] (Remember that $2001=3 \cdot 23 \cdot 29$.)

Find all functions $f$ from positive integers to themselves, such that the followings hold. $1)$.for each positive integer $n$ we have $f(n)<f(n+1)<f(n)+2020$. $2)$.for each positive integer $n$ we have $S(f(n))=f(S(n))$ where $S(n)$ is the sum of digits of $n$ in base $10$ representation.

Given any positive integer, we can write the integer in base $12$ and add together the digits of its base $12$ representation. We perform this operation on the number $ 7^{6^{5^{4^{3^{2^{1}}}}}}$ repeatedly until a single base $12$ digit remains. Find this digit.

Let $a_1,a_2,a_3,\cdots $ be an infinite sequence of distinct integers. Prove that there are infinitely many primes $p$ that distinct positive integers $i,j,k$ can be found such that $p\mid a_ia_ja_k-1$. [i]Proposed by Mohsen Jamali[/i]

Find the smallest positive integer $G$ such that there exist distinct positive integers $a, b, c$ with the following properties: $\: \bullet \: \gcd(a, b, c) = G$. $\: \bullet \: \text{lcm}(a, b) = \text{lcm}(a, c) = \text{lcm}(b, c)$. $\: \bullet \: \frac{1}{a} + \frac{1}{b}, \frac{1}{a} + \frac{1}{c},$ and $\frac{1}{b} + \frac{1}{c}$ are reciprocals of integers. $\: \bullet \: \gcd(a, b) + \gcd(a, c) + \gcd(b, c) = 16G$.

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.

For any positive integer $n$, let $c(n)$ be the largest divisor of $n$ not greater than $\sqrt{n}$ and let $s(n)$ be the least integer $x$ such that $n < x$ and the product $nx$ is divisible by an integer $y$ where $n < y < x$. Prove that, for every $n$, $s(n) = (c(n) + 1) \cdot \left( \frac{n}{c(n)}+1\right)$

Determine if there is a non-natural natural number $n$ with the property that $\sqrt{n + 1} + \sqrt{n - 1}$ is rational.

[b](a)[/b] Determine if exist an integer $n$ such that $n^2 -k$ has exactly $10$ positive divisors for each $k = 1, 2, 3.$ [b](b) [/b]Show that the number of positive divisors of $n^2 -4$ is not $10$ for any integer $n.$

In a tournament among six teams, every team plays against each other team exactly once. When a team wins, it receives $3$ points and the losing team receives $0$ points. If the game is a draw, the two teams receive $1$ point each. Can the final scores of the six teams be six consecutive numbers $a,a +1,...,a + 5$? If so, determine all values of $a$ for which this is possible.

For given positive integers $r, v, n$ let $S(r, v, n)$ denote the number of $n$-tuples of non-negative integers $(x_1, \cdots, x_n)$ satisfying the equation $x_1 +\cdots+ x_n = r$ and such that $x_i \leq v$ for $i = 1, \cdots , n$. Prove that \[S(r, v, n)=\sum_{k=0}^{m} (-1)^k \binom nk \binom{r - (v + 1)k + n - 1}{n-1}\] Where $m=\left\{n,\left[\frac{r}{v+1}\right]\right\}.$

Find all primes $p \ge 3$ such that $p- \lfloor p/q \rfloor q$ is a square-free integer for any prime $q<p$.

A positive integer $m$ is called self-descriptive in base $b$, where $b\ge2$ is an integer, if i) The representation of $m$ in base $b$ is of the form $(a_0a_1\ldots a_{b-1})_b$ (that is $m=a_0b^{b-1}+a_1b^{b-2}+\ldots+a_{b-2}b+a_{b-1}$, where $0\le a_i\le b-1$ are integers). ii) $a_i$ is equal to the number of occurences of the number $i$ in the sequence $(a_0a_1\ldots a_{b-1})$. For example, $(1210)_4$ is self-descriptive in base $4$, because it has four digits and contains one $0$, two $1$s, one $2$ and no $3$s.

[b]6.1 [/b] The bindery had 92 sheets of white paper and $135$ sheets of colored paper. It took a sheet of white paper to bind each book. and a sheet of colored paper. After binding several books of white Paper turned out to be half as much as the colored one. How many books were bound? [b]6.2[/b] Prove that if you multiply all the integers from $1$ to $1965$, you get the number, the last whose non-zero digit is even. [b]6.3[/b] The front tires of a car wear out after $25,000$ kilometers, and the rear tires after $15,000$ kilometers of travel. When should you swap tires so that they wear out at the same time? [b]6.4[/b] A rectangle $19$ cm $\times 65$ cm is divided by straight lines parallel to its sides into squares with side 1 cm. How many parts will this rectangle be divided into if you also draw a diagonal in it? [b]6.5[/b] Find the dividend, divisor and quotient in the example: [center][img]https://cdn.artofproblemsolving.com/attachments/2/e/de053e7e11e712305a89d3b9e78ac0901dc775.png[/img] [/center] [b]6.6[/b] Odd numbers from $1$ to $49$ are written out in table form $$\,\,\,1\,\,\,\,\,\, 3\,\,\,\,\,\, 5\,\,\,\,\,\, 7\,\,\,\,\,\, 9$$ $$11\,\,\, 13\,\,\, 15\,\,\, 17\,\,\, 19$$ $$21\,\,\, 23\,\,\, 25\,\,\, 27\,\,\, 29$$ $$31\,\,\, 33\,\,\, 35\,\,\, 37\,\,\, 39$$ $$41\,\,\, 43\,\,\, 45\,\,\, 47\,\,\, 49$$ $5$ numbers are selected, any two of which are not on the same line or in one column. What is their sum? PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988081_1965_leningrad_math_olympiad]here[/url].

Call a positive integer $n$ quixotic if the value of \[\operatorname{lcm}(1,2,...,n)\cdot\left(\frac11+\frac12+\frac13+\dots+\frac1n\right)\]is divisible by 45. Compute the tenth smallest quixotic integer.

Let $n$ be a natural number with $120$ positive divisors (including $1$ and $n$). For each divisor $d$ of $n$, let $q$ be the quotient and $r$ the remainder when dividing $4n - 3$ by $d$. Let $Q$ be the sum of all the quotients $q$, and $R$ the sum of all the remainders $r$ for the $120$ divisions of $4n - 3$ by $d$. Determine all posible values of $Q - 4R$