Call the [i]improvement [/i] of a positive number its replacement by a power of two. (i.e. one of the numbers $1, 2, 4, 8, ...$), for which it increases, but not more than than $3$ times. Given $2^{100}$ positive numbers with a sum of $2^{100}$. Prove that you can erase some of them, and [i]improve [/i] each of the other numbers so that the sum the resulting numbers were again $2^{100}$.

[b]p1.[/b] The serpent of fire and the serpent of ice play a game. Since the serpent of ice loves the lucky number $6$, he will roll a fair $6$-sided die with faces numbered $1$ through $6$. The serpent of fire will pay him $\log_{10} x$, where $x$ is the number he rolls. The serpent of ice rolls the die $6$ times. His expected total amount of winnings across the $6$ rounds is $k$. Find $10^k$. [b]p2.[/b] Let $a = \log_3 5$, $b = \log_3 4$, $c = - \log_3 20$, evaluate $\frac{a^2+b^2}{a^2+b^2+ab} +\frac{b^2+c^2}{b^2+c^2+bc} +\frac{c^2+a^2}{c^2+a^2+ca}$. [b]p3.[/b] Let $\vartriangle ABC$ be an isosceles obtuse triangle with $AB = AC$ and circumcenter $O$. The circle with diameter $AO$ meets $BC$ at points $X, Y$ , where X is closer to $B$. Suppose $XB = Y C = 4$, $XY = 6$, and the area of $\vartriangle ABC$ is $m\sqrt{n}$ for positive integers $m$ and $n$, where $n$ does not contain any square factors. Find $m + n$. [b]p4.[/b] Alice is not sure what to have for dinner, so she uses a fair $6$-sided die to decide. She keeps rolling, and if she gets all the even numbers (i.e. getting all of $2, 4, 6$) before getting any odd number, she will reward herself with McDonald’s. Find the probability that Alice could have McDonald’s for dinner. [b]p5.[/b] How many distinct ways are there to split $50$ apples, $50$ oranges, $50$ bananas into two boxes, such that the products of the number of apples, oranges, and bananas in each box are nonzero and equal? [b]p6.[/b] Sujay and Rishabh are taking turns marking lattice points within a square board in the Cartesian plane with opposite vertices $(1, 1)$,$(n, n)$ for some constant $n$. Sujay loses when the two-point pattern $P$ below shows up:[img]https://cdn.artofproblemsolving.com/attachments/1/9/d1fe285294d4146afc0c7a2180b15586b04643.png[/img] That is, Sujay loses when there exists a pair of points $(x, y)$ and $(x + 2, y + 1)$. He and Rishabh stop marking points when the pattern $P$ appears on the board. If Rishabh goes first, let $S$ be the set of all integers $3 \le n \le 100$ such that Rishabh has a strategy to always trick Sujay into being the one who creates $P$. Find the sum of all elements of $S$. [b]p7.[/b] Let $a$ be the shortest distance between the origin $(0, 0)$ and the graph of $y^3 = x(6y -x^2)-8$. Find $\lfloor a^2 \rfloor $. ($\lfloor x\rfloor $ is the largest integer not exceeding $x$) [b]p8.[/b] Find all real solutions to the following equation: $$2\sqrt2x^2 + x -\sqrt{1 - x^2 } -\sqrt2 = 0.$$ [b]p9.[/b] Given the expression $S = (x^4 - x)(x^2 - x^3)$ for $x = \cos \frac{2\pi}{5 }+ i\sin \frac{2\pi}{5 }$, find the value of $S^2$ . [b]p10.[/b] In a $32$ team single-elimination rock-paper-scissors tournament, the teams are numbered from $1$ to $32$. Each team is guaranteed (through incredible rock-paper-scissors skill) to win any match against a team with a higher number than it, and therefore will lose to any team with a lower number. Each round, teams who have not lost yet are randomly paired with other teams, and the losers of each match are eliminated. After the $5$ rounds of the tournament, the team that won all $5$ rounds is ranked $1$st, the team that lost the 5th round is ranked $2$nd, and the two teams that lost the $4$th round play each other for $3$rd and $4$th place. What is the probability that the teams numbered $1, 2, 3$, and $4$ are ranked $1$st, 2nd, 3rd, and 4th respectively? If the probability is $\frac{m}{n}$ for relatively prime integers $m$ and $n$, find $m$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

a) Show that the number $(2k + 1)^3 - (2k - 1)^3$, $k \in Z$, is the sum of three perfect squares. b) Represent the number $(2n + 1)^3 -2$, $n \in N^*$, as the sum of $3n- 1$ perfect squares greater than $1$.

What digit must be put in place of the "$?$" in the number $888...88?999...99$ (where the $8$ and $9$ are each written $50$ times) in order that the resulting number is divisible by $7$? (M . I. Gusarov)

Find the number of the subsets $B$ of the set $\{1,2,\cdots, 2005 \}$ such that the sum of the elements of $B$ is congruent to $2006$ modulo $2048$

