Find all triples $(x,n,p)$ of positive integers $x$ and $n$ and primes $p$ for which the following holds $x^3 + 3x + 14 = 2 p^n$

For each positive integer $k$, let $S(k)$ the sum of digits of $k$ in decimal system. Show that there is an integer $k$, with no $9$ in it's decimal representation, such that: $$S(2^{24^{2017}}k)=S(k)$$

Let $n$ be a positive integer and $a=2^n\cdot 7^{n+1}+11$ and $b=2^{n+1}\cdot 7^n+3$. $a)$ Prove that fraction $\frac{a}{b}$ is irreducible $b)$ Prove that number $a+b-7$ is not a perfect square for any positive integer $n$

Let $ a$, $ b$, $ c$, $ d$, $ e$, $ f$ be positive integers and let $ S = a+b+c+d+e+f$. Suppose that the number $ S$ divides $ abc+def$ and $ ab+bc+ca-de-ef-df$. Prove that $ S$ is composite.

Determine all composite positive integers $n$ for which it is possible to arrange all divisors of $n$ that are greater than 1 in a circle so that no two adjacent divisors are relatively prime.

How many positive integers $n \le \text{lcm}(1,2, \ldots, 100)$ have the property that $n$ gives different remainders when divided by each of $2,3, \ldots, 100$?

Given positive integers $m$ and $n$, prove that there is a positive integer $c$ such that the numbers $cm$ and $cn$ have the same number of occurrences of each non-zero digit when written in base ten.

Suppose $M$ is an infinite set of natural numbers such that, whenever the sum of two natural numbers is in $M$, one of these two numbers is in $M$ as well. Prove that the elements of any finite set of natural numbers not belonging to $M$ have a common divisor greater than $1$.

Find the smallest positive integer $n$ or show no such $n$ exists, with the following property: there are infinitely many distinct $n$-tuples of positive rational numbers $(a_1, a_2, \ldots, a_n)$ such that both $$a_1+a_2+\dots +a_n \quad \text{and} \quad \frac{1}{a_1} + \frac{1}{a_2} + \dots + \frac{1}{a_n}$$ are integers.

Let $n$ be a natural number. Prove that there is a multiple of $n$ that can be written only with the digits $0$ and $1$.

An integer $x$ is selected at random between 1 and $2011!$ inclusive. The probability that $x^x - 1$ is divisible by $2011$ can be expressed in the form $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m$. [i]Author: Alex Zhu[/i]

For a positive integer $n$, numbers $2n+1$ and $3n+1$ are both perfect squares. Is it possible for $5n+3$ to be prime?

Suppose $\overline{a_1a_2...a_{2009}}$ is a $2009$-digit integer such that for each $i = 1,2,...,2007$, the $2$-digit integer $\overline{a_ia_{i+1}}$ contains $3$ distinct prime factors. Find $a_{2008}$ (Note: $\overline{xyz...}$ denotes an integer whose digits are $x, y,z,...$.)

Show that it is possible to express $1$ as a sum of $6$, and as a sum of $9$ reciprocals of odd positive integers. Generalize the problem.

Find all positive integers such that they have $6$ divisors (without $1$ and the number itself) and the sum of the divisors is $14133$.

Find all positive integers $n$ such that $(n^2 + 11n - 4) \cdot n! + 33 \cdot 13^n + 4$ is a perfect square

Positive integer $n$ is not larger than $2000$, and $n$ is equal to the sum of no less than sixty adjacent positive integers. Then number of such numbers is________.

What is the ratio of the least common multiple of 180 and 594 to the greatest common factor of 180 and 594? $\textbf{(A)}\ 110 \qquad \textbf{(B)}\ 165 \qquad \textbf{(C)}\ 330 \qquad \textbf{(D)}\ 625 \qquad \textbf{(E)}\ 660$

[b]p1.[/b] Find a real number $x$ for which $x\lfloor x \rfloor = 1234.$ Note: $\lfloor x\rfloor$ is the largest integer less than or equal to $x$. [b]p2.[/b] Let $C_1$ be a circle of radius $1$, and $C_2$ be a circle that lies completely inside or on the boundary of $C_1$. Suppose$ P$ is a point that lies inside or on $C_2$. Suppose $O_1$, and $O_2$ are the centers of $C_1$, and $C_2$, respectively. What is the maximum possible area of $\vartriangle O_1O_2P$? Prove your answer. [b]p3.[/b] The numbers $1, 2, . . . , 99$ are written on a blackboard. We are allowed to erase any two distinct (but perhaps equal) numbers and replace them by their nonnegative difference. This operation is performed until a single number $k$ remains on the blackboard. What are all the possible values of $k$? Prove your answer. Note: As an example if we start from $1, 2, 3, 4$ on the board, we can proceed by erasing $1$ and $2$ and replacing them by $1$. At that point we are left with $1, 3, 4$. We may then erase $3$ and $4$ and replacethem by $1$. The last step would be to erase $1$, $1$ and end up with a single $0$ on the board. [b]p4.[/b] Let $a, b$ be two real numbers so that $a^3 - 6a^2 + 13a = 1$ and $b^3 - 6b^2 + 13b = 19$. Find $a + b$. Prove your answer. [b]p5.[/b] Let $m, n, k$ be three positive integers with $n \ge k$. Suppose $A =\prod_{1\le i\le j\le m} gcd(n + i, k + j) $ is the product of $gcd(n + i, k + j)$, where $i, j$ range over all integers satisfying $1\le i\le j\le m$. Prove that the following fraction is an integer $$\frac{A}{(k + 1) \dots(k + m)}{n \choose k}.$$ Note: $gcd(a, b)$ is the greatest common divisor of $a$ and $b$, and ${n \choose k}= \frac{n!}{k!(n - k)!}$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all positive integers $n$ such that we can divide the set $\{1,2,3,\ldots,n\}$ into three sets with the same sum of members.

Let $ A\equal{}\{n: 1 \le n \le 2009^{2009},n \in \mathbb{N} \}$ and let $ S\equal{}\{n: n \in A,\gcd \left(n,2009^{2009}\right)\equal{}1\}$. Let $ P$ be the product of all elements of $ S$. Prove that \[ P \equiv 1 \pmod{2009^{2009}}.\] [i]Nanang Susyanto, Jogjakarta[/i]

Is it possible to release a ray on a plane from each point with rational coordinates so that no two rays have a common point and at the same time, among the lines containing these rays, no two are parallel and do not coincide? [i]Proposed by P. Kozhevnikov[/i]

A positive integer $m$ is said to be $\emph{zero taker}$ if there exists a positive integer $k$ such that: $k$ is a perfect square; $m$ divides $k$; the decimal expression of $k$ contains at least $2021$ '0' digits, but the last digit of $k$ is not equal to $0$. Find all positive integers that are zero takers.

Uri must paint some integers from $1$ to $2022$ (inclusive) in red, such that none of the differences between two red numbers is a prime number. Determine the maximum number of numbers Uri can paint red. [b]Note 1:[/b] The [i]difference [/i]between two distinct numbers is the subtraction of the larger minus the smaller. [b]Note 2:[/b] $1$ is not a prime number.

Let $n$ be a positive integer. Show that there exist three distinct integers between $n^{2}$ and $n^{2}+n+3\sqrt{n}$, such that one of them divides the product of the other two.