Let $S_n$ denote the sum of the first $n$ prime numbers. Prove that for any $n$ there exists the square of an integer between $S_n$ and $S_{n+1}$.

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.

Prove that if $n$ is a natural number such that $1 + 2^n + 4^n$ is prime then $n = 3^k$ for some $k \in N_0$.

[u]Set 1[/u] [b]p1.[/b] Find $1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10 + 11$. [b]p2.[/b] Find $1 \cdot 11 + 2 \cdot 10 + 3 \cdot 9 + 4 \cdot 8 + 5 \cdot 7 + 6 \cdot 6$. [b]p3.[/b] Let $\frac{1}{1\cdot 2} +\frac{1}{2\cdot 3} +\frac{1}{3\cdot 4} +\frac{1}{4\cdot 5} +\frac{1}{5\cdot 6} +\frac{1}{6\cdot 7} +\frac{1}{7\cdot 8} +\frac{1}{8\cdot 9} +\frac{1}{9\cdot 10} +\frac{1}{10\cdot 11} =\frac{m}{n}$ , where $m$ and $n$ are positive integers that share no prime divisors. Find $m + n$. [u]Set 2[/u] [b]p4.[/b] Define $0! = 1$ and let $n! = n \cdot (n - 1)!$ for all positive integers $n$. Find the value of $(2! + 0!)(1! + 8!)$. [b]p5.[/b] Rachel’s favorite number is a positive integer $n$. She gives Justin three clues about it: $\bullet$ $n$ is prime. $\bullet$ $n^2 - 5n + 6 \ne 0$. $\bullet$ $n$ is a divisor of $252$. What is Rachel’s favorite number? [b]p6.[/b] Shen eats eleven blueberries on Monday. Each day after that, he eats five more blueberries than the day before. For example, Shen eats sixteen blueberries on Tuesday. How many blueberries has Shen eaten in total before he eats on the subsequent Monday? [u]Set 3[/u] [b]p7.[/b] Triangle $ABC$ satisfies $AB = 7$, $BC = 12$, and $CA = 13$. If the area of $ABC$ can be expressed in the form $m\sqrt{n}$, where $n$ is not divisible by the square of a prime, then determine $m + n$. [b]p8.[/b] Sebastian is playing the game Split! on a coordinate plane. He begins the game with one token at $(0, 0)$. For each move, he is allowed to select a token on any point $(x, y)$ and take it off the plane, replacing it with two tokens, one at $(x + 1, y)$, and one at $(x, y + 1)$. At the end of the game, for a token on $(a, b)$, it is assigned a score $\frac{1}{2^{a+b}}$ . These scores are summed for his total score. Determine the highest total score Sebastian can get in $100$ moves. [b]p9.[/b] Find the number of positive integers $n$ satisfying the following two properties: $\bullet$ $n$ has either four or five digits, where leading zeros are not permitted, $\bullet$ The sum of the digits of $n$ is a multiple of $3$. [u]Set 4[/u] [b]p10.[/b] [i]A unit square rotated $45^o$ about a vertex, Sweeps the area for Farmer Khiem’s pen. If $n$ is the space the pigs can roam, Determine the floor of $100n$.[/i] If $n$ is the area a unit square sweeps out when rotated 4$5$ degrees about a vertex, determine $\lfloor 100n \rfloor$. Here $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$. [img]https://cdn.artofproblemsolving.com/attachments/b/1/129efd0dbd56dc0b4fb742ac80eaf2447e106d.png[/img] [b]p11.[/b][i] Michael is planting four trees, In a grid, three rows of three, If two trees are close, Then both are bulldozed, So how many ways can it be?[/i] In a three by three grid of squares, determine the number of ways to select four squares such that no two share a side. [b]p12.[/b] [i]Three sixty-seven Are the last three digits of $n$ cubed. What is $n$?[/i] If the last three digits of $n^3$ are $367$ for a positive integer $n$ less than $1000$, determine $n$. [u]Set 5[/u] [b]p13.[/b] Determine $\sqrt[4]{97 + 56\sqrt{3}} + \sqrt[4]{97 - 56\sqrt{3}}$. [b]p14. [/b]Triangle $\vartriangle ABC$ is inscribed in a circle $\omega$ of radius $12$ so that $\angle B = 68^o$ and $\angle C = 64^o$ . The perpendicular from $A$ to $BC$ intersects $\omega$ at $D$, and the angle bisector of $\angle B$ intersects $\omega$ at $E$. What is the value of $DE^2$? [b]p15.[/b] Determine the sum of all positive integers $n$ such that $4n^4 + 1$ is prime. [u]Set 6[/u] [b]p16.[/b] Suppose that $p, q, r$ are primes such that $pqr = 11(p + q + r)$ such that $p\ge q \ge r$. Determine the sum of all possible values of $p$. [b]p17.[/b] Let the operation $\oplus$ satisfy $a \oplus b =\frac{1}{1/a+1/b}$ . Suppose $$N = (...((2 \oplus 2) \oplus 2) \oplus ... 2),$$ where there are $2018$ instances of $\oplus$ . If $N$ can be expressed in the form $m/n$, where $m$ and $n$ are relatively prime positive integers, then determine $m + n$. [b]p18.[/b] What is the remainder when $\frac{2018^{1001} - 1}{2017}$ is divided by $2017$? PS. You had better use hide for answers. Last sets have been posted [url=https://artofproblemsolving.com/community/c4h2777307p24369763]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all nonnegative integers $a$ and $b$ that satisfy the equation $$3 \cdot 2^a + 1 = b^2.$$

