Consider the equation $ y^2\minus{}k\equal{}x^3$, where $ k$ is an integer. Prove that the equation cannot have five integer solutions of the form $ (x_1,y_1),(x_2,y_1\minus{}1),(x_3,y_1\minus{}2),(x_4,y_1\minus{}3),(x_5,y_1\minus{}4)$. Also show that if it has the first four of these pairs as solutions, then $ 63|k\minus{}17$.

Let $ a\ge 2 $ be a natural number. Show that the following relations are equivalent: $ \text{(i)} \ a $ is the hypothenuse of a right triangle whose sides are natural numbers. $ \text{(ii)}\quad $ there exists a natural number $ d $ for which the polynoms $ X^2-aX\pm d $ have integer roots.

In a sequence of numbers, a term is called [i]golden [/i] if it is divisible by the term immediately before it. What is the maximum possible number of golden terms in a permutation of $1, 2, 3, . . . , 2021$?

Let $x, y$ be positive integers such that $$ x^4=(x-1)\left(y^3-23\right)-1 . $$ Find the maximum possible value of $x+y$.

Let $n$ be a natural number. We have $n$ colors. Each of the numbers $1, 2, 3,... , 1000$ was colored with one of the $n$ colors. It is known that, for any two distinct numbers, if one divides the other then these two numbers have different colors. Determine the smallest possible value of $n$.

[b]p1.[/b] Prove that no matter what digits are placed in the four empty boxes, the eight-digit number $9999\Box\Box\Box\Box$ is not a perfect square. [b]p2.[/b] Prove that the number $m/3+m^2/2+m^3/6$ is integral for all integral values of $m$. [b]p3.[/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]p4.[/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/4/b/ca707bf274ed54c1b22c4f65d3d0b0a5cfdc56.png[/img] [b]p5.[/b] Two players Tom and Sid play the following game. There are two piles of rocks, $7$ rocks in the first pile and $9$ 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]p6.[/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].

Anne multiplies each two-digit number by $588$ in turn, and writes down the so-obtained products. How many perfect squares does she write down?

9.7 Is there an infinite arithmetic sequence $\{a_n\}\subset \mathbb N$ s.t. $a_n+...+a_{n+9}\mid a_n...a_{n+9}$ for all $n$? ([i]V. Senderov[/i])

Find the least positive integer which is a multiple of $13$ and all its digits are the same. [i](Adapted from Gazeta Matematică 1/1982, Florin Nicolăită)[/i]

Let $\mathbb{Q^+}$ denote the set of positive rational numbers. Determine all functions $f: \mathbb{Q^+} \to \mathbb{Q^+}$ that satisfy the conditions \[ f \left( \frac{x}{x+1}\right) = \frac{f(x)}{x+1} \qquad \text{and} \qquad f \left(\frac{1}{x}\right)=\frac{f(x)}{x^3}\] for all $x \in \mathbb{Q^+}.$

Let $a$ and $k$ be positive integers. Prove that for every positive integer $d$ there exists a positive integer $n$ such that $d$ divides $ka^n + n.$

Prove that there exist infinitely many positive integers $ n$ such that $ n!$ is not divisible by $ n^2\plus{}1$.

Determine all positive integers $n$ for which there are positive real numbers $x,y$ and $z$ such that $\sqrt x +\sqrt y +\sqrt z=1$ and $\sqrt{x+n} +\sqrt{y+n} +\sqrt{z+n}$ is an integer.

Prove that, for each odd integer $n \ge 5$, the number $1^n+2^n+...+15^n$ is divisible by $480$.

Tanya wrote numbers in forms $n^7-1$ for $n=2,3,...$ and noticed that for $n=8$ she got number divisible by $337$. For what minimal $n$ did she get number divisible by $2022$?

The smallest number greater than 2 that leaves a remainder of 2 when divided by 3, 4, 5, or 6 lies between what numbers? $\textbf{(A)}\hspace{.05in}40\text{ and }50 \qquad \textbf{(B)}\hspace{.05in}51\text{ and }55 \qquad \textbf{(C)}\hspace{.05in}56\text{ and }60 \qquad \textbf{(D)}\hspace{.05in} \text{61 and 65}\qquad \textbf{(E)}\hspace{.05in} \text{66 and 99}$

BdMO National 2018 Higher Secondary P3 Nazia rolls four fair six-sided dice. She doesn’t see the results. Her friend Faria tells her that the product of the numbers is $144$. Faria also says the sum of the dice, $S$ satisfies $14\leq S\leq 18$ . Nazia tells Faria that $S$ cannot be one of the numbers in the set {$14,15,16,17,18$} if the product is $144$. Which number in the range {$14,15,16,17,18$} is an impossible value for $S$ ?

Find all real numbers $x$ for which the number $$a =\frac{2x + 1}{x^2 + 2x + 3}$$ is an integer.

For a positive integer $n$ let $a_n$ denote the last digit of $n^{(n^n)}$. Prove that the sequence $(a_n)$ is periodic and determine the length of the minimal period.

Let $ a,b,c $ be pairwise coprime positive integers. Find all positive integer values of $$ \frac{a+b}{c}+\frac{b+c}{a}+\frac{c+a}{b} $$

A positive integer $k\geqslant 3$ is called[i] fibby[/i] if there exists a positive integer $n$ and positive integers $d_1 < d_2 < \ldots < d_k$ with the following properties: \\ $\bullet$ $d_{j+2}=d_{j+1}+d_j$ for every $j$ satisfying $1\leqslant j \leqslant k-2$, \\ $\bullet$ $d_1, d_2, \ldots, d_k$ are divisors of $n$, \\ $\bullet$ any other divisor of $n$ is either less than $d_1$ or greater than $d_k$. Find all fibby numbers. \\ \\ [i]Proposed by Ivan Novak.[/i]

Let $p$ be a prime. Define $f_n(k)$ to be the number of positive integers $1\leq x\leq p-1$ such that $$\left(\left\{\frac{x}{p}\right\}-\left\{\frac{k}{p}\right\}\right)\left(\left\{\frac{nx}{p}\right\}-\left\{\frac{k}{p}\right\}\right)<0.$$ Let $a_n=f_n\left(\frac 12\right)+f_n\left(\frac 32\right)+\dots+f_n\left(\frac{2p-1}{2}\right)$, find $\min\{a_2, a_3, \dots, a_{p-1}\}$.

Let $d(n)$ be the number of positive divisors of a natural number $n$.Find all $k\in \mathbb{N}$ such that there exists $n\in \mathbb{N}$ with $d(n^2)/d(n)=k$.

Determine all triples of positive integers $(x,y,z)$ such that $x^4+y^4 =2z^2$ and $x$ and $y$ are relatively prime.

The number $123$ is shown on the screen of a computer. Each minute the computer adds $102$ to the number on the screen. The computer expert Misha may change the order of digits in the number on the screen whenever he wishes. Can he ensure that no four-digit number ever appears on the screen? (F.L. Nazarov, Leningrad)