Given a positive integer $k$, find the least integer $n_k$ for which there exist five sets $S_1, S_2, S_3, S_4, S_5$ with the following properties: \[|S_j|=k \text{ for } j=1, \cdots , 5 , \quad |\bigcup_{j=1}^{5} S_j | = n_k ;\] \[|S_i \cap S_{i+1}| = 0 = |S_5 \cap S_1|, \quad \text{for } i=1,\cdots ,4 \]

A sequence of positive reals $\{ a_n \}$ is defined below. $$a_0 = 1, a_1 = 3, a_{n+2} = \frac{a_{n+1}^2+2}{a_n}$$ Show that for all nonnegative integer $n$, $a_n$ is a positive integer.

Find all pairs $\left(a,b\right)$ of posive integers such that $\frac{a^{2}\left(b-a\right)}{b+a}$ is square of prime.

[b]p1.[/b] While computing $7 - 2002 \cdot x$, John accidentally evaluates from left to right $((7 - 2002) \cdot x)$ instead of correctly using order of operations $(7 - (2002 \cdot x))$. If he gets the correct answer anyway, what is $x$? [b]p2.[/b] Given that $$x^2 + y^2 + z^2 = 6$$ $$ \left( \frac{x}{y} + \frac{y}{x} \right)^2 + \left( \frac{y}{z} + \frac{z}{y} \right)^2 + \left( \frac{z}{x} + \frac{x}{z} \right)^2 = 16.5,$$ what is $\frac{1}{x^2} + \frac{1}{y^2} + \frac{1}{z^2}$ ? [b]p3.[/b] Evaluate $$\frac{tan \frac{\pi}{4}}{4}+\frac{tan \frac{3\pi}{4}}{8}+\frac{tan \frac{5\pi}{4}}{16}+\frac{tan \frac{7\pi}{4}}{32}+ ...$$ [b]p4.[/b] Note that $2002 = 22 \cdot 91$, and so $2002$ is a multiple of the number obtained by removing its middle $2$ digits. Generalizing this, how many $4$-digit palindromes, $abba$, are divisible by the $2$-digit palindrome, $aa$? [b]p5.[/b] Let $ABCDE$ be a pyramid such that $BCDE$ is a square with side length $2$, and $A$ is $2$ units above the center of $BCDE$. If $F$ is the midpoint of $\overline{DE}$ and $G$ is the midpoint of $\overline{AC}$, what is the length of $\overline{DE}$? [b]p6.[/b] Suppose $a_1, a_2,..., a_{100}$ are real numbers with the property that $$i(a_1 + a_2 +... + a_i) = 1 + (a_{i+1} + a_{i+2} + ... + a_{100})$$ for all $i$. Compute $a_{10}$. [b]p7.[/b] A bug is sitting on one corner of a $3' \times 4' \times 5'$ block of wood. What is the minimum distance nit needs to travel along the block’s surface to reach the opposite corner? [b]p8.[/b] In the number game, a pair of positive integers $(n,m)$ is written on a blackboard. Two players then take turns doing the following: 1. If $n \ge m$, the player chooses a positive integer $c$ such that $n - cm \ge 0$, and replaces $(n,m)$ with $(n - cm,m)$. 2. If $m > n$, the player chooses a positive integer $c$ such that $m - cn \ge 0$, and replaces $(n,m)$ with $(n,m - cn)$. If $m$ or $n$ ever become $0$, the game ends, and the last player to have moved is declared the winner. If $(n,m)$ are originally $(20021000, 2002)$, what choices of $c$ are winning moves for the first player? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find the sum (in base $10$) of the three greatest numbers less than $1000_{10}$ that are palindromes in both base $10$ and base $5$.

Find all integers $x,y,z$ such that: $7^x+13^y=2^z$

Define a function $g :\mathbb{N} \rightarrow \mathbb{R}$ Such that $g(x)=\sqrt{4^x+\sqrt {4^{x+1}+\sqrt{4^{x+2}+...}}}$. Find the last 2 digits in the decimal representation of $g(2021)$.

How many positive integers $N$ in the segment $\left[10, 10^{20} \right]$ are such that if all their digits are increased by $1$ and then multiplied, the result is $N+1$? [i](F. Bakharev)[/i]

Let the sequence $u_n$ be defined by $u_0=0$ and $u_{2n}=u_n$, $u_{2n+1}=1-u_n$ for each $n\in\mathbb N_0$. (a) Calculate $u_{1990}$. (b) Find the number of indices $n\le1990$ for which $u_n=0$. (c) Let $p$ be a natural number and $N=(2^p-1)^2$. Find $u_N$.

