For some positive integer $n>m$, it turns out that it is representable as sum of $2021$ non-negative integer powers of $m$, and that it is representable as sum of $2021$ non-negative integer powers of $m+1$. Find the maximal value of the positive integer $m$.

Let $v(n)$ be the order of $2$ in $n!$. Prove that for any positive integers $a$ and $m$ there exists $n$ ($n>1$) such that $v(n) \equiv a (\mod m)$. I have a book with Mongolian problems from this year, and this problem appeared in it. Perhaps I am terribly misinterpreting this problem, but it seems like it is wrong. Any ideas?

Let $a > 3$ be an odd integer. Show that for every positive integer $n$ the number $a^{2^n}- 1$ has at least $n + 1$ distinct prime divisors.

Let $H = \{ \lfloor i\sqrt{2}\rfloor : i \in \mathbb Z_{>0}\} = \{1,2,4,5,7,\dots \}$ and let $n$ be a positive integer. Prove that there exists a constant $C$ such that, if $A\subseteq \{1,2,\dots, n\}$ satisfies $|A| \ge C\sqrt{n}$, then there exist $a,b\in A$ such that $a-b\in H$. (Here $\mathbb Z_{>0}$ is the set of positive integers, and $\lfloor z\rfloor$ denotes the greatest integer less than or equal to $z$.)

For a given positive integer $n$ one has to choose positive integers $a_0, a_1,...$ so that the following conditions hold: (1) $a_i = a_{i+n}$ for any $i$, (2) $a_i$ is not divisible by $n$ for any $i$, (3) $a_{i+a_i}$ is divisible by $a_i$ for any $i$. For which positive integers $n > 1$ is this possible only if the numbers $a_0, a_1, ...$ are all equal?

Suppose that $m$ and $n$ are integers, such that both the quadratic equations $x^2+mx-n=0$ and $x^2-mx+n=0$ have integer roots. Prove that $n$ is divisible by $6$.

You have two blackboards $A$ and $B$. You have to write on them some of the integers greater than or equal to $2$ and less than or equal to $20$ in such a way that each number on blackboard $A$ is co-prime with each number on blackboard $B.$ Determine the maximum possible value of multiplying the number of numbers written in $A$ by the number of numbers written in $B$.

Find all functions $f : \mathbb{Z}\rightarrow \mathbb{Z}$ such that for all prime $p$ the following condition holds: $$p \mid ab + bc + ca \iff p \mid f(a)f(b) + f(b)f(c) + f(c)f(a)$$ [i]Proposed by Anzo Teh Zhao Yang[/i]

Find the sum of all prime numbers $p$ which satisfy \[p = a^4 + b^4 + c^4 - 3\] for some primes (not necessarily distinct) $a$, $b$ and $c$.

For all $n>1$, let $f(n)$ be the biggest divisor of $n$ except itself. Does there exists a positive integer $k$ such that the equality $n-f(n)=k$ has exactly $2023$ solutions?

An increasing arithmetic progression consists of one hundred positive integers. Is it possible that every two of them are relatively prime?

Define the sequence $(a_n)$ as $a_1 = 1$, $a_{2n} = a_n$ and $a_{2n+1} = a_n + 1$ for all $n\geq 1$. a) Find all positive integers $n$ such that $a_{kn} = a_n$ for all integers $1 \leq k \leq n$. b) Prove that there exist infinitely many positive integers $m$ such that $a_{km} \geq a_m$ for all positive integers $k$.

