A positive integer is called [i]saturated [/i]i f any prime factor occurs at a power greater than or equal to $2$ in its factorisation. For example, numbers $8 = 2^3$ and $9 = 3^2$ are saturated, moreover, they are consecutive. Prove that there exist infinitely many saturated consecutive numbers.

Is it possible to fill the cells of a table of size $2019\times2019$ with pairwise distinct positive integers in such a way that in each rectangle of size $1\times2$ or $2\times1$ the larger number is divisible by the smaller one, and the ratio of the largest number in the table to the smallest one is at most $2019?$

In how many ways you can pay $2015\$$ using bills of $1\$$, $10\$$, $100\$$ and $200\$$

Prove that the equation \[ x^n + 1 = y^{n+1}, \] where $n$ is a positive integer not smaller then 2, has no positive integer solutions in $x$ and $y$ for which $x$ and $n+1$ are relatively prime.

A positive integer is called [i]digit-reduced[/i] if at most nine different digits occur in its decimal representation (leading $0$s are omitted.) Let $M$ be a finite set of [i]digit-reduced[/i] numbers. Show that the sum of the reciprocals of the elements in $M$ is less than $180$.

Show that: 1) If $2n-1$ is a prime number, then for any $n$ pairwise distinct positive integers $a_1, a_2, \ldots , a_n$, there exists $i, j \in \{1, 2, \ldots , n\}$ such that \[\frac{a_i+a_j}{(a_i,a_j)} \geq 2n-1\] 2) If $2n-1$ is a composite number, then there exists $n$ pairwise distinct positive integers $a_1, a_2, \ldots , a_n$, such that for any $i, j \in \{1, 2, \ldots , n\}$ we have \[\frac{a_i+a_j}{(a_i,a_j)} < 2n-1\] Here $(x,y)$ denotes the greatest common divisor of $x,y$.

Does there exist a positive odd integer $n$ so that there are primes $p_1$, $p_2$ dividing $2^n-1$ with $p_1-p_2=2$?

Let $n$ be a positive integer, the players A and B play the following game: we have $n$ balls with the numbers of $1, 2, 3, 4,...., n$ this balls will be in two boxes with the symbols $\prod$ and $\sum$. In your turn, the player can choose one ball and the player will put this ball in some box, in the final all the balls of the box $\prod$ are multiplied and we will get a number $P$, after this all the balls of the box $\sum$ are added up and we will get a number $Q$(if the box $\prod$ is empty $P = 1$, if the box $\sum$ is empty $Q = 0$). The player(s) play alternately, player A starts, if $P + Q$ is even player A wins, otherwise player B wins. a)If $n= 6$, which player has the winning strategy??? b)If $n = 2012$, which player has the winning strategy???

Let $a_1,a_2,a_3,\ldots$ be a sequence of integers, with the property that every consecutive group of $a_i$'s averages to a perfect square. More precisely, for every positive integers $n$ and $k$, the quantity \[\frac{a_n+a_{n+1}+\cdots+a_{n+k-1}}{k}\] is always the square of an integer. Prove that the sequence must be constant (all $a_i$ are equal to the same perfect square). [i]Evan O'Dorney and Victor Wang[/i]

Prove that $m^7- m$ is divisible by $42$ for any positive integer $m$.

Harold, Tanya, and Ulysses paint a very long picket fence. Harold starts with the first picket and paints every $h$th picket; Tanya starts with the second picket and paints everth $t$th picket; and Ulysses starts with the third picket and paints every $u$th picket. Call the positive integer $100h+10t+u$ $\textit{paintable}$ when the triple $(h,t,u)$ of positive integers results in every picket being painted exaclty once. Find the sum of all the paintable integers.

Determine all finite nonempty sets $S$ of positive integers satisfying \[ {i+j\over (i,j)}\qquad\mbox{is an element of S for all i,j in S}, \] where $(i,j)$ is the greatest common divisor of $i$ and $j$.

What is the largest positive integer $n < 1000$ for which there is a positive integer $m$ satisfying \[\text{lcm}(m,n) = 3m \times \gcd(m,n)?\]

