[b]p1.[/b] In this problem, a half deck of cards consists of $26$ cards, each labeled with an integer from $1$ to $13$. There are two cards labeled $1$, two labeled $2$, two labeled $3$, etc. A certain math class has $13$ students. Each day, the teacher thoroughly shuffles a half deck of cards and deals out two cards to each student. Each student then adds the two numbers on the cards received, and the resulting $13$ sums are multiplied together to form a product $P$. If $P$ is an even number, the class must do math homework that evening. Show that the class always must do math homework. [b]p2.[/b] Twenty-six people attended a math party: Archimedes, Bernoulli, Cauchy, ..., Yau, and Zeno. During the party, Archimedes shook hands with one person, Bernoulli shook hands with two people, Cauchy shook hands with three people, and similarly up through Yau, who shook hands with $25$ people. How many people did Zeno shake hands with? Justify that your answer is correct and that it is the only correct answer. [b]p3.[/b] Prove that there are no integers $m, n \ge 1$ such that $$\sqrt{m+\sqrt{m+\sqrt{m+...+\sqrt{m}}}}=n$$ where there are $2006$ square root signs. [b]p4.[/b] Let $c$ be a circle inscribed in a triangle ABC. Let $\ell$ be the line tangent to $c$ and parallel to $AC$ (with $\ell \ne AC$). Let $P$ and $Q$ be the intersections of $\ell$ with $AB$ and $BC$, respectively. As $ABC$ runs through all triangles of perimeter $1$, what is the longest that the line segment $PQ$ can be? Justify your answer. [b]p5.[/b] Each positive integer is assigned one of three colors. Show that there exist distinct positive integers $x, y$ such that $x$ and $y$ have the same color and $|x -y|$ is a perfect square. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all positive integers $n$ for which both numbers \[1\;\;\!\!\!\!\underbrace{77\ldots 7}_{\text{$n$ sevens}}\!\!\!\!\quad\text{and}\quad 3\;\; \!\!\!\!\underbrace{77\ldots 7}_{\text{$n$ sevens}}\] are prime.

Let e>0. Prove that for a large enough natural n, there exist natural x,y,z st $n^2+x^2=y^2+z^2$ and $y,z\leq \frac{(1+e)n}{\sqrt{2}}$.

Let \[ p(x,y) \equal{} a_0 \plus{} a_1x \plus{} a_2y \plus{} a_3x^2 \plus{} a_4xy \plus{} a_5y^2 \plus{} a_6x^3 \plus{} a_7x^2y \plus{} a_8xy^2 \plus{} a_9y^3. \]Suppose that \begin{align*}p(0,0) &\equal{} p(1,0) \equal{} p( \minus{} 1,0) \equal{} p(0,1) \equal{} p(0, \minus{} 1) \\&\equal{} p(1,1) \equal{} p(1, \minus{} 1) \equal{} p(2,2) \equal{} 0.\end{align*} There is a point $ \left(\tfrac {a}{c},\tfrac {b}{c}\right)$ for which $ p\left(\tfrac {a}{c},\tfrac {b}{c}\right) \equal{} 0$ for all such polynomials, where $ a$, $ b$, and $ c$ are positive integers, $ a$ and $ c$ are relatively prime, and $ c > 1$. Find $ a \plus{} b \plus{} c$.

We call a positive integer $n$ whose all digits are distinct [i]bright[/i], if either $n$ is a one-digit number or there exists a divisor of $n$ which can be obtained by omitting one digit of $n$ and which is bright itself. Find the largest bright positive integer. (We assume that numbers do not start with zero.)

Determine if the number $\lambda_n=\sqrt{3n^2+2n+2}$ is irrational for all non-negative integers $n$.

Let $ A$ be the subset of the set of positive integers, having the following $ 2$ properties: 1) If $ a$ belong to $ A$,than all of the divisors of $ a$ also belong to $ A$; 2) If $ a$ and $ b$, $ 1 < a < b$, belong to $ A$, than $ 1 \plus{} ab$ is also in $ A$; Prove that if $ A$ contains at least $ 3$ positive integers, than $ A$ contains all positive integers.

The ${\textit{distinct prime factors}}$ of an integer are its prime factors listed without repetition. For example, the distinct prime factors of $40$ are $2$ and $5$. Let $A=2^k - 2$ and $B= 2^k \cdot A$, where $k$ is an integer ($k \ge 2$). Show that, for every integer $k$ greater than or equal to $2$, [list=i] [*] $A$ and $B$ have the same set of distinct prime factors. [*] $A+1$ and $B+1$ have the same set of distinct prime factors. [/list]

On blackboard there are $10$ different positive integers which sum is equal to $62$. Prove that product of those numbers is divisible with $60$

Let $f: \mathbb{R}\to\mathbb{R}$ be a function such that $(f(x))^{n}$ is a polynomial for every integer $n\geq 2$. Is $f$ also a polynomial?

