For which $ n \geq 2, n \in \mathbb{N}$ are there positive integers $ A_1, A_2, \ldots, A_n$ which are not the same pairwise and have the property that the product $ \prod^n_{i \equal{} 1} (A_i \plus{} k)$ is a power for each natural number $ k.$

Show that, for every positive integer $n$, there exist $n$ consecutive positive integers such that none is divisible by the sum of its digits. (Alternative Formulation: Call a number good if it's not divisible by the sum of its digits. Show that for every positive integer $n$ there are $n$ consecutive good numbers.)

Find all functions $ f: \mathbb Q\longrightarrow\mathbb Q$ such that: $ f(x)+f(\frac1x)=1$ $ 2f(f(x))=f(2x)$

A palindrome is a number that is the same when its digits are reversed. Find all numbers that have at least one multiple that is a palindrome.

Determine all pairs $(a,b)$ of natural numbers such that the number $$\frac{a^2(b-a)}{b+a}$$ is the square of a prime number.

a) Factorize $xy - x - y + 1$. b) Prove that if integers $a$ and $b$ satisfy $ |a + b| > |1 + ab|$, then $ab = 0$.

Determine if there exists an infinite sequence $a_0, a_1, a_2, a_3,...$ of nonegative integers that satisfies the following conditions: (i) All nonegative integers appear in the sequence exactly once. (ii) The succession $b_n=a_{n}+n,$, $n\geq0$, is formed by all prime numbers and each one appears exactly once.

Find all triples $(x, p, n)$ of non-negative integers such that $p$ is prime and $2x(x + 5) = p^n + 3(x - 1)$.

Let $p$ be an odd prime number. Find all natural numbers $k$ such that $$\sqrt{k^2 - pk}$$ is a positive integer.

[u]Round 1[/u] [b]p1.[/b] Three two-digit numbers are written on a board. One starts with $5$, another with $6$, and the last one with $7$. Annie added the first and the second numbers; Benny added the second and the third numbers; Denny added the third and the first numbers. Could it be that one of these sums is equal to $148$, and the two other sums are three-digit numbers that both start with $12$? [b]p2.[/b] Three rocks, three seashells, and one pearl are placed in identical boxes on a circular plate in the order shown. The lids of the boxes are then closed, and the plate is secretly rotated. You can open one box at a time. What is the smallest number of boxes you need to open to know where the pearl is, no matter how the plate was rotated? [img]https://cdn.artofproblemsolving.com/attachments/0/2/6bb3a2a27f417a84ab9a64100b90b8768f7978.png[/img] [b]p3.[/b] Two detectives, Holmes and Watson, are hunting the thief Raffles in a library, which has the floorplan exactly as shown in the diagram. Holmes and Watson start from the center room marked $D$. Show that no matter where Raffles is or how he moves, Holmes and Watson can find him. Holmes and Watson do not need to stay together. A detective sees Raffles only if they are in the same room. A detective cannot stand in a doorway to see two rooms at the same time. [img]https://cdn.artofproblemsolving.com/attachments/c/1/6812f615e60a36aea922f145a1ffc470d0f1bc.png[/img] [b]p4.[/b] A museum has a $4\times 4$ grid of rooms. Every two rooms that share a wall are connected by a door. Each room contains some paintings. The total number of paintings along any path of $7$ rooms from the lower left to the upper right room is always the same. Furthermore, the total number of paintings along any path of $7$ rooms from the lower right to the upper left room is always the same. The guide states that the museum has exactly $500$ paintings. Show that the guide is mistaken. [img]https://cdn.artofproblemsolving.com/attachments/4/6/bf0185e142cd3f653d4a9c0882d818c55c64e4.png[/img] [b]p5.[/b] The numbers $1–14$ are placed around a circle in some order. You can swap two neighbors if they differ by more than $1$. Is it always possible to rearrange the numbers using swaps so they are ordered clockwise from $1$ to $14$? [u]Round 2[/u] [b]p6.[/b] A triangulation of a regular polygon is a way of drawing line segments between its vertices so that no two segments cross, and the interior of the polygon is divided into triangles. A flip move erases a line segment between two triangles, creating a quadrilateral, and replaces it with the opposite diagonal through that quadrilateral. This results in a new triangulation. [img]https://cdn.artofproblemsolving.com/attachments/a/a/657a7cf2382bab4d03046075c6e128374c72d4.png[/img] Given any two triangulations of a polygon, is it always possible to find a sequence of flip moves that transforms the first one into the second one? [img]https://cdn.artofproblemsolving.com/attachments/0/9/d09a3be9a01610ffc85010d2ac2f5b93fab46a.png[/img] [b]p7.[/b] Is it possible to place the numbers from $1$ to $121$ in an $11\times 11$ table so that numbers that differ by $1$ are in horizontally or vertically adjacent cells and all the perfect squares $(1, 4, 9,..., 121)$ are in one column? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that if $m,n,r$ are positive integers, and: \[1+m+n\sqrt{3}=(2+\sqrt{3})^{2r-1} \] then $m$ is a perfect square.

