For a positive integer $n$ let $P(n)$ denote the set of primes $p$ for which there exist positive integers $a, b$ such that $n=a^p+b^p$ . Is it true that for any finite set $H$ consisting of primes, there is an n such that $P(n) = H$?

Consider the sequence $x_n = 2^n-n$, $n = 0,1 ,2 ,...$. Find all integers $m \ge 0$ such that $s_m = x_0 + x_1 + x_2 + ... + x_m$ is a power of $2$.

Let $B=\{2^1,2^2,2^3,\dots,2^{21}\}.$ Find the remainder when \[ \sum_{m, n \in B: \ m<n}\gcd(m,n) \] is divided by $1000,$ where the sum is taken over all pairs of elements $(m,n)$ of $B$ such that $m<n.$

Let $a_0$ be a fixed positive integer. We define an infinite sequence of positive integers $\{a_n\}_{n\ge 1}$ in an inductive way as follows: if we are given the terms $a_0,a_1,...a_{n-1}$ , then $a_n$ is the smallest positive integer such that $\sqrt[n]{a_0\cdot a_1\cdot ...\cdot a_n}$ is a positive integer. Show that the sequence $\{a_n\}_{n\ge 1}$ is eventually constant. [b]Note:[/b] The sequence $\{a_n\}_{n\ge 1}$ is eventually constant if there exists a positive integer $k$ such that $a_n=c$, for every $n\ge k$.

Find all positive integers $n,k,a_1,a_2,...,a_k$ so that $n^{k+1}+1$ is divisible by $(na_1+1)(na_2+1)...(na_k+1)$

Let $(a_i)_{i\in \mathbb{N}}$ and $(p_i)_{i\in \mathbb{N}}$ be two sequences of positive integers such that the following conditions hold: $\bullet ~~a_1\ge 2$. $\bullet~~ p_n$ is the smallest prime divisor of $a_n$ for every integer $n\ge 1$ $\bullet~~ a_{n+1}=a_n+\frac{a_n}{p_n}$ for every integer $n\ge 1$ Prove that there is a positive integer $N$ such that $a_{n+3}=3a_n$ for every integer $n>N$

Let $ n$ be a given positive integer. Show that we can choose numbers $ c_k\in\{\minus{}1,1\}$ ($ i\le k\le n$) such that \[ 0\le\sum_{k\equal{}1}^nc_k\cdot k^2\le4.\]

Prove that there is no positive integer $n$ such that, for $k = 1,2,\ldots,9$, the leftmost digit (in decimal notation) of $(n+k)!$ equals $k$.

We have thrown $k$ white dice and $m$ black dice. Find the probability that the remainder modulo $7$ of the sum of the numbers on the white dice is equal to the remainder modulo $7$ of the sum of the numbers on the black dice.

Show that if the difference of two positive cube numbers is a positive prime, then this prime number has remainder $1$ after division by $6$.

Prove that the equation $$xy(x -y) + yz(y-z) + zx(z-x) = 6$$ has infinitely many solutions in integers $x, y$ and $z$. (N Vassiliev)

Does there exist two infinite positive integer sets $S,T$, such that any positive integer $n$ can be uniquely expressed in the form $$n=s_1t_1+s_2t_2+\ldots+s_kt_k$$ ,where $k$ is a positive integer dependent on $n$, $s_1<\ldots<s_k$ are elements of $S$, $t_1,\ldots, t_k$ are elements of $T$?

A set $X$ consisting of $n$ positive integers is called $\textit{good}$ if the following condition holds: For any two different subsets of $X$, say $A$ and $B$, the number $s(A) - s(B)$ is not divisible by $2^n$. (Here, for a set $A$, $s(A)$ denotes the sum of the elements of $A$) Given $n$, find the number of good sets of size $n$, all of whose elements is strictly less than $2^n$.