An ordered pair $(x, y)$ of integers is a primitive point if the greatest common divisor of $x$ and $y$ is $1$. Given a finite set $S$ of primitive points, prove that there exist a positive integer $n$ and integers $a_0, a_1, \ldots , a_n$ such that, for each $(x, y)$ in $S$, we have: $$a_0x^n + a_1x^{n-1} y + a_2x^{n-2}y^2 + \cdots + a_{n-1}xy^{n-1} + a_ny^n = 1.$$ [i]Proposed by John Berman, United States[/i]

Does there exist a sequence of natural numbers $a_1,a_2,\ldots$ such that the number $a_i+a_j$ has an even number of different prime divisors for any two different natural indices $i{}$ and $j{}$? [i]From the folklore[/i]

There´s a ping pong tournament with $n\geq 3$ participants that we´ll call $1, 2, \dots n$. The tournament rules are the following ones: at the start, all the players form a line, ordered from $1$ to $n$. Players $1$ and $2$ play the first match. The winner is at the beginning of the line and the loser is placed behind the last person in the line.In the next play, the two who at that moment are the first two in line face each other, the winner is first in line and the loser goes to the end of the line, just behind the last loser. And so on. After $N$ matches, the tournament ends.Player number $1$ won $a_1$ matches, player number $2$ won $a_2$, and so on till player $n$, that has won $a_n$ matches (it is trivial that $a_1+a_2+\dots+a_n=N)$.Determine how many games each player has lost, based on $a_1, a_2, \dots , a_n$

Determine whether there exists an infinite sequence of nonzero digits $a_1 , a_2 , a_3 , \cdots $ and a positive integer $N$ such that for every integer $k > N$, the number $\overline{a_k a_{k-1}\cdots a_1 }$ is a perfect square.

The sequence $(a_n)_{n\in\mathbb{N}}$ is defined by $a_1=3$ and $$a_n=a_1a_2\cdots a_{n-1}-1$$ Show that there exist infinitely many prime number that divide at least one number in this sequences

Find all pairs of nonnegative integers $(x, y)$ for which $(xy + 2)^2 = x^2 + y^2 $.

The sequence of natural numbers is based on the following rule: each term, starting with the second, is obtained from the previous addition works of all its various simple divisors (for example, after the number $12$ should be the number $18$, and after the number $125$ , the number $130$). Prove that any two sequences constructed in this way have a common member.

Does there exist a set $A\subseteq\mathbb{N}^*$ such that for any positive integer $n$, $A\cap\{n,2n,3n,...,15n\}$ contains exactly one element and there exists infinitely many positive integer $m$ such that $\{m,m+2018\}\subset A$? Please prove your conclusion.

Call an ordered triple $(a, b, c)$ of integers feral if $b -a, c - a$ and $c - b$ are all prime. Find the number of feral triples where $1 \le a < b < c \le 20$.

A positive integer will be called [i]typical[/i] if the sum of its decimal digits is a multiple of $2011$. a) Show that there are infinitely many [i]typical[/i] numbers, each having at least $2011$ multiples which are also typical numbers. b) Does there exist a positive integer such that each of its multiples is typical?

[b]p1.[/b] Is there an integer such that the product of all whose digits equals $99$ ? [b]p2.[/b] An elevator in a $100$ store building has only two buttons: UP and DOWN. The UP button makes the elevator go $13$ floors up, and the DOWN button makes it go $8$ floors down. Is it possible to go from the $13$th floor to the $8$th floor? [b]p3.[/b] Cut the triangle shown in the picture into three pieces and rearrange them into a rectangle. (Pieces can not overlap.) [img]https://cdn.artofproblemsolving.com/attachments/9/f/359d3b987012de1f3318c3f06710daabe66f28.png[/img] [b]p4.[/b] Two players Tom and Sid play the following game. There are two piles of rocks, $5$ rocks in the first pile and $6$ rocks in the second pile. Each of the players in his turn can take either any amount of rocks from one pile or the same amount of rocks from both piles. The winner is the player who takes the last rock. Who does win in this game if Tom starts the game? [b]p5.[/b] In the next long multiplication example each letter encodes its own digit. Find these digits. $\begin{tabular}{ccccc} & & & a & b \\ * & & & c & d \\ \hline & & c & e & f \\ + & & a & b & \\ \hline & c & f & d & f \\ \end{tabular}$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine all positive integers $ n$, for which $ 2^{n\minus{}1}n\plus{}1$ is a perfect square.