a)Prove that $\frac{1}{2}+\frac{1}{3}+...+\frac{1}{{{2}^{m}}}<m$, for any $m\in {{\mathbb{N}}^{*}}$. b)Let ${{p}_{1}},{{p}_{2}},...,{{p}_{n}}$ be the prime numbers less than ${{2}^{100}}$. Prove that $\frac{1}{{{p}_{1}}}+\frac{1}{{{p}_{2}}}+...+\frac{1}{{{p}_{n}}}<10$

Let $M$ denote the set of $m\times n$ matrices with entries in the set $\{0,1,2,3,4\}$ such that in each row and each column the sum of elements is divisible by $5$. Find the cardinality of set $M$.

A set \( S \) of two or more positive integers is called [i]almost closed under addition[/i] if the sum of any two distinct elements of \( S \) also belongs to \( S \). Let \( P(x) \) be a polynomial with integer coefficients for which there exists an almost closed under addition set \( S \), such that for any two distinct \( a \) and \( b \) from \( S \), the numbers \( P(a) \) and \( P(b) \) are coprime. Prove that \( P \) is a constant.

Determine the polynomial $$f(x) = x^k + a_{k-1} x^{k-1}+\cdots +a_1 x +a_0 $$ of smallest degree such that $a_i \in \{-1,0,1\}$ for $0\leq i \leq k-1$ and $f(n)$ is divisible by $30$ for all positive integers $n$.

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$.

Do there exist $ 14$ positive integers, upon increasing each of them by $ 1$,their product increases exactly $ 2008$ times?

We say that three different integers are [i]friendly[/i] if one of them divides the product of the other two. Let $n$ be a positive integer. a) Show that, between $n^2$ and $n^2+n$, exclusive, does not exist any triplet of friendly numbers. b) Determine if for each $n$ exists a triplet of friendly numbers between $n^2$ and $n^2+n+3\sqrt{n}$ , exclusive.

Let ${u_n}$ be the Fibonacci sequence, i.e., $u_0=0,u_1=1,u_n=u_{n-1}+u_{n-2}$ for $n>1$. Prove that there exist infinitely many prime numbers $p$ that divide $u_{p-1}$.

Find all positive integers $x$, for which the equation $$a+b+c=xabc$$ has solution in positive integers. Solve the equation for these values of $x$

Prove that for any positive integer $k$ there exist $k$ pairwise distinct integers for which the sum of their squares equals the sum of their cubes.

Since $24 = 3+5+7+9$, the number $24$ can be written as the sum of at least two consecutive odd positive integers. (a) Can $2005$ be written as the sum of at least two consecutive odd positive integers? If yes, give an example of how it can be done. If no, provide a proof why not. (b) Can $2006$ be written as the sum of at least two consecutive odd positive integers? If yes, give an example of how it can be done. If no, provide a proof why not.

Find all pairs of positive integers $(a,b)$ such that $8b+1$ is a multiple of $a$ and $8a+1$ is a multiple of $b$.

Find all positive integers $n$ such that $n^3$ is the product of all divisors of $n$.

Let $n$ be the answer to this problem. We define the digit sum of a date as the sum of its $4$ digits when expressed in mmdd format (e.g. the digit sum of $13$ May is $0+5+1+3 = 9$). Find the number of dates in the year $2021$ with digit sum equal to the positive integer $n$.