[b]p1.[/b] Find all positive integers $n$ such that $n^3 - 14n^2 + 64n - 93$ is prime. [b]p2.[/b] Let $a, b, c$ be real numbers such that $0 \le a, b, c \le 1$. Find the maximum value of $$\frac{a}{1 + bc}+\frac{b}{1 + ac}+\frac{c}{1 + ab}$$ [b]p3.[/b] Find the maximum value of the function $f(x, y, z) = 4x + 3y + 2z$ on the ellipsoid $16x^2 + 9y^2 + 4z^2 = 1$ [b]p4.[/b] Let $x_1,..., x_n$ be numbers such that $x_1+...+x_n = 2009$. Find the minimum value of $x^2_1+...+x^2_n$ (in term of $n$). [b]p5.[/b] Find the number of odd integers between $1000$ and $9999$ that have at least 3 distinct digits. [b]p6.[/b] Let $A_1,A_2,...,A_{2^n-1}$ be all the possible nonempty subsets of $\{1, 2, 3,..., n\}$. Find the maximum value of $a_1 + a_2 + ... + a_{2^n-1}$ where $a_i \in A_i$ for each $i = 1, 2,..., 2^n - 1$. [b]p7.[/b] Find the rightmost digit when $41^{2009}$ is written in base $7$. [b]p8.[/b] How many integral ordered triples $(x, y, z)$ satisfy the equation $x+y+z = 2009$, where $10 \le x < 31$, $100 < z < 310$ and $y \ge 0$. [b]p9.[/b] Scooby has a fair six-sided die, labeled $1$ to $6$, and Shaggy has a fair twenty-sided die, labeled $1$ to $20$. During each turn, they both roll their own dice at the same time. They keep rolling the die until one of them rolls a 5. Find the probability that Scooby rolls a $5$ before Shaggy does. [b]p10.[/b] Let $N = 1A323492110877$ where $A$ is a digit in the decimal expansion of $N$. Suppose $N$ is divisible by $7$. Find $A$. [b]p11.[/b] Find all solutions $(x, y)$ of the equation $\tan^4(x+y)+\cot^4(x+y) = 1-2x-x^2$, where $-\frac{\pi}{2} \le x; y \le \frac{\pi}{2}$ [b]p12.[/b] Find the remainder when $\sum^{50}_{k=1}k!(k^2 + k - 1)$ is divided by $1008$. [b]p13.[/b] The devil set of a positive integer $n$, denoted $D(n)$, is defined as follows: (1) For every positive integer $n$, $n \in D(n)$. (2) If $n$ is divisible by $m$ and $m < n$, then for every element $a \in D(m)$, $a^3$ must be in $D(n)$. Furthermore, call a set $S$ scary if for any $a, b \in S$, $a < b$ implies that $b$ is divisible by $a$. What is the least positive integer $n$ such that $D(n)$ is scary and has at least $2009$ elements? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Two runners start running along a circular track of unit length from the same starting point and int he same sense, with constant speeds $v_1$ and $v_2$ respectively, where $v_1$ and $v_2$ are two distinct relatively prime natural numbers. They continue running till they simultneously reach the starting point. Prove that (a) at any given time $t$, at least one of the runners is at a distance not more than $\frac{[\frac{v_1 + v_2}{2}]}{v_1 + v_2}$ units from the starting point. (b) there is a time $t$ such that both the runners are at least $\frac{[\frac{v_1 + v_2}{2}]}{v_1 + v_2}$ units away from the starting point. (All disstances are measured along the track). $[x]$ is the greatest integer function.

Show that [list=a][*] infinitely many perfect squares are a sum of a perfect square and a prime number, [*] infinitely many perfect squares are not a sum of a perfect square and a prime number. [/list]

We define the [i]Fibonacci sequence[/i] $\{F_n\}_{n\ge0}$ by $F_0=0$, $F_1=1$, and for $n\ge2$, $F_n=F_{n-1}+F_{n-2}$; we define the [i]Stirling number of the second kind[/i] $S(n,k)$ as the number of ways to partition a set of $n\ge1$ distinguishable elements into $k\ge1$ indistinguishable nonempty subsets. For every positive integer $n$, let $t_n = \sum_{k=1}^{n} S(n,k) F_k$. Let $p\ge7$ be a prime. Prove that \[ t_{n+p^{2p}-1} \equiv t_n \pmod{p} \] for all $n\ge1$. [i]Proposed by Victor Wang[/i]

$p(x)$ is an irreducible polynomial with integer coefficients, and $q$ is a fixed prime number. Let $a_n$ be a number of solutions of the equation $p(x)\equiv 0\mod q^n$. Prove that we can find $M$ such that $\{a_n\}_{n\ge M}$ is constant.

Let $p=1601$. Prove that if \[\dfrac {1} {0^2+1}+\dfrac{1}{1^2+1}+\cdots+\dfrac{1}{(p-1)^2+1}=\dfrac{m} {n},\] where we only sum over terms with denominators not divisible by $p$ (and the fraction $\dfrac {m} {n}$ is in reduced terms) then $p \mid 2m+n$. [i]Proposed by A. Golovanov[/i]

Determine the number of pairs of positive integers $(a, b)$, with $a \le b$, for which lcm $(a, b) = 2004$. lcm ($a, b$) means the least common multiple of $a$ and $b$. Example: lcm $(18, 24) = 72$.

Determine all pairs of non-negative integers $(m, n)$ with m ≥n, such that $(m+n)^3$ divides $2n(3m^2+n^2)+8$

Determine all pairs $(n, k)$ of distinct positive integers such that there exists a positive integer $s$ for which the number of divisors of $sn$ and of $sk$ are equal.

Let $a,b,c,d$ be positive integers satisfying \[\frac{ab}{a+b}+\frac{cd}{c+d}=\frac{(a+b)(c+d)}{a+b+c+d}.\] Determine all possible values of $a+b+c+d$.

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.

Consider the set of all fractions $\tfrac{x}{y},$ where $x$ and $y$ are relatively prime positive integers. How many of these fractions have the property that if both numerator and denominator are increased by $1$, the value of the fraction is increased by $10\%$? $ \textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }3\qquad\textbf{(E) }\text{infinitely many} $