Find all pairs of integers $ \left(m,n\right) $ such that $ \left(m,n+1\right) = 1 $ and $$ \sum\limits_{k=1}^{n}{\frac{m^{k+1}}{k+1}\binom{n}{k}} \in \mathbb{N} $$

A positive integer $\ell \ge 2$ is called [i]sweet[/i] if there exists a positive integer $n \ge 10$ such that when the leftmost nonzero decimal digit of $n$ is deleted, the resulting number $m$ satisfies $n = m\ell.$ Let $S$ denote the set of all sweet numbers $\ell.$ If the sum $\sum_{\ell \in S} \tfrac{1}{\ell-1}$ can be written as $\tfrac{A}{B}$ for relatively prime positive integers $A,B,$ find $A+B.$

Find all pairs $(a,b)$ of positive integers such that $(ab)^2 - 4(a+b)$ is the square of an integer.

[u]Round 1[/u] [b]p1.[/b] Six pirates – Captain Jack and his five crewmen – sit in a circle to split a treasure of $99$ gold coins. Jack must decide how many coins to take for himself and how many to give each crewman (not necessarily the same number to each). The five crewmen will then vote on Jack's decision. Each is greedy and will vote “aye” only if he gets more coins than each of his two neighbors. If a majority vote “aye”, Jack's decision is accepted. Otherwise Jack is thrown overboard and gets nothing. What is the most coins Captain Jack can take for himself and survive? [b]p2[/b]. Rose and Bella take turns painting cells red and blue on an infinite piece of graph paper. On Rose's turn, she picks any blank cell and paints it red. Bella, on her turn, picks any blank cell and paints it blue. Bella wins if the paper has four blue cells arranged as corners of a square of any size with sides parallel to the grid lines. Rose goes first. Show that she cannot prevent Bella from winning. [img]https://cdn.artofproblemsolving.com/attachments/d/6/722eaebed21a01fe43bdd0dedd56ab3faef1b5.png[/img] [b]p3.[/b] A $25\times 25$ checkerboard is cut along the gridlines into some number of smaller square boards. Show that the total length of the cuts is divisible by $4$. For example, the cuts shown on the picture have total length $16$, which is divisible by $4$. [img]https://cdn.artofproblemsolving.com/attachments/c/1/e152130e48b804fe9db807ef4f5cd2cbad4947.png[/img] [b]p4.[/b] Each robot in the Martian Army is equipped with a battery that lasts some number of hours. For any two robots, one's battery lasts at least three times as long as the other's. A robot works until its battery is depleted, then recharges its battery until it is full, then goes back to work, and so on. A battery that lasts $N$ hours takes exactly $N$ hours to recharge. Prove that there will be a moment in time when all the robots are recharging (so you can invade the planet). [b]p5.[/b] A casino machine accepts tokens of $32$ different colors, one at a time. For each color, the player can choose between two fixed rewards. Each reward is up to $\$10$ cash, plus maybe another token. For example, a blue token always gives the player a choice of getting either $\$5$ plus a red token or $\$3$ plus a yellow token; a black token can always be exchanged either for $\$10$ (but no token) or for a brown token (but no cash). A player may keep playing as long as he has a token. Rob and Bob each have one white token. Rob watches Bob play and win $\$500$. Prove that Rob can win at least $\$1000$. [img]https://cdn.artofproblemsolving.com/attachments/6/6/e55614bae92233c9b2e7d66f5f425a18e6475a.png [/img] [u]Round 2[/u] [b]p6.[/b] The sum of $2015$ rational numbers is an integer. The product of every pair of them is also an integer. Prove that they are all integers. (A rational number is one that can be written as $m/n$, where $m$ and $n$ are integers and $n\ne 0$.) [b]p7.[/b] An $N \times N$ table is filled with integers such that numbers in cells that share a side differ by at most $1$. Prove that there is some number that appears in the table at least $N$ times. For example, in the $5 \times 5$ table below the numbers $1$ and $2$ appear at least $5$ times. [img]https://cdn.artofproblemsolving.com/attachments/3/8/fda513bcfbe6834d88fb8ca0bfcdb504d8b859.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all the prime numbers $p, q$ and $r$ such that $p^2 + 1 = 74 (q^2 + r^2)$.

