Let $p=4k+1$ be a prime. $S$ is a set of all possible residues equal or smaller then $2k$ when $\frac{1}{2} \binom{2k}{k} n^k$ is divided by $p$. Show that \[ \sum_{x \in S} x^2 =p \]

[i]Round 5[/i] [b]p13.[/b] Kelvin Amphibian, a not-frog who lives on the coordinate plane, likes jumping around. Each step, he jumps either to the spot that is $1$ unit to the right and 2 units up, or the spot that is $2$ units to the right and $1$ unit up, from his current location. He chooses randomly among these two choices with equal probability. He starts at the origin and jumps for a long time. What is the probability that he lands on $(10, 8)$ at some time in his journey? [b]p14.[/b] Points $A, B, C$, and $D$ are randomly chosen on the circumference of a unit circle. What is the probability that line segments $AB$ and $CD$ intersect inside the circle? [b]p15.[/b] Let $P(x)$ be a quadratic polynomial with two consecutive integer roots. If it is also known that $\frac{P(2017)} {P(2016)} = \frac{2016}{2017}$ , find the larger root of $P(x)$. [u]Round 6[/u] [b]p16.[/b] Let $S_n$ be the sum of reciprocals of the integers between $1$ and $n$ inclusive. Find a triple $(a, b, c)$ of positive integers such that $S_{2017} \cdot S_{2017} - S_{2016} \cdot S_{2018} = \frac{S_a+S_b}{c}$ . [b]p17.[/b] Suppose that $m$ and $n$ are both positive integers. Alec has $m$ standard $6$-sided dice, each labelled $1$ to $6$ inclusive on the sides, while James has $n$ standard $12$-sided dice, each labelled $1$ to $12$ inclusive on the sides. They decide to play a game with their dice. They each toss all their dice simultaneously and then compute the sum of the numbers that come up on their dice. Whoever has a higher sum wins (if the sums are equal, they tie). Given that both players have an equal chance of winning, determine the minimum possible value of mn. [b]p18.[/b] Overlapping rectangles $ABCD$ and $BEDF$ are congruent to each other and both have area $1$. Given that $A,C,E, F$ are the vertices of a square, find the area of the square. [u]Round 7[/u] [b]p19.[/b] Find the number of solutions to the equation $$||| ... |||||x| + 1| - 2| + 3| - 4| +... - 98| + 99| - 100| = 0$$ [b]p20.[/b] A split of a positive integer in base $10$ is the separation of the integer into two nonnegative integers, allowing leading zeroes. For example, $2017$ can be split into $2$ and $017$ (or $17$), $20$ and $17$, or $201$ and $7$. A split is called squarish if both integers are nonzero perfect squares. $49$ and $169$ are the two smallest perfect squares that have a squarish split ($4$ and $9$, $16$ and $9$ respectively). Determine all other perfect squares less than $2017$ with at least one squarish split. [b]p21.[/b] Polynomial $f(x) = 2x^3 + 7x^2 - 3x + 5$ has zeroes $a, b$ and $c$. Cubic polynomial $g(x)$ with $x^3$-coefficient $1$ has zeroes $a^2$, $b^2$ and $c2$. Find the sum of coefficients of $g(x)$. [u]Round 8[/u] [b]p22.[/b] Two congruent circles, $\omega_1$ and $\omega_2$, intersect at points $A$ and $B$. The centers of $\omega_1$ and $\omega_2$ are $O_1$ and $O_2$ respectively. The arc $AB$ of $\omega_1$ that lies inside $\omega_2$ is trisected by points $P$ and $Q$, with the points lying in the order $A, P, Q,B$. Similarly, the arc $AB$ of $\omega_2$ that lies inside $\omega_1$ is trisected by points $R$ and $S$, with the points lying in the order $A,R, S,B$. Given that $PQ = 1$ and $PR =\sqrt2$, find the measure of $\angle AO_1B$ in degrees. [b]p23.[/b] How many ordered triples of $(a, b, c)$ of integers between $-10$ and $10$ inclusive satisfy the equation $-abc = (a + b)(b + c)(c + a)$? [b]p24.[/b] For positive integers $n$ and $b$ where $b > 1$, define $s_b(n)$ as the sum of digits in the base-$b$ representation of $n$. A positive integer $p$ is said to dominate another positive integer $q$ if for all positive integers $n$, $s_p(n)$ is greater than or equal to $s_q(n)$. Find the number of ordered pairs $(p, q)$ of distinct positive integers between $2$ and $100$ inclusive such that $p$ dominates $q$. PS. You should use hide for answers. Rounds 1-5 have been posted [url=https://artofproblemsolving.com/community/c3h2936487p26278546]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]numbers $n^2+1$[/b] Prove that there are infinitely many natural numbers of the form $n^2+1$ such that they don't have any divisor of the form $k^2+1$ except $1$ and themselves. time allowed for this question was 45 minutes.

On the market one seller is selling watermelons, melons and young corn cobs. Total number of watermelons, melons and corn cobs is $239$. One buyer bought $\frac{2}{3}$ of all watermelons, $\frac{3}{5}$ of all melons and $\frac{5}{7}$ of all corn cobs. Other buyer bought $\frac{1}{13}$ of all watermelons, $\frac{1}{4}$ of all melons and $\frac{1}{5}$ of all corn cobs. How many pieces in total bought second buyer and how many seller had at the beggining of each watermelons, melons and corn cobs?

The [i]popularity [/i] of a positive integer $n$ is the number of positive integer divisors of $n$. For example, $1$ has popularity $1$, and $12$ has popularity $6$. For each number $n$ between $1$ and $30$ inclusive, Cathy writes the number $n$ on $k$ pieces of paper, where $k$ is the popularity of $n$. Cathy then picks a piece of paper at random. Compute the probability that she will pick an even integer.

Let $P(x)$ be a polynomial with integer coefficients. We will denote the set of all prime numbers by $\mathbb P$. Show that the set $\mathbb S := \{p\in\mathbb P : \exists\text{ }n \text{ s.t. }p\mid P(n)\}$ is finite if and only if $P(x)$ is a non-zero constant polynomial.

Let $n$ be the number of isosceles triangles whose vertices are also the vertices of a regular 2019-gon. Then the remainder when $n$ is divided by 100 [list=1] [*] 15 [*] 25 [*] 35 [*] 65 [/list]

Let $ A$, $ M$, and $ C$ be digits with \[ (100A \plus{} 10M \plus{} C )(A \plus{} M \plus{} C ) \equal{} 2005. \]What is $ A$? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

Specified natural number $a$. Prove that there are an infinite number of prime numbers $p$ such that for some natural $n$ the number $2^{2^n} + a$ is divisible by $p$.

Given $m, n$ such that $m > n^{n-1}$ and the number $m+1$, $m+2$,$ ...$, $m+n$ are composite. Prove that there exist distinct primes $p_1, p_2, ..., p_n$ such that $m + k$ is divisible by $p_k$ for each $k = 1, 2, ...$

Show that for no integers $a \geq 1, n \geq 1$ is the sum \[1+\frac{1}{1+a}+\frac{1}{1+2a}+\cdots+\frac{1}{1+na}\] an integer.

Determine all squarefree positive integers $n\geq 2$ such that \[\frac{1}{d_1}+\frac{1}{d_2}+\cdots+\frac{1}{d_k}\]is a positive integer, where $d_1,d_2,\ldots,d_k$ are all the positive divisors of $n$.

(a) Let $k$ be an natural number so that the equation $ab + (a + 1) (b + 1) = 2^k$ does not have a positive integer solution $(a, b)$. Show that $k + 1$ is a prime number. (b) Show that there are natural numbers $k$ so that $k + 1$ is prime numbers and equation $ab + (a + 1) (b + 1) = 2^k$ has a positive integer solution $(a, b)$.

Let $k$ be a positive integer. A natural number $m$ is called [i]$k$-typical[/i] if each divisor of $m$ leaves the remainder $1$ when being divided by $k$. Prove: [b]a)[/b] If the number of all divisors of a positive integer $n$ (including the divisors $1$ and $n$) is $k$-typical, then $n$ is the $k$-th power of an integer. [b]b)[/b] If $k > 2$, then the converse of the assertion [b]a)[/b] is not true.