Positive intenger $n\geq3$. $a_1,a_2,\cdots,a_n$ are $n$ positive intengers that are pairwise coprime, satisfying that there exists $k_1,k_2,\cdots,k_n\in\{-1,1\}, \sum_{i=1}^{n}k_ia_i=0$. Are there positive intengers $b_1,b_2,\cdots,b_n$, for any $k\in\mathbb{Z}_+$, $b_1+ka_1,b_2+ka_2,\cdots,b_n+ka_n$ are pairwise coprime?

Find all pairs $(n,r)$ with $n$ a positive integer and $r$ a real such that $2x^2+2x+1$ divides $(x+1)^n - r$.

Let $ n$ be a positive integer and let $ a_1,a_2,a_3,\ldots,a_k$ $ ( k\ge 2)$ be distinct integers in the set $ { 1,2,\ldots,n}$ such that $ n$ divides $ a_i(a_{i + 1} - 1)$ for $ i = 1,2,\ldots,k - 1$. Prove that $ n$ does not divide $ a_k(a_1 - 1).$ [i]Proposed by Ross Atkins, Australia [/i]

A positive six-digit integer begins and ends in $8$, and is also the product of three consecutive even numbers. What is the sum of the three even numbers?

Two infinite arithmetic progressions are called considerable different if the do not only differ by the absence of finitely many members at the beginning of one of the sequences. How many pairwise considerable different non-constant arithmetic progressions of positive integers that contain an infinite non-constant geometric progression $ (b_n)_{n\ge0}$ with $ b_2\equal{}40 \cdot 2009$ are there?

We define the sequence $a_n=(2n)^2+1$ for each natural number $n$. We will call one number [i]bad[/i], if there don’t exist natural numbers $a>1$ and $b>1$ such that $a_n=a^2+b^2$. Prove that the natural number $n$ is [i]bad[/i], if and only if $a_n$ is prime.

There are coins in denominations of $a$ and $b$ doubloons, where $a$ and $b$ are given mutually prime natural numbers, with $a < b < 100$. A non-negative integer $n$ is called [i]lucky[/i] if the sum in $n$ doubloons can be scored with using no more than $1000$ coins. Find the number of lucky numbers. [i]From the folklore[/i]

Pingu is given two positive integers $m$ and $n$ without any common factors greater than $1$. a) Help Pingu find positive integers $p, q$ such that $$\operatorname{gcd}(pm+q, n) \cdot \operatorname{gcd}(m, pn+q) = mn$$ b) Prove to Pingu that he can never find positive integers $r, s$ such that $$\operatorname{lcm}(rm+s, n) \cdot \operatorname{lcm}(m, rn+s) = mn$$ regardless of the choice of $m$ and $n$.

Pablo and Nacho write together a succession of positive integers of $2006$ terms, according to the following rules: Pablo begins, who in his first turn writes $1$, and from then on, each one in his turn writes an integer positive that is greater than or equal to the last number that the opponent wrote and less than or equal to triple the last number that the opponent wrote. When the two of them have written the $2006$ numbers, the sum $S$ of the first $ 2005$ numbers written (all except the last one) and the sum $T$ of the $2006$ numbers written. If $S$ and $T $ are co-cousins, Nacho wins. Otherwise, Pablo wins. Determine which of the two players has a winning strategy, describe the strategy and demonstrate that it is a winning one.

A natural number is a [i]palindrome[/i] when one obtains the same number when writing its digits in reverse order. For example, $481184$, $131$ and $2$ are palindromes. Determine all pairs $(m,n)$ of positive integers such that $\underbrace{111\ldots 1}_{m\ {\rm ones}}\times\underbrace{111\ldots 1}_{n\ {\rm ones}}$ is a palindrome.

Compute $\sum^{999}_{x=1}\gcd (x, 10x + 9)$.

Let $A$ and $B$ be two sets such that $A \cup B$ is the set of the positive integers, and $A \cap B$ is the empty set. It is known that if two positive integers have a prime larger than $2013$ as their difference, then one of them is in $A$ and the other is in $B$. Find all the possibilities for the sets $A$ and $B$.

$N$ is an integer whose representation in base $b$ is $777$. Find the smallest integer $b$ for which $N$ is the fourth power of an integer.

There is $500$ dollars in a bank. Two bank operations are allowed: to withdraw $300$ dollars from the bank or to deposit $198$ dollars into the bank. These operations can be repeated as many times as necessary but only the money that was initially in the bank can be used. What is the largest amount of money that can be borrowed from the bank? How can this be done? (AK Tolpygo)

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.

Find all integers $x,y,z$ such that $x^3 +5y^3 = 9z^3$.