Numbers $7^2$,$8^2,\ldots,2023^2$,$2024^2$ are written on the board. Is it possible to add to one of them $7$, to some other one $8$, $\ldots$, to the remaining $2024$ such that all numbers became prime [i]M. Zorka[/i]

Show that for any finite set $S$ of distinct positive integers, we can find a set $T \supseteq S$ such that every member of $T$ divides the sum of all the members of $T$. [b]Original Statement:[/b] A finite set of (distinct) positive integers is called a [b]DS-set[/b] if each of the integers divides the sum of them all. Prove that every finite set of positive integers is a subset of some [b]DS-set[/b].

Does there exist a natural number $n$, for which $n.2^{2^{2014}}-81-n$ is a perfect square?

What is the sum of all primes $p$ such that $7^p - 6^p + 2$ is divisible by 43?

Let $p$ be a prime number greater than $2$. Patricia wants $7$ not-necessarily different numbers from $\{1, 2, . . . , p\}$ to the black dots in the figure below, on such a way that the product of three numbers on a line or circle always has the same remainder when divided by $p$. [img]https://cdn.artofproblemsolving.com/attachments/3/1/ef0d63b8ff5341ffc340de0cc75b24c7229e23.png[/img] (a) Suppose Patricia uses the number $p$ at least once. How many times does she have the number $p$ then a minimum sum needed? (b) Suppose Patricia does not use the number $p$. In how many ways can she assign numbers? (Two ways are different if there is at least one black one dot different numbers are assigned. The figure is not rotated or mirrored.)

Prove that there exist infinitely many positive integers $n$ such that $3^n+2$ and $5^n+2$ are all composite numbers.

$(CZS 2)$ Let $p$ be a prime odd number. Is it possible to find $p-1$ natural numbers $n + 1, n + 2, . . . , n + p -1$ such that the sum of the squares of these numbers is divisible by the sum of these numbers?

Numbers $a, b$ and $c$ are positive integers and $\frac{1}{a}+\frac{1}{b}+\frac{ 1}{c}< 1.$ Show that \[\frac{1}{a}+\frac{1}{b}+\frac{ 1}{c}\leq \frac{41}{42}.\]

Find all nonnegative integers $x,y$ such that \[ 2 \cdot 3^{x} +1 = 7 \cdot 5^{y}. \]

Let $\pi (n)$ denote the largest prime divisor of $n$ for any positive integer $n > 1$. Let $q$ be an odd prime. Show that there exists a positive integer $k$ such that $$\pi \left(q^{2^k}-1\right)< \pi\left(q^{2^k}\right)<\pi \left( q^{2^k}+1\right).$$

Let $p$ and $q$ be relatively prime positive integers. A subset $S\subseteq \mathbb{N}_0$ is called ideal if $0 \in S$ and, for each element $n \in S$, the integers $n+p$ and $n+q$ belong to $S$. Determine the number of ideal subsets of $\mathbb{N}_0$.

Prove that the equation $ 2x^2 - 215y^2 = 1 $ has no integer solutions.

Prove that for every positive integer $n$, the number $A_n = 5^n + 2 \cdot 3^{n-1} + 1$ is a multiple of $8$.

Is it true that for any permulation $a_1,a_2.....,a_{2002}$ of $1,2....,2002$ there are positive integers $m,n$ of the same parity such that $0<m<n<2003$ and $a_m+a_n=2a_{\frac {m+n}{2}}$

Suppose that for some $m,n\in\mathbb{N}$ we have $\varphi (5^m-1)=5^n-1$, where $\varphi$ denotes the Euler function. Show that $(m,n)>1$.

Let $m$ be an positive odd integer not divisible by $3$. Prove that $\left[4^m -(2+\sqrt 2)^m\right]$ is divisible by $112.$

The first of an infinite triangular spreadsheet the line contains one number, the second line contains two numbers, the third line contains three numbers, and so on. In doing so is in any $k$-th row ($k = 1, 2, 3,...$) in the first and last place the number $k$, each other the number in the table is found, however, than in the previous row the least common of the two numbers above it multiple (the adjacent figure shows the first five rows of this table). We choose any two numbers from the table that are not in their row in the first or last place. Prove that one of the selected numbers is divisible by another. [img]https://cdn.artofproblemsolving.com/attachments/3/7/107d8999d9f04777719a0f1b1df418dbe00023.png[/img]

Prove that for any prime $p,$ there exists a positive integer $n$ such that \[1^n+2^{n-1}+3^{n-2}+\cdots+n^1\equiv 2020\pmod{p}.\] [i]Robin Son[/i]

Suppose $\, q_{0}, \, q_{1}, \, q_{2}, \ldots \; \,$ is an infinite sequence of integers satisfying the following two conditions: (i) $\, m-n \,$ divides $\, q_{m}-q_{n}\,$ for $\, m > n \geq 0,$ (ii) there is a polynomial $\, P \,$ such that $\, |q_{n}| < P(n) \,$ for all $\, n$ Prove that there is a polynomial $\, Q \,$ such that $\, q_{n}= Q(n) \,$ for all $\, n$.

Let $n$ is positive integer, $D_n$ is a set of all positive divisor of $n$ and $f(n)=\sum_{d\in D_n}{\frac{1}{1+d}}$ Prove that for all positive integer $m$, $\sum_{i=1}^{m}{f(i)} <m$

Consider the set of solutions of the equation $$x^2+y^3=z^2.$$ in positive integers. Is it finite or infinite? (Folklore)