Let $k>1$ be an integer, set $n=2^{k+1}$. Prove that for any positive integers $a_1<a_2<\cdots<a_n$, the number $\prod_{1\leq i<j\leq n}(a_i+a_j)$ has at least $k+1$ different prime divisors.

Find all pairs $(x,y)$ of positive integers that satisfy $$2^x+17=y^4$$.

Find an arithmetic progression of $2016$ natural numbers such that neither is a perfect power but its multiplication is a perfect power. Clarification: A perfect power is a number of the form $n^k$ where $n$ and $k$ are both natural numbers greater than or equal to $2$.

We call a positive integer [i]interesting [/i] if the number and the number with its digits written in reverse order both leave remainder $2$ in division by $4$. a) Determine if $2018$ is an interesting number. b) For every positive integer $n$, find how many interesting $n$-digit numbers there are.

[b]p1.[/b] The length of the side $AB$ of the trapezoid with bases $AD$ and $BC$ is equal to the sum of lengths $|AD|+|BC|$. Prove that bisectors of angles $A$ and $B$ do intersect at a point of the side $CD$. [b]p2.[/b] Polynomials $P(x) = x^4 + ax^3 + bx^2 + cx + 1$ and $Q(x) = x^4 + cx^3 + bx^2 + ax + 1$ have two common roots. Find these common roots of both polynomials. [b]p3.[/b] A girl has a box with $1000$ candies. Outside the box there is an infinite number of chocolates and muffins. A girl may replace: $\bullet$ two candies in the box with one chocolate bar, $\bullet$ two muffins in the box with one chocolate bar, $\bullet$ two chocolate bars in the box with one candy and one muffin, $\bullet$ one candy and one chocolate bar in the box with one muffin, $\bullet$ one muffin and one chocolate bar in the box with one candy. Is it possible that after some time it remains only one object in the box? [b]p4.[/b] There are $9$ straight lines drawn in the plane. Some of them are parallel some of them intersect each other. No three lines do intersect at one point. Is it possible to have exactly $17$ intersection points? [b]p5.[/b] It is known that $x$ is a real number such that $x+\frac{1}{x}$ is an integer. Prove that $x^n+\frac{1}{x^n}$ is an integer for any positive integer $n$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For every integer $n$ not equal to $1$ or $-1$, define $S(n)$ as the smallest integer greater than $1$ that divides $n$. In particular, $S(0)=2$. We also define $S(1) = S(-1) = 1$. Let $f$ be a non-constant polynomial with integer coefficients such that $S(f(n)) \leq S(n)$ for every positive integer $n$. Prove that $f(0)=0$. [b]Note:[/b] A non-constant polynomial with integer coefficients is a function of the form $f(x) = a_0 + a_1 x + a_2 x^2 + \ldots + a_k x^k$, where $k$ is a positive integer and $a_0,a_1,\ldots,a_k$ are integers such that $a_k \neq 0$. [i]Pitchayut Saengrungkongka, Thailand[/i]

