A positive integer with three digits is written on the board. Each second the number $n$ on the board gets replaced by $n+\frac{n}{p}$, where $p$ is the largest prime divisor of $n$. Prove that either after 999 seconds or 1000 second the number on the board will be a power of two. [i]A. Voidelevich[/i]

Find all pairs of natural numbers $(p,n)$ with $p$ prime such that $p^6+p^5+n^3+n=n^5+n^2$

Find all integers $n>1$ such that any prime divisor of $n^6-1$ is a divisor of $(n^3-1)(n^2-1)$.

Determine, with proof, the smallest positive integer $n$ with the following property: For every choice of $n$ integers, there exist at least two whose sum or difference is divisible by $2009$.

Given a fixed integer $k>0,r=k+0.5$,define $f^1(r)=f(r)=r[r],f^l(r)=f(f^{l-1}(r))(l>1)$ where $[x]$ denotes the smallest integer not less than $x$. prove that there exists integer $m$ such that $f^m(r)$ is an integer.

Several positive integers are written on a blackboard. The sum of any two of them is some power of two (for example, $2, 4, 8,...$). What is the maximal possible number of different integers on the blackboard?

Let $n > 1$ be a fixed integer. Alberto and Barbara play the following game: (i) Alberto chooses a positive integer, (ii) Barbara chooses an integer greater than $1$ which is a multiple or submultiple of the number Alberto chose (including itself), (iii) Alberto increases or decreases the Barbara’s number by $1$. Steps (ii) and (iii) are alternatively repeated. Barbara wins if she succeeds to reach the number $n$ in at most $50$ moves. For which values of $n$ can she win, no matter how Alberto plays?

Given six consecutive positive integers, prove that there exists a prime such that one and only one of these six integers is divisible by this prime.

For every positive integer $x$, let $k(x)$ denote the number of composite numbers that do not exceed $x$. Find all positive integers $n$ for which $(k (n))! $ lcm $(1, 2,..., n)> (n - 1) !$ .

Given are positive integers $r$ and $k$ and an infinite sequence of positive integers $a_1 \le a_2 \le ...$ such that $\frac{r}{a_r}= k + 1$. Prove that there is a $t$ satisfying $\frac{t}{a_t}=k$.

Given two natural numbers $ n\ge 2,a, $ prove that there exists another natural number $ v\ge 2 $ such that: $$ \frac{v+\sqrt{v^2-4}}{2} =\left( \frac{n+\sqrt{n^2-4}}{2} \right)^a $$

Let $p, q, r$ be prime numbers and $t, n$ be natural numbers such that $p^2 +qt =(p + t)^n$ and $p^2 + qr = t^4$ . a) Show that $n < 3$. b) Determine all the numbers $p, q, r, t, n$ that satisfy the given conditions.

Find all integer solutions of \[ x^{4}\plus{}y^{2}\equal{}z^{4}\]

Find all non-negative integers $m,n,p,q$ such that \[ p^mq^n = (p+q)^2 +1 . \]

Let $a, b \ge 2$ be positive integers with $gcd (a, b) = 1$. Let $r$ be the smallest positive value that $\frac{a}{b}- \frac{c}{d}$ can take, where $c$ and $d$ are positive integers satisfying $c \le a$ and $d \le b$. Prove that $\frac{1}{r}$ is an integer.

Determine all functions $f$ defined on the set of all positive integers and taking non-negative integer values, satisfying the three conditions: [list] [*] $(i)$ $f(n) \neq 0$ for at least one $n$; [*] $(ii)$ $f(x y)=f(x)+f(y)$ for every positive integers $x$ and $y$; [*] $(iii)$ there are infinitely many positive integers $n$ such that $f(k)=f(n-k)$ for all $k<n$. [/list]

Determine all positive integers $n$ such that $4k^2 +n$ is a prime number for all non-negative integer $k$ smaller than $n$.

Given an arbitrary natural number $ n, $ is there a multiple of $ n $ whose base $ 10 $ representation can be written only with the digits $ 0,2,7? $ Explain.