Find all pairs of natural numbers $ (a, b)$ such that $ 7^a \minus{} 3^b$ divides $ a^4 \plus{} b^2$. [i]Author: Stephan Wagner, Austria[/i]

What is the smallest positive integer that is divisible by $225$ and that has ony the numbers one and zero as digits?

Show that, exist infinite triples $(a, b, c)$ where $a, b, c$ are natural numbers, such that: $2a^2 + 3b^2 - 5c^2 = 1997$

Positive integers $a$ and $b$ satisfy $a^3 + 32b + 2c = 2018$ and $b^3 + 32a + 2c = 1115$. Find $a^2 + b^2 + c^2$.

[b]p1.[/b] Find the smallest positive multiple of $9$ whose digits are all even. [b]p2.[/b] Anika writes down a positive real number $x$ in decimal form. When Nat erases everything to the left of the decimal point, the remaining value is one-fifth of x. Find the sum of all possible values of $x$. [b]p3.[/b] A star-like shape is formed by joining up the midpoints and vertices of a unit square, as shown in the diagram below. Compute the area of this shape. [img]https://cdn.artofproblemsolving.com/attachments/4/8/923b1bf26f6e9872b596e8c81ad1872137f362.png[/img] [b]p4.[/b] Benny and Daria are running a $200$ meter foot race, each at a different constant speed. When Daria finishes the race, she is $14$ meters ahead of Benny. The next time they race, Daria starts 14 meters behind Benny, who starts at the starting line. Both runners run at the same constant speed as in the first race. When Daria reaches the finish line, compute, in centimeters, how far she is ahead of Benny. [b]p5.[/b] In one semester, Ronald takes ten biology quizzes, earning a distinct integer score from $91$ to $100$ on each quiz. He notices that after the first three quizzes, the average of his three most recent scores always increased. Compute the number of ways Ronald could have earned the ten quiz scores. [b]p6.[/b] Ant and Ben are playing a game with stones. They begin with $Z$ stones on the ground. Ant and Ben take turns removing a prime number of stones. Ant moves first. The player who is first unable to make a valid move loses. Find the sum of all positive integers $Z \le 30$ such that Ben can guarantee a win with perfect play. [b]p7.[/b] Let $P$ be a point in a regular octagon as shown in the diagram below. The areas of three triangles are shown. Find the area of the octagon. [img]https://cdn.artofproblemsolving.com/attachments/0/9/6fde77eeafd04614046292175e4b1411158e85.png[/img] [b]p8.[/b] Find the number of ordered triples $(a, b, c)$ of nonnegative integers with $a \le b \le c$ for which $5a + 4b + 6c = 1200$. [b]p9.[/b] Define $$f(x) = \begin{cases} 2x \,\,\,\, ,\,\,\,\, 0 \le x < \frac12 \\ 2 - 2x \,\,\,\, , \,\,\,\, \frac12 \le x \le 1 \end{cases}$$ Michael picks a real number $0 \le x \le 1$. Michael applies $f$ repeatedly to $x$ until he reaches $x$ again. Find the number of real numbers $x$ for which Michael applies $f$ exactly $12$ times. [b]p10.[/b] In $\vartriangle ABC$, let point $H$ be the intersection of its altitudes and let $M$ be the midpoint of side $BC$. Given that $BC = 4$, $MA = 3$, and $\angle HMA = 60^o$, find the circumradius of $\vartriangle ABC$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $\mathbb{N}$ denote the set of natural numbers. Define a function $T:\mathbb{N}\rightarrow\mathbb{N}$ by $T(2k)=k$ and $T(2k+1)=2k+2$. We write $T^2(n)=T(T(n))$ and in general $T^k(n)=T^{k-1}(T(n))$ for any $k>1$. (i) Show that for each $n\in\mathbb{N}$, there exists $k$ such that $T^k(n)=1$. (ii) For $k\in\mathbb{N}$, let $c_k$ denote the number of elements in the set $\{n: T^k(n)=1\}$. Prove that $c_{k+2}=c_{k+1}+c_k$, for $k\ge 1$.