Let $2\leq N\leq 2022$ be a positive integer. Find the sum of all possible values of $N$ such that the product of the distinct divisors of $N$ is $N^{\frac{21}{2}}$.

[b]p1.[/b] I open my $2010$-page dictionary, whose pages are numbered $ 1$ to $2010$ starting on page $ 1$ on the right side of the spine when opened, and ending with page $2010$ on the left. If I open to a random page, what is the probability that the two page numbers showing sum to a multiple of $6$? [b]p2.[/b] Let $A$ be the number of positive integer factors of $128$. Let $B$ be the sum of the distinct prime factors of $135$. Let $C$ be the units’ digit of $381$. Let $D$ be the number of zeroes at the end of $2^5\cdot 3^4 \cdot 5^3 \cdot 7^2\cdot 11^1$. Let $E$ be the largest prime factor of $999$. Compute $\sqrt[3]{\sqrt{A + B} +\sqrt[3]{D^C+E}}$. [b]p3. [/b] The root mean square of a set of real numbers is defined to be the square root of the average of the squares of the numbers in the set. Determine the root mean square of $17$ and $7$. [b]p4.[/b] A regular hexagon $ABCDEF$ has area $1$. The sides$ AB$, $CD$, and $EF$ are extended to form a larger polygon with $ABCDEF$ in the interior. Find the area of this larger polygon. [b]p5.[/b] For real numbers $x$, let $\lfloor x \rfloor$ denote the greatest integer less than or equal to $x$. For example, $\lfloor 3\rfloor = 3$ and $\lfloor 5.2 \rfloor = 5$. Evaluate $\lfloor -2.5 \rfloor + \lfloor \sqrt 2 \rfloor + \lfloor -\sqrt 2 \rfloor + \lfloor 2.5 \rfloor$. [b]p6.[/b] The mean of five positive integers is $7$, the median is $8$, and the unique mode is $9$. How many possible sets of integers could this describe? [b]p7.[/b] How many three digit numbers x are there such that $x + 1$ is divisible by $11$? [b]p8.[/b] Rectangle $ABCD$ is such that $AD = 10$ and $AB > 10$. Semicircles are drawn with diameters $AD$ and $BC$ such that the semicircles lie completely inside rectangle $ABCD$. If the area of the region inside $ABCD$ but outside both semicircles is $100$, determine the shortest possible distance between a point $X$ on semicircle $AD$ and $Y$ on semicircle $BC$. [b]p9.[/b] $ 8$ distinct points are in the plane such that five of them lie on a line $\ell$, and the other three points lie off the line, in a way such that if some three of the eight points lie on a line, they lie on $\ell$. How many triangles can be formed using some three of the $ 8$ points? [b]p10.[/b] Carl has $10$ Art of Problem Solving books, all exactly the same size, but only $9$ spaces in his bookshelf. At the beginning, there are $9$ books in his bookshelf, ordered in the following way. $A - B - C - D - E - F - G - H - I$ He is holding the tenth book, $J$, in his hand. He takes the books out one-by-one, replacing each with the book currently in his hand. For example, he could take out $A$, put $J$ in its place, then take out $D$, put $A$ in its place, etc. He never takes the same book out twice, and stops once he has taken out the tenth book, which is $G$. At the end, he is holding G in his hand, and his bookshelf looks like this. $C - I - H - J - F - B - E - D - A$ Give the order (start to finish) in which Carl took out the books, expressed as a $9$-letter string (word). PS. You had better use hide for answers.

Determine all pairs of positive integers $(a,b)$ such that \[ \dfrac{a^2}{2ab^2-b^3+1} \] is a positive integer.

[b]p1.[/b] Fill in each box with an integer from $1$ to $9$. Each number in the right column is the product of the numbers in its row, and each number in the bottom row is the product of the numbers in its column. Some numbers may be used more than once, and not every number from $1$ to $9$ is required to be used. [img]https://cdn.artofproblemsolving.com/attachments/c/0/0212181d87f89aac374f75f1f0bde6d0600037.png[/img] [b]p2.[/b] A set $X$ is called [b]prime-difference free [/b] (henceforth pdf) if for all $x, y \in X$, $|x - y|$ is not prime. Find the number n such that the following both hold. $\bullet$ There is a pdf set of size $n$ that is a subset of $\{1,..., 2016\}$, and $\bullet$ There is no pdf set of size $n + 1$ that is a subset of $\{1,..., 2016\}$. [b]p3.[/b] Let $X_1,...,X_{15}$ be a sequence of points in the $xy$-plane such that $X_1 = (10, 0)$ and $X_{15} = (0, 10)$. Prove that for some $i \in \{1, 2,..., 14\}$, the midpoint of $X_iX_{i+1}$ is of distance greater than $1/2$ from the origin. [b]p4.[/b] Suppose that $s_1, s_2,..., s_{84}$ is a sequence of letters from the set $\{A,B,C\}$ such that every four-letter sequence from $\{A,B,C\}$ occurs exactly once as a consecutive subsequence $s_k$, $s_{k+1}$, $s_{k+2}$, $s_{k+3}$. Suppose that $$(s_1, s_2, s_3, s_4, s_5) = (A,B,B,C,A).$$ What is $s_{84}$? Prove your answer. [b]p5.[/b] Determine (with proof) whether or not there exists a sequence of positive real numbers $a_1, a_2, a_3,...$ with both of the following properties: $\bullet$ $\sum^n_{i=1} a_i \le n^2$, for all $n \ge 1$, and $\bullet$ $\sum^n_{i=1} \frac{1}{a_i} \le 2016$, for all $n \ge 1$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].