Assume $n$ is a positive integer and integer $a$ is the root of the equation $$x^4+3ax^2+2ax-2\times 3^n=0.$$ Find all $n$ and $ a$ that satisfy the conditions.

A set of numbers $a_1, a_2 , . . . , a_{100}$ is obtained by rearranging the numbers $1 , 2,..., 100$ . Form the numbers $b_1=a_1$ $b_2= a_1 + a_2$ $b_3=a_1 + a_2 + a_3$ ... $b_{100}=a_1 + a_2 + ...+a_{100}$ Prove that among the remainders on dividing the numbers by $100 , 11$ of them are different . ( L . D . Kurlyandchik , Leningrad)

One of the boxes that Joshua and Wendy unpack has Joshua's collection of board games. Michael, Wendy, Alexis, and Joshua decide to play one of them, a game called $\textit{Risk}$ that involves rolling ordinary six-sided dice to determine the outcomes of strategic battles. Wendy has never played before, so early on Michael explains a bit of strategy. "You have the first move and you occupy three of the four territories in the Australian continent. You'll want to attack Joshua in Indonesia so that you can claim the Australian continent which will give you bonus armies on your next turn." "Don't tell her $\textit{that!}$" complains Joshua. Wendy and Joshua begin rolling dice to determine the outcome of their struggle over Indonesia. Joshua rolls extremely well, overcoming longshot odds to hold off Wendy's attack. Finally, Wendy is left with one chance. Wendy and Joshua each roll just one six-sided die. Wendy wins if her roll is $\textit{higher}$ than Joshua's roll. Let $a$ and $b$ be relatively prime positive integers so that $a/b$ is the probability that Wendy rolls higher, giving her control over the continent of Australia. Find the value of $a+b$.

Consider the set $M=\{1,2,...,n\},n\in\mathbb N$. Find the smallest positive integer $k$ with the following property: In every $k$-element subset $S$ of $M$ there exist two elements, one of which divides the other one.

Find four positive integers each not exceeding $70000$ and each having more than $100$ divisors.

For any positive integers $a$ and $b$ with $b > 1$, let $s_b(a)$ be the sum of the digits of $a$ when it is written in base $b$. Suppose $n$ is a positive integer such that $$\sum^{\lfloor \log_{23} n\rfloor}_{i=1} s_{20} \left( \left\lfloor \frac{n}{23^i} \right\rfloor \right)= 103 \,\,\, \text{and} \,\,\, \sum^{\lfloor \log_{20} n\rfloor}_{i=1} s_{23} \left( \left\lfloor \frac{n}{20^i} \right\rfloor \right)= 115$$ Compute $s_{20}(n) - s_{23}(n)$.

8. The Equation [i]AB[/i] X [i]CD[/i] = [i]EFGH[/i], where each of the letters [i]A[/i], [i]B[/i], [i]C[/i], [i]D[/i], [i]E[/i], [i]F[/i], [i]G[/i], [i]H[/i] represents a different digit and the values of [i]A[/i], [i]C[/i] and [i]E[/i] are all nonzero, has many solutions, e.g., 46 X 85 =3910. Find the smallest value of the four-digit number [i]EFGH[/i] for which there is a solution.

Find with proof all positive $3$ digit integers $\overline{abc}$ satisfying \[ b\cdot \overline{ac}=c \cdot \overline{ab} +10 \]

For a fixed integer $n\geqslant2$ consider the sequence $a_k=\text{lcm}(k,k+1,\ldots,k+(n-1))$. Find all $n$ for which the sequence $a_k$ increases starting from some number.

Let $a,b$ and $c$ be integers and $r$ a real number such that $ar^2+br+c=0$ with $ac\not =0$.Prove that $\sqrt{r^2+c^2}$ is an irrational number

Find a prime number $p$ such that $\frac{p+1}{2}$ and $\frac{p^2+1}{2}$ are perfect square

Prove that the expression $$ (1^4+1^2+1)(2^4+2^2+1)\dots(n^4+n^2+1)$$ is not square for all $n \in \mathbb{N}$

For positive integers $a$, $b$, and $c$, define \[ f(a,b,c)=\frac{abc}{\text{gcd}(a,b,c)\cdot\text{lcm}(a,b,c)}. \] We say that a positive integer $n$ is $f@$ if there exist pairwise distinct positive integers $x,y,z\leq60$ that satisfy $f(x,y,z)=n$. How many $f@$ integers are there? [i]Proposed by Michael Ren[/i]

Find the largest integer $ n$ satisfying the following conditions: (i) $ n^2$ can be expressed as the difference of two consecutive cubes; (ii) $ 2n\plus{}79$ is a perfect square.

Show that $(k^3)!$ is divisible by $(k!)^{k^2+k+1}$.