A sequence $ (a_n)$ of positive integers satisfies: $ a_n\equal{}\sqrt{\frac{a_{n\minus{}1}^2\plus{}a_{n\plus{}1}^2}{2}}$ for all $ n \ge 1$. Prove that this sequence is constant.

Let $m$ and $n$ be positive integers. Prove that if $m^{4^n+1} - 1$ is a prime number, then there exists an integer $t \ge 0$ such that $n = 2^t$.

For all integers $n\ge 2$ with the following property: [list] [*] for each pair of positive divisors $k,~\ell <n$, at least one of the numbers $2k-\ell$ and $2\ell-k$ is a (not necessarily positive) divisor of $n$ as well.[/list]

Solve in none-negative integers ${x^3} + 7{x^2} + 35x + 27 = {y^3}$.

Prove that $46^{2n+1} + 296 \cdot 13^{2n+1}$ is divisible by $1947$.

Let $N$ be the set of positive integers. Find all the functions $f: N\to N$ with $f (1) = 2$ and such that $max \{f(m)+f(n), m+n\}$ divides $min\{2m+2n,f (m+ n)+1\}$ for all $m, n$ positive integers

Let $a\%b$ denote the remainder when $a$ is divided by $b$. Find $\Sigma_{i=1}^{100}(100\%i)$.

Solve the following equation over the integers $$ 25x^2y^2+10x^2y+25xy^2+x^2+30xy+2y^2+5x+7y+6= 0.$$

[b]1)[/b] Prove that there are finite sequences, of any length, of nonegative integers having the property that the arithmetic mean of any choice of its elements is natural. [b]2)[/b] Study if there is an increasing infinite sequence of nonegative integers having the property that the arithmetic mean of any finite choice of its elements is natural.

Given a positive integer $n \ge 2$. Find all $n$-tuples of positive integers $(a_1,a_2,\ldots,a_n)$, such that $1<a_1 \le a_2 \le a_3 \le \cdots \le a_n$, $a_1$ is odd, and (1) $M=\frac{1}{2^n}(a_1-1)a_2 a_3 \cdots a_n$ is a positive integer; (2) One can pick $n$-tuples of integers $(k_{i,1},k_{i,2},\ldots,k_{i,n})$ for $i=1,2,\ldots,M$ such that for any $1 \le i_1 <i_2 \le M$, there exists $j \in \{1,2,\ldots,n\}$ such that $k_{i_1,j}-k_{i_2,j} \not\equiv 0, \pm 1 \pmod{a_j}$.

Let $f(x)=x^n + a_{n-1}x^{n-1} + ...+ a_0 $ be a polynomial of degree $ n\ge 1 $ with $ n$ (not necessarily distinct) integer roots. Assume that there exist distinct primes $p_0,p_1,..,p_{n-1}$ such that $a_i > 1$ is a power of $p_i$, for all $ i=0,1,..,n-1$. Find all possible values of $ n$.

Find all positive integers $m$ and $n$ such that $(2^{2^{n}}+1)(2^{2^{m}}+1) $ is divisible by $m\cdot n $ .

[b]p1[/b]. Consider the following four statements referring to themselves: 1. At least one of these statements is true. 2. At least two of these statements are false. 3. At least three of these statements are true. 4. All four of these statements are false. Determine which statements are true and which are false. Justify your answer. [b]p2.[/b] Let $f(x) = a_{2017}x^{2017} + a_{2016}x^{2016} + ... + a_1x + a_0$ where the coefficients $a_0, a_1, ... , a_{2017}$ have not yet been determined. Alice and Bob play the following game: $\bullet$ Alice and Bob alternate choosing nonzero integer values for the coefficients, with Alice going first. (For example, Alice’s first move could be to set $a_{18}$ to $-3$.) $\bullet$ After all of the coefficients have been chosen: - If f(x) has an integer root then Alice wins. - If f(x) does not have an integer root then Bob wins. Determine which player has a winning strategy and what the strategy is. Make sure to justify your answer. [b]p3.[/b] Suppose that a circle can be inscribed in a polygon $P$ with $2017$ equal sides. Prove that $P$ is a regular polygon; that is, all angles of $P$ are also equal. [b]p4.[/b] A $3 \times 3 \times 3$ cube of cheese is sliced into twenty-seven $ 1 \times 1 \times 1$ blocks. A mouse starts anywhere on the outside and eats one of the $1\times 1\times 1$ cubes. He then moves to an adjacent cube (in any direction), eats that cube, and continues until he has eaten all $27$ cubes. (Two cubes are considered adjacent if they share a face.) Prove that no matter what strategy the mouse uses, he cannot eat the middle cube last. [Note: One should neglect gravity – intermediate configurations don’t collapse.] p5. Suppose that a constant $c > 0$ and an infinite sequence of real numbers $x_0, x_1, x_2, ...$ satisfy $x_{k+1} =\frac{x_k + 1}{1 - cx_k}$ for all $k \ge 0$. Prove that the sequence $x_0, x_1, x_2, ....$ contains infinitely many positive terms and also contains infinitely many negative terms. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $M$ be a positive integer, and let $a,b,c$ be integers in the interval $[M,M+\sqrt{\frac{M}{2}})$ such that $a^3b+b^3c+c^3a$ is divisible by $abc$. Prove that $a=b=c$. Proposed by Shantanu Nene

