There exists infinitely many positive integers such that $a^3 + 1990b^3 = c^4$.

[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].

Let $\phi(n)$ denote the number of positive integers less than or equal to $n$ that are coprime to $n$. Find the sum of all $1<n<100$ such that $\phi(n)\mid n$.

Let $u$ and $v$ be positive rational numbers with $u \ne v$. Assume that there are infinitely many positive integers $n$ with the property that $u^n - v^n$ are integers. Prove that $u$ and $v$ are integers.

Prove that the sum of the numbers $1,2,\ldots,n$ divides their product if and only if $n+1$ is a composite number.

A positive integer is called extra-even if all of its digits are even. Compute the number of positive integers $n$ less than or equal to $2022$ such that both $n$ and $2n$ are both extra-even.

Let $(x_{n}) \ n\geq 1$ be a sequence of real numbers with $x_{1}=1$ satisfying $2x_{n+1}=3x_{n}+\sqrt{5x_{n}^{2}-4}$ a) Prove that the sequence consists only of natural numbers. b) Check if there are terms of the sequence divisible by $2011$.

Let $ABC$ be a triangle. Let $D$ be the midpoint of $\overline{BC}$, let $E$ be the midpoint of $\overline{AD}$, and let $F$ be the midpoint of $\overline{BE}$. Let $G$ be the point where the lines $AB$ and $CF$ intersect. What is the value of $\frac{AG}{AB}$?

Compute the lowest positive integer $k$ such that none of the numbers in the sequence $$\{1, 1 +k, 1 + k + k^2 , 1 + k + k^2 + k^3, ... \}$$ are prime.

(a) Determine a natural number $n$ such that $n(n+2022)+2$ is a perfect square. [hide=Spoiler]In case you didn't realize, $n=1$ works lol[/hide] (b) Determine all natural numbers $a$ such that for every natural number $n$, the number $n(n+a)+2$ is never a perfect square.

Let $ a, b, c$ be three natural numbers such that $ a < b < c$ and $ gcd (c \minus{} a, c \minus{} b) \equal{} 1$. Suppose there exists an integer $ d$ such that $ a \plus{} d, b \plus{} d, c \plus{} d$ form the sides of a right-angled triangle. Prove that there exist integers, $ l,m$ such that $ c \plus{} d \equal{} l^{2} \plus{} m^{2} .$ [b][Weightage 17/100][/b]

The natural number $n$ is said to be good if there are natural numbers $a$ and $b$ that satisfy $a + b = n$ and $ab | n^2 + n + 1$. (a) Show that there are infinitely many good numbers. (b) Show that if $n$ is a good number, then $7 \nmid n$.

Find all primes $1 < p < 100$ such that the equation $x^2-6y^2=p$ has an integer solution $(x, y)$.

Prove that the following inequality holds with the exception of finitely many positive integers $n$: $\sum^{n}_{i=1}\sum^{n}_{j=1}gcd(i,j)>4n^2$.

Jorge writes a list with an even number of integers, not all equal to $0$ (there may be repeated numbers). Show that Martin can cross out a number from the list, of his choice, so that it is impossible for Jorge to separate the remaining numbers into two groups in such a way that the sum of all the numbers in one group is equal to the sum of all the others. numbers from the other group.

For integers $x$, $y$, and $z$, we have $(x-y)(y-z)(z-x)=x+y+z$. Prove that $27|x+y+z$.

Let $a_1,a_2,a_3,\cdots$ be the sequence of positive integers such that $$a_1=1 , a_{k+1}=a^3_k+1, $$ for all positive integers $k.$ Prove that for every prime number $p$ of the form $3l +2,$ where $l$ is a non-negative integer ,there exists a positive integer $n$ such that $a_n$ is divisible by $p.$

How many natural number $n$ less than $2015$ that is divisible by $\lfloor\sqrt[3]{n}\rfloor$ ?

Two players play a game as follows: there $n > 1$ rounds and $d \geq 1$ is fixed. In the first round A picks a positive integer $m_1$, then B picks a positive integer $n_1 \not = m_1$. In round $k$ (for $k = 2, \ldots , n$), A picks an integer $m_k$ such that $m_{k-1} < m_k \leq m_{k-1} + d$. Then B picks an integer $n_k$ such that $n_{k-1} < n_k \leq n_{k-1} + d$. A gets $\gcd(m_k,n_{k-1})$ points and B gets $\gcd(m_k,n_k)$ points. After $n$ rounds, A wins if he has at least as many points as B, otherwise he loses. For each $(n, d)$ which player has a winning strategy?

Let $ x,y$ be positive integers with $ y>3$ and $ x^2\plus{}y^4\equal{}2((x\minus{}6)^2\plus{}(y\plus{}1)^2).$ Prove that: $ x^2\plus{}y^4\equal{}1994.$

Find all positive integers $N$ that are perfect squares and their decimal representation consists of $n$ digits equal to 2 and one digit equal to 5, where $n$ takes positive integer values.

A $5$-digit number (in base $10$) has digits $k, k + 1, k + 2, 3k, k + 3$ in that order, from left to right. If this number is $m^2$ for some natural number $m$, find the sum of the digits of $m$.