Given a random positive integer $N$. Prove that there exist infinitely many positive integers $M$ whose none of its digits is $0$ and such that the sum of the digits of $N \cdot M$ is same as sum of digits $M$.

Show that there are no integers $x$ and $y$ satisfying $x^2 + 5 = y^3$. Daniel Harrer

A set $X$ of positive integers is said to be [i]iberic[/i] if $X$ is a subset of $\{2, 3, \dots, 2018\}$, and whenever $m, n$ are both in $X$, $\gcd(m, n)$ is also in $X$. An iberic set is said to be [i]olympic[/i] if it is not properly contained in any other iberic set. Find all olympic iberic sets that contain the number $33$.

Find all natural numbers $x,y,z$, such that $7^{x}+13^{y}=2^{z}$.

Show that there are infinitely many positive integers $a$ such that the number $n^4+a$ is composite for every positive integer $n.$ Give 5 (different) numbers $a$ with the mentioned property.

Distinct positive integers $a, b, c, d$ satisfy $$\begin{cases} a \mid b^2 + c^2 + d^2,\\ b\mid a^2 + c^2 + d^2,\\ c \mid a^2 + b^2 + d^2,\\ d \mid a^2 + b^2 + c^2,\end{cases}$$ and none of them is larger than the product of the three others. What is the largest possible number of primes among them?

Let $p\geq 3$ be an odd positive integer. Show that $p$ is prime if and only if however we choose $(p+1)/2$ pairwise distinct positive integers, we can find two of them, $a$ and $b$, such that $(a+b)/\gcd(a,b)\geq p.$

Let $A$ be a finite subset of prime numbers and $a> 1$ be a positive integer. Show that the number of positive integers $m$ for which all prime divisors of $a^m-1$ are in $A$ is finite.

Benedek scripted a program which calculated the following sum: $1^1+2^2+3^3+. . .+2021^{2021}$. What is the remainder when the sum is divided by $35$?

Is it possible to arrange 1400 positive integer ( not necessarily distinct ) ,at least one of them being 2021 , around a circle such that any number on this circle equals to the sum of gcd of the two previous numbers and two next numbers? for example , if $a,b,c,d,e$ are five consecutive numbers on this circle , $c=\gcd(a,b)+\gcd(d,e)$

Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.

Some positive integer $n$ is written on the board. Andrey and Petya is playing the following game. Andrey finds all the different representations of the number n as a product of powers of prime numbers (values degrees greater than 1), in which each factor is greater than all previous or equal to the previous one. Petya finds all different representations of the number $n$ as a product of integers greater than $1$, in which each factor is divisible by all the previous factors. The one who finds more performances wins, if everyone finds the same number of representations, the game ends in a draw. Find all positive integers $n$ for which the game will end in a draw. Note. The representation of the number $n$ as a product is also considered a representation consisting of a single factor $n$.

Let $a_1,a_2 ,\ldots, a_n$ be an arithmetic progression of integers such that $i|a_i$ for $i=1, 2,\ldots ,n-1$ and $n\nmid a_n$. Prove that $n$ is a prime power.

For a prime $p$, let $\mathbb{F}_p$ denote the integers modulo $p$, and let $\mathbb{F}_p[x]$ be the set of polynomials with coefficients in $\mathbb{F}_p$. Find all $p$ for which there exists a quartic polynomial $P(x) \in \mathbb{F}_p[x]$ such that for all integers $k$, there exists some integer $\ell$ such that $P(\ell) \equiv k \pmod p$. (Note that there are $p^4(p-1)$ quartic polynomials in $\mathbb{F}_p[x]$ in total.) [i]Aprameya Tripathy[/i]

The princess wishes to have a bracelet with $r$ rubies and $s$ emeralds arranged in such order that there exist two jewels on the bracelet such that starting with these and enumerating the jewels in the same direction she would obtain identical sequences of jewels. Prove that it is possible to fulfill the princess’s wish if and only if $r$ and $s$ have a common divisor.

A number is called polite if it can be written as $ m + (m+1)+...+ n$, for certain positive integers $ m <n$ . For example: $18$ is polite, since $18 =5 + 6 + 7$. A number is called a power of two if it can be written as $2^{\ell}$ for some integer $\ell \ge 0$. (a) Show that no number is both polite and a power of two. (b) Show that every positive integer is polite or a power of two.

Solve for prime numbers $p, q, r$ : $$\frac{p}{q} - \frac{4}{r + 1}= 1$$

Find the largest natural number $n$ that divides $a^{25} -a$ for all integers $a$.

Find all natural numbers $n> 1$ for which the following applies: The sum of the number $n$ and its second largest divisor is $2013$. (R. Henner, Vienna)

A [i]festive [/i] number is a four-digit integer containing one of each of the digits $0, 1, 2$, and $4$ in its decimal representation. How many festive numbers are there?