Amy and Bob play the game. At the beginning, Amy writes down a positive integer on the board. Then the players take moves in turn, Bob moves first. On any move of his, Bob replaces the number $n$ on the blackboard with a number of the form $n-a^2$, where $a$ is a positive integer. On any move of hers, Amy replaces the number $n$ on the blackboard with a number of the form $n^k$, where $k$ is a positive integer. Bob wins if the number on the board becomes zero. Can Amy prevent Bob’s win? [i]Maxim Didin, Russia[/i]

Show that from any five integers, not necessarily distinct, one can always choose three of these integers whose sum is divisible by 3.

On a certain board, fractions are always written in their lowest form. Pionaj starts with 2 random positive fractions. After every minute,he replaces one of the previous 2 fractions (at random) with a new fraction that is equal to the sum of their numerators divided by the sum of their denominators. Given that he continues this indefinitely, show that eventually all the resulting fractions would be in their lowest forms even before writing them on the board(recall that he has to reduce each fration to their lowest form beore writing it on the board for the next operation). (for example starting with $\frac{15}{7}$ and $\frac{10}{3}$ he may replace it with $\frac{5}{2}$

[b]p1.[/b] Suppose $\frac{x}{y} = 0.\overline{ab}$ where $x$ and $y$ are relatively prime positive integers and $ab + a + b + 1$ is a multiple of $12$. Find the sum of all possible values of $y$. [b]p2.[/b] Let $A$ be the set of points $\{(0, 0), (2, 0), (0, 2),(2, 2),(3, 1),(1, 3)\}$. How many distinct circles pass through at least three points in $A$? [b]p3.[/b] Jack and Jill need to bring pails of water home. The river is the $x$-axis, Jack is initially at the point $(-5, 3)$, Jill is initially at the point $(6, 1)$, and their home is at the point $(0, h)$ where $h > 0$. If they take the shortest paths home given that each of them must make a stop at the river, they walk exactly the same total distance. What is $h$? [b]p4.[/b] What is the largest perfect square which is not a multiple of $10$ and which remains a perfect square if the ones and tens digits are replaced with zeroes? [b]p5.[/b] In convex polygon $P$, each internal angle measure (in degrees) is a distinct integer. What is the maximum possible number of sides $P$ could have? [b]p6.[/b] How many polynomials $p(x)$ of degree exactly $3$ with real coefficients satisfy $$p(0), p(1), p(2), p(3) \in \{0, 1, 2\}?$$ [b]p7.[/b] Six spheres, each with radius $4$, are resting on the ground. Their centers form a regular hexagon, and adjacent spheres are tangent. A seventh sphere, with radius $13$, rests on top of and is tangent to all six of these spheres. How high above the ground is the center of the seventh sphere? [b]p8.[/b] You have a paper square. You may fold it along any line of symmetry. (That is, the layers of paper must line up perfectly.) You then repeat this process using the folded piece of paper. If the direction of the folds does not matter, how many ways can you make exactly eight folds while following these rules? [b]p9.[/b] Quadrilateral $ABCD$ has $\overline{AB} = 40$, $\overline{CD} = 10$, $\overline{AD} = \overline{BC}$, $m\angle BAD = 20^o$, and $m \angle ABC = 70^o$. What is the area of quadrilateral $ABCD$? [b]p10.[/b] We say that a permutation $\sigma$ of the set $\{1, 2,..., n\}$ preserves divisibilty if $\sigma (a)$ divides $\sigma (b)$ whenever $a$ divides $b$. How many permutations of $\{1, 2,..., 40\}$ preserve divisibility? (A permutation of $\{1, 2,..., n\}$ is a function $\sigma$ from $\{1, 2,..., n\}$ to itself such that for any $b \in \{1, 2,..., n\}$, there exists some $a \in \{1, 2,..., n\}$ satisfying $\sigma (a) = b$.) [b]p11.[/b] In the diagram shown at right, how many ways are there to remove at least one edge so that some circle with an “A” and some circle with a “B” remain connected? [img]https://cdn.artofproblemsolving.com/attachments/8/7/fde209c63cc23f6d3482009cc6016c7cefc868.png[/img] [b]p12.[/b] Let $S$ be the set of the $125$ points in three-dimension space of the form $(x, y, z)$ where $x$, $y$, and $z$ are integers between $1$ and $5$, inclusive. A family of snakes lives at the point $(1, 1, 1)$, and one day they decide to move to the point $(5, 5, 5)$. Snakes may slither only in increments of $(1,0,0)$, $(0, 1, 0)$, and $(0, 0, 1)$. Given that at least one snake has slithered through each point of $S$ by the time the entire family has reached $(5, 5, 5)$, what is the smallest number of snakes that could be in the family? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all triples $(x, y, z)$ of positive integers such that \[x^2 + 4^y = 5^z. \] [i]Proposed by Li4 and ltf0501[/i]

Determine all pairs of prime numbers $(p, q)$ such that $p^2 + 5pq + 4q^2$ is a square of an integer.

The sequence of integers $(a_{n})_{n \ge 1}$ is defined by $a_{1}= 2$, $a_{n+1}= 2a_{n}^{2}-1$. Prove that for each positive integer n, $n$ and $a_{n}$ are coprime.

Let $m$ positive integers $a_1, \dots , a_m$ be given. Prove that there exist fewer than $2^m$ positive integers $b_1, \dots , b_n$ such that all sums of distinct $b_k$’s are distinct and all $a_i \ (i \leq m)$ occur among them.

Find unknown digits $a$ and $b$ such that number $\overline{a783b}$ is divisible with $56$

[b]p1.[/b] Three camps are located in the vertices of an equilateral triangle. The roads connecting camps are along the sides of the triangle. Captain America is inside the triangle and he needs to know the distances between camps. Being able to see the roads he has found that the sum of the shortest distances from his location to the roads is 50 miles. Can you help Captain America to evaluate the distances between the camps? [b]p2.[/b] $N$ regions are located in the plane, every pair of them have a non-empty overlap. Each region is a connected set, that means every two points inside the region can be connected by a curve all points of which belong to the region. Iron Man has one charge remaining to make a laser shot. Is it possible for him to make the shot that goes through all $N$ regions? [b]p3.[/b] Money in Wonderland comes in $\$5$ and $\$7$ bills. (a) What is the smallest amount of money you need to buy a slice of pizza that costs $\$1$ and get back your change in full? (The pizza man has plenty of $\$5$ and $\$7$ bills.) For example, having $\$7$ won't do since the pizza man can only give you $\$5$ back. (b) Vending machines in Wonderland accept only exact payment (do not give back change). List all positive integer numbers which CANNOT be used as prices in such vending machines. (That is, find the sums of money that cannot be paid by exact change.) [b]p4.[/b] (a) Put $5$ points on the plane so that each $3$ of them are vertices of an isosceles triangle (i.e., a triangle with two equal sides), and no three points lie on the same line. (b) Do the same with $6$ points. [b]p5.[/b] Numbers $1,2,3,…,100$ are randomly divided in two groups $50$ numbers in each. In the first group the numbers are written in increasing order and denoted $a_1,a_2, ..., a_{50}$. In the second group the numberss are written in decreasing order and denoted $b_1,b_2, ..., b_{50}$. Thus $a_1<a_2<...<a_{50}$ and $ b_1>b_2>...>b_{50}$. Evaluate $|a_1-b_1|+|a_2-b_2|+...+|a_{50}-b_{50}|$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ a_1$, $ a_2$, $ \ldots$, $ a_n$ be distinct positive integers, $ n\ge 3$. Prove that there exist distinct indices $ i$ and $ j$ such that $ a_i \plus{} a_j$ does not divide any of the numbers $ 3a_1$, $ 3a_2$, $ \ldots$, $ 3a_n$. [i]Proposed by Mohsen Jamaali, Iran[/i]

A sequence of integers $a_0, a_1 …$ is called [i]kawaii[/i] if $a_0 =0, a_1=1,$ and $$(a_{n+2}-3a_{n+1}+2a_n)(a_{n+2}-4a_{n+1}+3a_n)=0$$ for all integers $n \geq 0$. An integer is called [i]kawaii[/i] if it belongs to some kawaii sequence. Suppose that two consecutive integers $m$ and $m+1$ are both kawaii (not necessarily belonging to the same kawaii sequence). Prove that $m$ is divisible by $3,$ and that $m/3$ is also kawaii.

Solve in integers the system of equations: $$x^2-y^2=z$$ $$3xy+(x-y)z=z^2$$

For each positive integer $k$, let $S_k$ be the set of real numbers that can be expressed in the form \[\frac{1}{n_1}+\frac{1}{n_2}+\dots+\frac{1}{n_k},\] where $n_1,n_2\dots,n_k$ are positive integers. Prove that $S_k$ does not contain an infinite strictly increasing sequence.

For each positive integer $n$ write the sum $\sum_{i=}^{n}\frac{1}{i}=\frac{p_n}{q_n}$ with $\text{gcd}(p_n,q_n)=1$. Find all such $n$ such that $5\nmid q_n$.

Given $m\in\mathbb{N}$ and a prime number $p$, $p>m$, let \[M=\{n\in\mathbb{N}\mid m^2+n^2+p^2-2mn-2mp-2np \,\,\, \text{is a perfect square} \} \] Prove that $|M|$ does not depend on $p$. [i]Proposed by Aleksandar Ivanov[/i]

Find all sequences of positive integers $a_1,a_2,\dots$ such that $$(n^2+1)a_n = n(a_{n^2}+1)$$ for all positive integers $n$.

Let $ S $ be the set of positive integers which are not divisible by perfect squares greater than $ 1.$ Prove that for every $n\in\mathbb{N}$ the following equality is true $$\sum_{k\in S}\left[\sqrt{\frac{n}{k}}\right]=n,$$ where $[x]$ is the integer part of $x\in\mathbb{R}.$

What is the minimum number of digits to the right of the decimal point needed to express the fraction $\dfrac{123\,456\,789}{2^{26}\cdot 5^4}$ as a decimal? $\textbf{(A) }4\qquad\textbf{(B) }22\qquad\textbf{(C) }26\qquad\textbf{(D) }30\qquad\textbf{(E) }104$

Paul wrote the list of all four-digit numbers such that the hundreds digit is $5$ and the tens digit is $7$. For example, $1573$ and $7570$ are on Paul's list, but $2754$ and $571$ are not. Find the sum of all the numbers on Pablo's list. $Note$. The numbers on Pablo's list cannot start with zero.

With expressions containing the symbol $*$, the following transformations can be performed: 1) rewrite the expression in the form $x * (y * z) as ((1 * x) * y) * z$; 2) rewrite the expression in the form $x * 1$ as $x$. Conversions can only be performed with an integer expression, but not with its parts. For example, $(1 *1) * (1 *1)$ can be rewritten according to the first rule as $((1 * (1 * 1)) * 1) * 1$ (taking $x = 1 * 1$, $y = 1$ and $z = 1$), but not as $1 * (1 * 1)$ or $(1* 1) * 1$ (in the last two cases, the second rule would be applied separately to the left or right side $1 * 1$). Find all positive integers $n$ for which the expression $\underbrace{1 * (1 * (1 * (...* (1 * 1)...))}_{n units}$ it is possible to lead to a form in which there is not a single asterisk. Note. The expressions $(x * y) * $z and $x * (y * z)$ are considered different, also, in the general case, the expressions $x * y$ and $y * x$ are different.

Find all pairs of positive integers $(a,b)$ such that $\sqrt{a-1}+\sqrt{b-1}=\sqrt{ab-1}.$

A function $ f: \mathbb{N} \rightarrow \mathbb{N}$ satisfies: $ (a)$ $ f(ab)\equal{}f(a)f(b)$ whenever $ a$ and $ b$ are coprime; $ (b)$ $ f(p\plus{}q)\equal{}f(p)\plus{}f(q)$ for all prime numbers $ p$ and $ q$. Prove that $ f(2)\equal{}2,f(3)\equal{}3$ and $ f(1999)\equal{}1999.$

João calculated the product of the non zero digits of each integer from $1$ to $10^{2009}$ and then he summed these $10^{2009}$ products. Which number did he obtain?

Given distinct prime numbers $p$ and $q$ and a natural number $n \geq 3$, find all $a \in \mathbb{Z}$ such that the polynomial $f(x) = x^n + ax^{n-1} + pq$ can be factored into 2 integral polynomials of degree at least 1.