[b]p1.[/b] What is $\sqrt[2015]{2^01^5}$? [b]p2.[/b] What is the ratio of the area of square $ABCD$ to the area of square $ACEF$? [b]p3.[/b] $2015$ in binary is $11111011111$, which is a palindrome. What is the last year which also had this property? [b]p4.[/b] What is the next number in the following geometric series: $1020100$, $10303010$, $104060401$? [b]p5.[/b] A circle has radius $A$ and area $r$. If $A = r^2\pi$, then what is the diameter, $C$, of the circle? [b]p6.[/b] If $$O + N + E = 1$$ $$T + H + R + E + E = 3$$ $$N + I + N + E = 9$$ $$T + E + N = 10$$ $$T + H + I + R + T + E + E + N = 13$$ Then what is the value of $O$? [b]p7.[/b] By shifting the initial digit, which is $6$, of the positive integer $N$ to the end (for example, $65$ becomes $56$), we obtain a number equal to $\frac{N}{4}$ . What is the smallest such $N$? [b]p8.[/b] What is $\sqrt[3]{\frac{2015!(2013!)+2014!(2012!)}{2013!(2012!)}}$ ? [b]p9.[/b] How many permutations of the digits of $1234$ are divisible by $11$? [b]p10.[/b] If you choose $4$ cards from a normal $52$ card deck (with replacement), what is the probability that you will get exactly one of each suit (there are $4$ suits)? [b]p11.[/b] If $LMT$ is an equilateral triangle, and $MATH$ is a square, such that point $A$ is in the triangle, then what is $HL/AL$? [b]p12.[/b] If $$\begin{tabular}{cccccccc} & & & & & L & H & S\\ + & & & & H & I & G & H \\ + & & S & C & H & O & O & L \\ \hline = & & S & O & C & O & O & L \\ \end{tabular}$$ and $\{M, A, T,H, S, L,O, G, I,C\} = \{0, 1, 2, 3,4, 5, 6, 7, 8, 9\} $, then what is the ordered pair $(M + A +T + H, [T + e + A +M])$ where $e$ is $2.718...$and $[n]$ is the greatest integer less than or equal to $n$ ? [b]p13.[/b] There are $5$ marbles in a bag. One is red, one is blue, one is green, one is yellow, and the last is white. There are $4$ people who take turns reaching into the bag and drawing out a marble without replacement. If the marble they draw out is green, they get to draw another marble out of the bag. What is the probability that the $3$rd person to draw a marble gets the white marble? [b]p14.[/b] Let a "palindromic product" be a product of numbers which is written the same when written back to front, including the multiplication signs. For example, $234 * 545 * 432$, $2 * 2 *2 *2$, and $14 * 41$ are palindromic products whereas $2 *14 * 4 * 12$, $567 * 567$, and $2* 2 * 3* 3 *2$ are not. 2015 can be written as a "palindromic product" in two ways, namely $13 * 5 * 31$ and $31 * 5 * 13$. How many ways can you write $2016$ as a palindromic product without using 1 as a factor? [b]p15.[/b] Let a sequence be defined as $S_n = S_{n-1} + 2S_{n-2}$, and $S_1 = 3$ and $S_2 = 4$. What is $\sum_{n=1}^{\infty}\frac{S_n}{3^n}$ ? [b]p16.[/b] Put the numbers $0-9$ in some order so that every $2$-digit substring creates a number which is either a multiple of $7$, or a power of $2$. [b]p17.[/b] Evaluate $\dfrac{8+ \dfrac{8+ \dfrac{8+...}{3+...}}{3+ \dfrac{8+...}{3+...}}}{3+\dfrac{8+ \dfrac{8+...}{3+...}}{ 3+ \dfrac{8+...}{3+...}}}$, assuming that it is a positive real number. [b]p18.[/b] $4$ non-overlapping triangles, each of area $A$, are placed in a unit circle. What is the maximum value of $A$? [b]p19.[/b] What is the sum of the reciprocals of all the (positive integer) factors of $120$ (including $1$ and $120$ itself). [b]p20.[/b] How many ways can you choose $3$ distinct elements of $\{1, 2, 3,...,4000\}$ to make an increasing arithmetic series? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

During the factoring class, Esmeralda observed that $1$, $3$ and $5$ can be written as the difference of two perfect squares, as can be seen: $1 = 1^2 - 0^2$ $3 = 2^2 - 1^2$ $5 = 3^2 - 2^2$ a) Show that all numbers written in the form $2 * m + 1$ can be written as a difference of two perfect squares. b) Show how to calculate the value of the expression $E = 1 + 3 + 5 + ... + (2m + 1)$. c) Esmeralda, happy with what she discovered, decided to look for other ways to write $2019$ as the difference of two perfect squares of positive integers. Determine how many ways it can do what you want.

Find the number of positive integer solutions $(a,b,c,d)$ to the equation \[(a^2+b^2)(c^2-d^2)=2020.\] Note: The solutions $(10,1,6,4)$ and $(1,10,6,4)$ are considered different.