Find the smallest positive $m$ such that if $a,b,c$ are three side lengths of a triangle with $a^2 +b^2 > mc^2$, then $c$ must be the length of shortest side.

Let $\mathcal{S}$ be a set consisting of $n \ge 3$ positive integers, none of which is a sum of two other distinct members of $\mathcal{S}$. Prove that the elements of $\mathcal{S}$ may be ordered as $a_1, a_2, \dots, a_n$ so that $a_i$ does not divide $a_{i - 1} + a_{i + 1}$ for all $i = 2, 3, \dots, n - 1$.

A prime number $p > 2$ and $x,y \in \left\{ 1,2,\ldots, \frac{p-1}{2} \right\}$ are given. Prove that if $x\left( p-x\right)y\left( p-y\right)$ is a perfect square, then $x = y$.

Let $p$ be a prime number. Prove that there exists a prime number $q$ such that for every integer $n$, the number $n^p-p$ is not divisible by $q$.

In Venetiania, the smallest currency is the ducat. The finance minister instructs his officials as follows: "I wish six kinds of banknotes, each worth a whole number of ducats. Those six values must be such that there exists a number N with the following property: Any amount of money of $n$ ducats ($n$ positive and integer) where $n \le N$ may be paid in such a way that no more than two copies of each kind are required either to pay or to return. I also wish those six values to be as large as possible for $N$. Determine those six values and provide proof that all conditions have been met." Solve the problem of those officials

Find all integers $n$ for which $9n + 16$ and $16n + 9$ are both perfect squares.

The diagram below shows circles radius $1$ and $2$ externally tangent to each other and internally tangent to a circle radius $3$. There are relatively prime positive integers $m$ and $n$ so that a circle radius $\frac{m}{n}$ is internally tangent to the circle radius $3$ and externally tangent to the other two circles as shown. Find $m+n$. [asy] import graph; size(5cm); real labelscalefactor = 0.5; pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); pen dotstyle = black; draw(circle((8,2), 3)); draw(circle((8,1), 2)); draw(circle((8,4), 1)); draw((8,-1)--(8,5)); draw(circle((9.72,3.28), 0.86)); label("$ 2 $",(7.56,1.38),SE*labelscalefactor); label("$ 1 $",(7.6,4.39),SE*labelscalefactor); [/asy]

Given that \[ \sum_{x=1}^{70} \sum_{y=1}^{70} \frac{x^{y}}{y} = \frac{m}{67!} \] for some positive integer $m$, find $m \pmod{71}$.

Let $ \left( s_n \right)_{n\ge 1 } $ be a sequence with $ s_1 $ and defined recursively as $ s_{n+1}=s_n^2-s_n+1. $ Prove that any two terms of this sequence are coprime. [i]Dan Nedeianu[/i]

Georg has a board displaying the numbers from $1$ to $50$. Georg may strike out a number if it can be formed by starting with the number $2$ and doing one or more calculations where he either multiplies by $10$ or subtracts $3$. Which of the board’s numbers may Georg strike out?[img]https://cdn.artofproblemsolving.com/attachments/c/e/1bea13b691d3591d782e698bedee3235f8512f.png[/img] Example: Georg may strike out $26$ because it may, for example, be formed by starting with $2$, multiplying by $10$, subtracting $3$ three times, multiplying by $10$ and subtracting $3$ twenty-eight times.

Let's call a natural number a palindrome, the decimal notation of which is equally readable from left to right and right to left (decimal notation cannot start from zero; for example, the number $1221$ is a palindrome, but the numbers $1231, 1212$ and $1010$ are not). Which palindromes among the numbers from $10,000$ to $999,999$ have an odd sum of digits, which have an one even, and how many times are the ones with odd sum more than the ones with the even sum?