Let $S$ denote the set of words $W = w_1w_2\ldots w_n$ of any length $n\ge0$ (including the empty string $\lambda$), with each letter $w_i$ from the set $\{x,y,z\}$. Call two words $U,V$ [i]similar[/i] if we can insert a string $s\in\{xyz,yzx,zxy\}$ of three consecutive letters somewhere in $U$ (possibly at one of the ends) to obtain $V$ or somewhere in $V$ (again, possibly at one of the ends) to obtain $U$, and say a word $W$ is [i]trivial[/i] if for some nonnegative integer $m$, there exists a sequence $W_0,W_1,\ldots,W_m$ such that $W_0=\lambda$ is the empty string, $W_m=W$, and $W_i,W_{i+1}$ are similar for $i=0,1,\ldots,m-1$. Given that for two relatively prime positive integers $p,q$ we have \[\frac{p}{q} = \sum_{n\ge0} f(n)\left(\frac{225}{8192}\right)^n,\]where $f(n)$ denotes the number of trivial words in $S$ of length $3n$ (in particular, $f(0)=1$), find $p+q$. [i]Victor Wang[/i]

Let $a,b$, and $c$ be odd positive integers such that $a$ is not a perfect square and $$a^2+a+1 = 3(b^2+b+1)(c^2+c+1).$$ Prove that at least one of the numbers $b^2+b+1$ and $c^2+c+1$ is composite.

Let $A, B$, and $C$ be three points on the edge of a circular chord such that $B$ is due west of $C$ and $ABC$ is an equilateral triangle whose side is $86$ meters long. A boy swam from $A$ directly toward $B$. After covering a distance of $x$ meters, he turned and swam westward, reaching the shore after covering a distance of $y$ meters. If $x$ and $y$ are both positive integers, determine $y.$

For a prime $q$, let $\Phi_q(x)=x^{q-1}+x^{q-2}+\cdots+x+1$. Find the sum of all primes $p$ such that $3 \le p \le 100$ and there exists an odd prime $q$ and a positive integer $N$ satisfying \[\dbinom{N}{\Phi_q(p)}\equiv \dbinom{2\Phi_q(p)}{N} \not \equiv 0 \pmod p. \][i]Proposed by Sammy Luo[/i]

[b]p1.[/b] A triangle $ABC$ is drawn in the plane. A point $D$ is chosen inside the triangle. Show that the sum of distances $AD+BD+CD$ is less than the perimeter of the triangle. [b]p2.[/b] In a triangle $ABC$ the bisector of the angle $C$ intersects the side $AB$ at $M$, and the bisector of the angle $A$ intersects $CM$ at the point $T$. Suppose that the segments $CM$ and $AT$ divided the triangle $ABC$ into three isosceles triangles. Find the angles of the triangle $ABC$. [b]p3.[/b] You are given $100$ weights of masses $1, 2, 3,..., 99, 100$. Can one distribute them into $10$ piles having the following property: the heavier the pile, the fewer weights it contains? [b]p4.[/b] Each cell of a $10\times 10$ table contains a number. In each line the greatest number (or one of the largest, if more than one) is underscored, and in each column the smallest (or one of the smallest) is also underscored. It turned out that all of the underscored numbers are underscored exactly twice. Prove that all numbers stored in the table are equal to each other. [b]p5.[/b] Two stores have warehouses in which wheat is stored. There are $16$ more tons of wheat in the first warehouse than in the second. Every night exactly at midnight the owner of each store steals from his rival, taking a quarter of the wheat in his rival's warehouse and dragging it to his own. After $10$ days, the thieves are caught. Which warehouse has more wheat at this point and by how much? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find the value of $n$ such that the two inequalities $$|x + 47| \le n \,\,\, and \,\,\, \frac{1}{17} \le \frac{4}{3 - x} \le \frac{1}{8}$$ have the same solutions.

Let $ n\ge 2 $ be a natural number and $ A $ be a subset of $ \{1,2,\ldots ,n\} $ having the property that $ x+y $ belongs to $ A $ for any choosing of $ x,y $ such that $ x+y\le n. $ Prove that the arithmetic mean of the elements of $ A $ is at least $ \frac{n+1}{2} . $