Let $ k \in \mathbb{N}$. A polynomial is called [i]$ k$-valid[/i] if all its coefficients are integers between 0 and $ k$ inclusively. (Here we don't consider 0 to be a natural number.) [b]a.)[/b] For $ n \in \mathbb{N}$ let $ a_n$ be the number of 5-valid polynomials $ p$ which satisfy $ p(3) = n.$ Prove that each natural number occurs in the sequence $ (a_n)_n$ at least once but only finitely often. [b]b.)[/b] For $ n \in \mathbb{N}$ let $ a_n$ be the number of 4-valid polynomials $ p$ which satisfy $ p(3) = n.$ Prove that each natural number occurs infinitely often in the sequence $ (a_n)_n$ .

A positive integer $n$ has exactly $12$ positive divisors $1 = d_1 < d_2 < d_3 < ... < d_{12} = n$. Let $m = d_4 - 1$. We have $d_m = (d_1 + d_2 + d_4) d_8$. Find $n$.

Show that there are infinitely many positive integers $n$ such that $n$ has at least two prime divisors and $20^n + 16^n$ is divisible by $n^2$.

Prove that a natural number can be written as a sum of two or more consecutive positive integers if and only if that number is not a power of two.

Solve the equation $4xy-x-y=z^2$ in positive integers.

Let $S_n$ be the sum of the first $n$ prime numbers. For example, \[ S_5 = 2 + 3 + 5 + 7 + 11 = 28.\] Does there exist an integer $k$ such that $S_{2023} < k^2 < S_{2024}$?

Provided the equation $xyz = p^n(x + y + z)$ where $p \geq 3$ is a prime and $n \in \mathbb{N}$. Prove that the equation has at least $3n + 3$ different solutions $(x,y,z)$ with natural numbers $x,y,z$ and $x < y < z$. Prove the same for $p > 3$ being an odd integer.

Positive integers $a_1, a_2, \dots, a_{2023}$ satisfy the following conditions. [list] [*] $a_1 = 5, a_2 = 25$ [*] $a_{n + 2} = 7a_{n+1}-a_n-6$ for each $n = 1, 2, \dots, 2021$ [/list] Prove that there exist integers $x, y$ such that $a_{2023} = x^2 + y^2.$

If we divide number $1^{1990}+2^{1990}+3^{1990}+...+1990^{1990}$ with $10$, what remainder will we find?

Suppose that $p,q$ are prime numbers such that $\sqrt{p^2 +7pq+q^2}+\sqrt{p^2 +14pq+q^2}$ is an integer. Show that $p = q$.

[b]p1.[/b] Four positive numbers are placed at the vertices of a rectangle. Each number is at least as large as the average of the two numbers at the adjacent vertices. Prove that all four numbers are equal. [b]p2.[/b] The sum $498+499+500+501=1998$ is one way of expressing $1998$ as a sum of consecutive positive integers. Find all ways of expressing $1998$ as a sum of two or more consecutive positive integers. Prove your list is complete. [b]p3.[/b] An infinite strip (two parallel lines and the region between them) has a width of $1$ inch. What is the largest value of $A$ such that every triangle with area $A$ square inches can be placed on this strip? Justify your answer. [b]p4.[/b] A plane divides space into two regions. Two planes that intersect in a line divide space into four regions. Now suppose that twelve planes are given in space so that a) every two of them intersect in a line, b) every three of them intersect in a point, and c) no four of them have a common point. Into how many regions is space divided? Justify your answer. [b]p5.[/b] Five robbers have stolen $1998$ identical gold coins. They agree to the following: The youngest robber proposes a division of the loot. All robbers, including the proposer, vote on the proposal. If at least half the robbers vote yes, then that proposal is accepted. If not, the proposer is sent away with no loot and the next youngest robber makes a new proposal to be voted on by the four remaining robbers, with the same rules as above. This continues until a proposed division is accepted by at least half the remaining robbers. Each robber guards his best interests: He will vote for a proposal if and only if it will give him more coins than he will acquire by rejecting it, and the proposer will keep as many coins for himself as he can. How will the coins be distributed? Explain your reasoning. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that there are no $1999$ primes in an arithmetic progression that are all less than $12345$.

Define the sequence $\{a_n\}$ in the following manner: $a_1=1$ $a_2=3$ $a_{n+2}=2a_{n+1}a_{n}+1$ ; for all $n\geq1$ Prove that the largest power of $2$ that divides $a_{4006}-a_{4005}$ is $2^{2003}.$