Let $r_k$ denote the remainder when ${127 \choose k}$ is divided by $8$. Compute$ r_1 + 2r_2 + 3r_3 + · · · + 63r_{63}.$

Let $\left< F_n\right>$ be the Fibonacci sequence, that is, $F_0=0$, $F_1=1$, and $F_{n+2}=F_{n+1}+F_{n}$ holds for all nonnegative integers $n$. Find all pairs $(a,b)$ of positive integers with $a < b$ such that $F_n-2na^n$ is divisible by $b$ for all positive integers $n$.

Find all functions $f:\mathbb{Z}_{>0}\rightarrow\mathbb{Z}_{>0}$ that satisfy the following two conditions: [list]$\bullet\ f(n)$ is a perfect square for all $n\in\mathbb{Z}_{>0}$ $\bullet\ f(m+n)=f(m)+f(n)+2mn$ for all $m,n\in\mathbb{Z}_{>0}$.[/list]

The numbers from 1 to $ 2013^2 $ are written row by row into a table consisting of $ 2013 \times 2013 $ cells. Afterwards, all columns and all rows containing at least one of the perfect squares $ 1, 4, 9, \cdots, 2013^2 $ are simultaneously deleted. How many cells remain?

Let $n \ge 2$ be an integer. Show that there exist $n+1$ numbers $x_1, x_2, \ldots, x_{n+1} \in \mathbb{Q} \setminus \mathbb{Z}$, so that $\{ x_1^3 \} + \{ x_2^3 \} + \cdots + \{ x_n^3 \}=\{ x_{n+1}^3 \}$, where $\{ x \}$ is the fractionary part of $x$.