p1. A telephone number with $7$ digits is called a [i]Beautiful Number [/i]if the digits are which appears in the first three numbers (the three must be different) repeats on the next three digits or the last three digits. For example some beautiful numbers: $7133719$, $7131735$, $7130713$, $1739317$, $5433354$. If the numbers are taken from $0, 1, 2, 3, 4, 5, 6, 7, 8$ or $9$, but the number the first cannot be $0$, how many Beautiful Numbers can there be obtained? p2. Find the number of natural numbers $n$ such that $n^3 + 100$ is divisible by $n +10$ p3. A function $f$ is defined as in the following table. [img]https://cdn.artofproblemsolving.com/attachments/5/5/620d18d312c1709b00be74543b390bfb5a8edc.png[/img] Based on the definition of the function $f$ above, then a sequence is defined on the general formula for the terms is as follows: $U_1=2$ and $U_{n+1}=f(U_n)$ , for $n = 1, 2, 3, ...$ p4. In a triangle $ABC$, point $D$ lies on side $AB$ and point $E$ lies on side $AC$. Prove for the ratio of areas: $\frac{ADE }{ABC}=\frac{AD\times AE}{AB\times AC}$ p5. In a chess tournament, a player only plays once with another player. A player scores $1$ if he wins, $0$ if he loses, and $\frac12$ if it's a draw. After the competition ended, it was discovered that $\frac12$ of the total value that earned by each player is obtained from playing with 10 different players who got the lowest total points. Especially for those in rank bottom ten, $\frac12$ of the total score one gets is obtained from playing with $9$ other players. How many players are there in the competition?

Let $n>1$ be a positive integer. Show that the number of residues modulo $n^2$ of the elements of the set $\{ x^n + y^n : x,y \in \mathbb{N} \}$ is at most $\frac{n(n+1)}{2}$. [I]Proposed by N. Safaei (Iran)[/i]

(a) Find all pairs $(m, n)$ of integers satisfying $m^3-4mn^2=8n^3-2m^2n$ (b) Among such pairs find those for which $m+n^2=3$

There are 7 pieces of paper in the hat. On the $ n $th piece of paper there is written the number $ 2^n-1 $ ($ n = 1, 2, \ldots, 7 $). We draw cards randomly until the sum exceeds 124. What is the most probable value of this sum?

Find all prime number $p$ such that the number of positive integer pair $(x,y)$ satisfy the following is not $29$. [list] [*]$1\le x,y\le 29$ [*]$29\mid y^2-x^p-26$ [/list]

Prove that every selection of $1325$ integers from $M=\{1, 2, \cdots, 1987 \}$ must contain some three numbers $\{a, b, c\}$ which are pairwise relatively prime, but that it can be avoided if only $1324$ integers are selected.

Suppose $a_1,a_2,a_3,b_1,b_2,b_3$ are distinct positive integers such that \[(n \plus{} 1)a_1^n \plus{} na_2^n \plus{} (n \minus{} 1)a_3^n|(n \plus{} 1)b_1^n \plus{} nb_2^n \plus{} (n \minus{} 1)b_3^n\] holds for all positive integers $n$. Prove that there exists $k\in N$ such that $ b_i \equal{} ka_i$ for $ i \equal{} 1,2,3$.

Let $a$ be the largest root of the equation $x^3 - 3x^2 + 1 = 0$. Find the first $200$ decimal digits for the number $a^{2000}$.

Solve the following system of equations in integer numbers: $$\begin{cases} x^2 = yz + 1 \\ y^2 = zx + 1 \\ z^2 = xy + 1 \end{cases}$$

A positive integer $n$ is called [i]good [/i] if they sum up in one and only one way at least of two positive integers whose product also has the value $n$. Here representations that differ only in the order of the summands are considered the same viewed. Find all good positive integers.

Let $m$ be a given positive integer. Prove that there exists a positive integer $k$ such that it holds $$1\leq \frac{1^m+2^m+3^m+\ldots +(k-1)^m}{k^m}<2.$$

Let $f$ be a bijection of the set of all natural numbers on to itself. Prove that there exists positive integers $a < a+d < a+ 2d$ such that $f(a) < f(a+d) <f(a+2d)$

Determine all finite increasing arithmetic progressions in which each term is the reciprocal of a positive integer and the sum of all the terms is $1$.

Find all positive integers $n$ for which all coefficients of polynomial $P(x)$ are divisible by $7,$ where \[P(x) = (x^2 + x + 1)^n - (x^2 + 1)^n - (x + 1)^n - (x^2 + x)^n + x^{2n} + x^n + 1.\]

Let $ a>1$ be a positive integer. Prove that every non-zero positive integer $ N$ has a multiple in the sequence $ (a_n)_{n\ge1}$, $ a_n\equal{}\left\lfloor\frac{a^n}n\right\rfloor$.

Let be two natural numbers $ m,n, $ and $ m $ pairwise disjoint sets of natural numbers $ A_0,A_1,\ldots ,A_{m-1}, $ each having $ n $ elements, such that no element of $ A_{i\pmod m} $ is divisible by an element of $ A_{i+1\pmod m} , $ for any natural number $ i. $ Determine the number of ordered pairs $$ (a,b)\in\bigcup_{0\le j < m} A_j\times\bigcup_{0\le j < m} A_j $$ such that $ a|b $ and such that $ \{ a,b \}\not\in A_k, $ for any $ k\in\{ 0,1,\ldots ,m-1 \} . $ [i]Radu Bumbăcea[/i]

We define the polynomial $$P (x) = 2014x^{2013} + 2013x^{2012} +... + 4x^3 + 3x^2 + 2x.$$ Find the largest prime divisor of $P (2)$.

Determine all positive integers $n$ for which there exists an integer $m$ such that ${2^{n}-1}$ is a divisor of ${m^{2}+9}$.

Prove that $3^n + 1$ is not divisible by $2^n$ for any integer $n > 1$.

Show that there exist two consecutive squares such that there are at least $1000$ primes between them.