Find all natural numbers $n$, such that $3$ divides the number $n\cdot 2^n+1$.

For any positive integer $n$ , Prove that there is not exist three odd integer $x,y,z$ satisfing the equation $(x+y)^n+(y+z)^n=(x+z)^n$.

Determine all positive integers $n{}$ which can be expressed as $d_1+d_2+d_3$ where $d_1,d_2,d_3$ are distinct positive divisors of $n{}$.

Prove that for any integer $n>1$ there are distinct integers $a,b,c$ between $n^2$ and $(n+1)^2$ such that $c$ divides $a^2+b^2$.

Find all non-negative integers $ x,y,z$ such that $ 5^x \plus{} 7^y \equal{} 2^z$. :lol: ([i]Daniel Kohen, University of Buenos Aires - Buenos Aires,Argentina[/i])

For positive integers $a,n$, define $F_n(a)=q+r$, where $a=qn+r$ ($q,r$ are nonnegative integers, $0\leq q<n$). Find the largest integer $A$, there are positive integers $n_1,n_2,n_3,n_4,n_5,n_6$, for all positive integer $a\leq A$, $F_{n_6}(F_{n_5}(F_{n_4}(F_{n_3}(F_{n_2}(F_{n_1}(a))))))=1$.

Five distinct positive integers form an arithmetic progression. Can their product be equal to $a^{2008}$ for some positive integer $a$ ?

Let $\mathbb N$ denote set of all natural numbers and let $f:\mathbb{N}\to\mathbb{N}$ be a function such that $\text{(a)} f(mn)=f(m).f(n)$ for all $m,n \in\mathbb{N}$; $\text{(b)} m+n$ divides $f(m)+f(n)$ for all $m,n\in \mathbb N$. Prove that, there exists an odd natural number $k$ such that $f(n)= n^k$ for all $n$ in $\mathbb{N}$.

Find all pairs of $a$, $b$ of positive integers satisfying the equation $2a^2 = 3b^3$.

[b]p1.[/b] Find all integer solutions of the equation $a^2 - b^2 = 2002$. [b]p2.[/b] Prove that the disks drawn on the sides of a convex quadrilateral as on diameters cover this quadrilateral. [b]p3.[/b] $30$ students from one school came to Mathematical Olympiad. In how many different ways is it possible to place them in four rooms? [b]p4.[/b] A $12$ liter container is filled with gasoline. How to split it in two equal parts using two empty $5$ and $8$ liter containers? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a$ and $b$ be distinct integers greater than $1$. Prove that there exists a positive integer $n$ such that $(a^n-1)(b^n-1)$ is not a perfect square. [i]Proposed by Mongolia[/i]

Show that among any 39 consecutive natural numbers, there is a number whose sum of the digits is devisible by 11.

Given $2020*2020$ chessboard, what is the maximum number of warriors you can put on its cells such that no two warriors attack each other. Warrior is a special chess piece which can move either $3$ steps forward and one step sideward and $2$ step forward and $2$ step sideward in any direction.

Determine all positive integer $a$ such that the equation $2x^2 - 30x + a = 0$ has two prime roots, i.e. both roots are prime numbers.

Find all positive integers $n < 589$ for which $589$ divides $n^2 + n + 1$.

Let $n \in \mathbb N$. Prove that for each factor $m \ge n$ of $n(n + 1)/2$, one can partition the set $\{1,2, 3,\cdots , n\}$ into disjoint subsets such that the sum of elements in each subset is equal to $m$.

[b]p1.[/b] The Evergreen School booked buses for a field trip. Altogether, $138$ people went to West Lake, while $115$ people went to East Lake. The buses all had the same number of seats, and every bus has more than one seat. All seats were occupied and everybody had a seat. How many seats were there in each bus? [b]p2.[/b] In New Scotland there are three kinds of coins: $1$ cent, $6$ cent, and $36$ cent coins. Josh has $50$ of the $36$-cent coins (and no other coins). He is allowed to exchange a $36$ cent coin for $6$ coins of $6$ cents, and to exchange a 6 cent coin for $6$ coins of $1$ cent. Is it possible that after several exchanges Josh will have $150$ coins? [b]p3.[/b] Pinocchio multiplied two $2$ digit numbers. But witch Masha erased some of the digits. The erased digits are the ones marked with a $*$. Could you help Pinocchio to restore all the erased digits? $\begin{tabular}{ccccc} & & & 9 & 5 \\ x & & & * & * \\ \hline & & & * & * \\ + & 1 & * & * & \\ \hline & * & * & * & * \\ \end{tabular}$ Find all solutions. [b]p4.[/b] There are $50$ senators and $435$ members of House of Representatives. On Friday all of them voted a very important issue. Each senator and each representative was required to vote either "yes" or "no". The announced results showed that the number of "yes" votes was greater than the number of "no" votes by $24$. Prove that there was an error in counting the votes. [b]p5.[/b] Was there a year in the last millennium (from $1000$ to $2000$) such that the sum of the digits of that year is equal to the product of the digits? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $m, n,$ and $k$ be natural numbers, where $n$ is odd. Prove that $\frac{1}{m}+\frac{1}{m+n}+...+\frac{1}{m+kn}$ is not a natural number.