Let $s(n)$ be the sum of all positive divisors of $n$, so $s(6) = 12$. We say $n$ is almost perfect if $s(n) = 2n - 1$. Let $\mod(n, k)$ denote the residue of $n$ modulo $k$ (in other words, the remainder of dividing $n$ by $k$). Put $t(n) = \mod(n, 1) + \mod(n, 2) + \cdots + \mod(n, n)$. Show that $n$ is almost perfect if and only if $t(n) = t(n-1)$.

For all integers $n\ge 2$ with the following property: [list] [*] for each pair of positive divisors $k,~\ell <n$, at least one of the numbers $2k-\ell$ and $2\ell-k$ is a (not necessarily positive) divisor of $n$ as well.[/list]

Prove that if $ p$ is a prime number, then $ 7p+3^{p}-4$ is not a perfect square.

Let $ p$ be a prime number and $ k,n$ positive integers so that $ \gcd(p,n)\equal{}1$. Prove that $ \binom{n\cdot p^k}{p^k}$ and $ p$ are coprime.

Alison is eating $2401$ grains of rice for lunch. She eats the rice in a very peculiar manner: every step, if she has only one grain of rice remaining, she eats it. Otherwise, she nds the smallest positive integer $d > 1$ for which she can group the rice into equal groups of size $d$ with none left over. She then groups the rice into groups of size $d$, eats one grain from each group, and puts the rice back into a single pile. How many steps does it take her to finish all her rice?

Let $n$ be a positive integer. Prove that at least one of the integers $[2^n \cdot \sqrt2]$, $[2^{n+1} \cdot \sqrt2]$, $...$, $[2^{2n} \cdot \sqrt2]$ is even, where $[a]$ denotes the integer part of $a$.

Let $ S$ be the set of odd integers greater than $ 1$. For each $ x \in S$, denote by $ \delta (x)$ the unique integer satisfying the inequality $ 2^{\delta (x)}<x<2^{\delta (x) \plus{}1}$. For $ a,b \in S$, define: $ a \ast b\equal{}2^{\delta (a)\minus{}1} (b\minus{}3)\plus{}a.$ Prove that if $ a,b,c \in S$, then: $ (a)$ $ a \ast b \in S$ and $ (b)$ $ (a \ast b)\ast c\equal{}a \ast (b \ast c)$.

Find all positive integers $m, n$ satisfying $n!+2^{n-1}=2^m$.

Let $p = 2017$ be a prime and $\mathbb{F}_p$ be the integers modulo $p$. A function $f: \mathbb{Z}\rightarrow\mathbb{F}_p$ is called [i]good[/i] if there is $\alpha\in\mathbb{F}_p$ with $\alpha\not\equiv 0\pmod{p}$ such that \[f(x)f(y) = f(x + y) + \alpha^y f(x - y)\pmod{p}\] for all $x, y\in\mathbb{Z}$. How many good functions are there that are periodic with minimal period $2016$? [i]Ashwin Sah[/i]

Prove that for all primes $p$ true is equality $$\sum_{k=1}^{p-1}\left\lfloor\frac{k^3}{p}\right\rfloor=\frac{(p-2)(p-1)(p+1)}{4}$$

Heron is going to watch a show with $n$ episodes which are released one each day. Heron wants to watch the first and last episodes on the days they first air, and he doesn’t want to have two days in a row that he watches no episodes. He can watch as many episodes as he wants in a day. Denote by $f(n)$ the number of ways Heron can choose how many episodes he watches each day satisfying these constraints. Let $N$ be the $2021$st smallest value of $n$ where $f(n) \equiv 2$ mod $3$. Find $N$.

The sequence $\{a_n\}$ is defined by $a_0 = 1, a_1 = 2,$ and for $n \geq 2,$ $$a_n = a_{n-1}^2 + (a_0a_1 \dots a_{n-2})^2.$$ Let $k$ be a positive integer, and let $p$ be a prime factor of $a_k.$ Show that $p > 4(k-1).$

Write $2013$ as a sum of $m$ prime numbers. The smallest value of $m$ is: (A): $2$, (B): $3$, (C): $4$, (D): $1$, (E): None of the above.

[b] Problem 5. [/b]Denote with $d(a,b)$ the numbers of the divisors of natural $a$, which are greater or equal to $b$. Find all natural $n$, for which $d(3n+1,1)+d(3n+2,2)+\ldots+d(4n,n)=2006.$ [i]Ivan Landgev[/i]