Determine all positive integers $n$ such that the decimal representation of the number $6^n + 1$ has all its digits the same.

Suppose $a$, $b$, $c$, and $d$ are distinct positive integers such that $a^b$ divides $b^c$, $b^c$ divides $c^d$, and $c^d$ divides $d^a$. [list](a) Is it possible to determine which of the numbers $a$, $b$, $c$, $d$ is the smallest? (b) Is it possible to determine which of the numbers $a$, $b$, $c$, $d$ is the largest?[/list]

A jar contains one white marble, two blue marbles, three red marbles, and four green marbles. If you select two of these marbles without replacement, the probability that both marbles will be the same color is $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n.$

Find all functions $f : \mathbb{Z} \to \mathbb{Z}$ that satisfy the conditions: $i) f(f(x)) = xf(x) - x^2 + 2,\forall x\in\mathbb{Z}$ $ii) f$ takes all integer values

a) Prove that there exists a sequence of digits $\{c_n\}_{n\geq 1}$ such that or each $n\geq 1$ no matter how we interlace $k_n$ digits, $1\leq k_n\leq 9$, between $c_n$ and $c_{n+1}$, the infinite sequence thus obtained does not represent the fractional part of a rational number. b) Prove that for $1\leq k_n\leq 10$ there is no such sequence $\{c_n\}_{n\geq 1}$. [i]Dan Schwartz[/i]

We say that a positive integer $k$ is [i]fair [/i] if the number of $2021$-digit palindromes that are a multiple of $k$ is the same as the number of $2022$-digit palindromes that are a multiple of $k$. Does the set $M = \{1, 2,..,35\}$ contain more numbers that are fair or those that are not fair? (A palindrome is an integer that reads the same forward and backward.) [i](David Hruska)[/i]

[b]1A.[/b] The iTest, by virtue of being the first national internet-based high school math competition, saves a lot of paper every year. The quantity of trees saved (“$a$”) is determined by the following formula: $a = x^2 + 3x + 9$, where $x$ is the number of participating students in the competition. If $x$ is the correct answer from short answer [hide=problem 22]x=20[/hide], then find $a$. [i](1 point)[/i] [b]1B.[/b] Let $q$ be the sum of the digits of $a$. If $q = b! - (b-1)! + (b-2)! - (b-3)!$, find $b$. [i](2 points)[/i] [b]1C.[/b] Find the number of the following statements that are false: [i] (4 points)[/i] 1. $q$ is the first prime number resulting from the sum of cubes of distinct fractions, where both the numerator and denominator are primes. 2. $q$ is composite. 3. $q$ is composite and is the sum of the first four prime numbers and $1$. 4. $q$ is the smallest prime equal to the difference of cubes of two consecutive primes. 5. $q$ is not the smallest prime equal to the product of twin primes plus their arithmetic mean. 6. The sum of $q$ consecutive Fibonacci numbers, starting from the $q^{th}$ Fibonacci number, is prime. 7. $q$ is the largest prime factor of $1bbb$. 8. $q$ is the $8^{th}$ largest prime number. 9. $a$ is composite. 10. $a + q + b = q^2$. 11. The decimal expansion of $q^q$ begins with $q$. 12. $q$ is the smallest prime equal to the sum of three distinct primes. 13. $q^5 + q^2 + q^1 + q^3 + q^5 + q^6 + q^4 + q^0 = 52135640$. 14. $q$ is not the smallest prime such that $q$ and $q^2$ have the same sum of their digits. 15. $q$ is the smallest prime such that $q$ = (the product of its digits + the sum of its digits). [hide=ANSWER KEY]1A. 469 1B. 4 1C. 6[/hide]