The polynomial \[P(x)=(1+x+x^2+\cdots+x^{17})^2-x^{17}\] has 34 complex roots of the form $z_k=r_k[\cos(2\pi a_k)+i\sin(2\pi a_k)], k=1, 2, 3,\ldots, 34$, with $0<a_1\le a_2\le a_3\le\cdots\le a_{34}<1$ and $r_k>0$. Given that $a_1+a_2+a_3+a_4+a_5=m/n$, where $m$ and $n$ are relatively prime positive integers, find $m+n$.

Of all the fractions $\frac{x}{y}$ that satisfy $$\frac{41}{2010}<\frac{x}{y}<\frac{1}{49}$$ find the one with the smallest denominator.

Let $a$ be a positive integer. We say that a positive integer $b$ is [i]$a$-good[/i] if $\tbinom{an}{b}-1$ is divisible by $an+1$ for all positive integers $n$ with $an \geq b$. Suppose $b$ is a positive integer such that $b$ is $a$-good, but $b+2$ is not $a$-good. Prove that $b+1$ is prime.

Find all positive integers $n$ such that there exists a sequence of positive integers $a_1$, $a_2$,$\ldots$, $a_n$ satisfying: \[a_{k+1}=\frac{a_k^2+1}{a_{k-1}+1}-1\] for every $k$ with $2\leq k\leq n-1$. [i]Proposed by North Korea[/i]

Find the least number which is divisible by 2009 and its sum of digits is 2009.

A sequence of positive integers $(a_n)_{n \ge 1}$ is of [i]Fibonacci type[/i] if it satisfies the recursive relation $a_{n + 2} = a_{n + 1} + a_n$ for all $n \ge 1$. Is it possible to partition the set of positive integers into an infinite number of Fibonacci type sequences? [i]Proposed by Ivan Borsenco[/i]

For a given positive integer $ k$ denote the square of the sum of its digits by $ f_1(k)$ and let $ f_{n\plus{}1}(k) \equal{} f_1(f_n(k)).$ Determine the value of $ f_{1991}(2^{1990}).$

A fair 100-sided die is rolled twice, giving the numbers $a$ and $b$ in that order. If the probability that $a^2-4b$ is a perfect square is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers, compute $100m+n$. [i] Proposed by Justin Stevens [/i]

Find the least a. positive real number b. positive integer $t$ such that the equation $(x^2+y^2)^2 + 2tx(x^2 + y^2) = t^2y^2$ has a solution where $x,y$ are positive integers.

A blackboard contains $2018$ instances of the digit $1$ separated by spaces. Georg and his mother play a game where they take turns filling in one of the spaces between the digits with either a $+$ or a $\times$. Georg begins, and the game ends when all spaces have been filled. Georg wins if the value of the expression is even, and his mother wins if it is odd. Which player may prepare a strategy which secures him/her victory?

Determine the last two digits of the number $2^5 + 2^{5^{2}} + 2^{5^{3}} +... + 2^{5^{1991}}$ , written in decimal notation.

For any integer $d > 0,$ let $f(d)$ be the smallest possible integer that has exactly $d$ positive divisors (so for example we have $f(1)=1, f(5)=16,$ and $f(6)=12$). Prove that for every integer $k \geq 0$ the number $f\left(2^k\right)$ divides $f\left(2^{k+1}\right).$ [i]Proposed by Suhaimi Ramly, Malaysia[/i]

Find all pairs of prime numbers $(p,q)$ for which \[2^p = 2^{q-2} + q!.\]

Prove that for every prime number $p$ and positive integer $a$, there exists a natural number $n$ such that $p^n$ contains $a$ consecutive equal digits.

Let $S$ be the set of all positive integers less than $10,000$ whose last four digits in base $2$ are the same as its last four digits in base $5$. What remainder do we get if we divide the sum of all elements of $S$ by $10000$?

Fifteen pairwise coprime positive integers chosen so that each of them less than 2010. Show that at least one of them is prime.

We consider all partitions of a positive integer n into a sum of (nonnegative integer) exponents of $2$ (i.e. $1$, $2$, $4$, $8$ , $ . . .$ ). A number in the sum is allowed to repeat an arbitrary number of times (e.g. $7 = 2 + 2 + 1 + 1 + 1$) and two partitions differing only in the order of summands are considered to be equal (e.g. $8 = 4 + 2 + 1 + 1$ and $8 = 1 + 2 + 1 + 4$ are regarded to be the same partition). Let $E(n)$ be the number of partitions in which an even number of exponents appear an odd number of times and $O(n)$ the number of partitions in which an odd number of exponents appear an odd number of times. For example, for $n = 5$ partitions counted in $E(n)$ are $5 = 4 + 1$ and $5 = 2 + 1 + 1 + 1$, whereas partitions counted in O(n) are $5 = 2 + 2 + 1$ and $5 = 1 + 1 + 1 + 1 + 1$, hence $E(5) = O(5) = 2$. Find $E(n) - O(n)$ as a function of $n$.

Let $m,n$ be positive integers and $p$ be a prime number. Show that if $\frac{7^m + p \cdot 2^n}{7^m - p \cdot 2^n}$ is an integer, then it is a prime number.

Solve the following equation in real numbers: $\frac{(x^2-1)(|x|+1)}{x+sgnx}=[x+1].$

Find the least positive integer that cannot be represented as $\frac{2^a-2^b}{2^c-2^d}$ for some positive integers $a, b, c, d$.

[b]p1.[/b] Let $ABCD$ be a square with side length $1$, $\Gamma_1$ be a circle centered at $B$ with radius 1, $\Gamma_2$ be a circle centered at $D$ with radius $1$, $E$ be a point on the segment $AB$ with $|AE| = x$ $(0 < x \le 1)$, and $\Gamma_3$ be a circle centered at $A$ with radius $|AE|$. $\Gamma_3$ intersects $\Gamma_1$ and $\Gamma_2$ inside the square at $G$ and $F$, respectively. Let region $I$ be the region bounded by the segment $GC$ and the minor arc $GC$ of $\Gamma_1$, and region II be the region bounded by the segment $FG$ and the minor arc $FG$ of $\Gamma_3$, as illustrated in the graph below. Let $r(x)$ be the ratio of the area of region I to the area of region II. (i) Find $r(1)$. Justify your answer. (ii) Find an explicit formula of $r(x)$ in terms of $x$ $(0 < x \le 1)$. Justify your answer. [img]https://cdn.artofproblemsolving.com/attachments/e/0/bd2379a1390a578d78dc7e9f4cde756d5f4723.png[/img] [b]p2.[/b] We call a [i]party [/i] any set of people $V$ . If $v_1 \in V$ knows $v_2 \in V$ in a party, we always assume that $v_2$ also knows $v_1$. For a person $v \in V$ in some party, the degree of v, denoted by $deg\,\,(v)$, is the number of people $v$ knows in the party. (i) Suppose that a party has four people with $V = \{v_1, v_2, v_3, v_4\}$, and that $deg\,\,(v_i) = i$ for $i = 1, 2, 3$ show that $deg\,\,(v_4) = 2$. (ii) Suppose that a party is attended by $n = 4k$ ($k \ge 1$) people with $V = \{v_1, v_2, ..., v_{4k}\}$, and that $deg\,\,(v_i) = i$ for $1 \le i \le n - 1$. Show that $deg\,\,(v_n) = \frac{n}{2}$ . [b]p3.[/b] Let $a, b$ be two real number parameters and consider the function $f(x) =\frac{b + \sin x}{a + \cos x}$. (i) Find an example of $(a, b)$ such that $f(x) \ge 2$ for all real numbers $x$. Justify your answer. (ii) If $a > 1$ and the range of the function $f(x)$ (when x varies over the set of all real numbers) is $[-1, 1]$, find the values of $a$ and $b$. Justify your answer. [b]p4.[/b] Let $f$ be the function that assigns to each positive multiple $x$ of $8$ the number of ways in which $x$ can be written as a difference of squares of positive odd integers. (For example, $f(8) = 1$, because $8 = 3^2 -1^2$, and $f(24) = 2$, because $24 = 5^2 - 1^2 = 7^2 - 5^2$.) (a) Determine with proof the value of $f(120)$. (b) Determine with proof the smallest value $x$ for which $f(x) = 8$. (c) Show that the range of this function is the set of all positive integers. [b]p5.[/b] Consider the binomial coefficients $C_{n,r} ={n \choose r}= \frac{n!}{r!(n - r)!}$, for $n \ge 2$. Prove that $C_{n,r}$ are even, for all $1 \le r \le n - 1$, if and only if $n = 2^m$, for some counting number $m$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all integers satisfying the equation $ 2^x\cdot(4\minus{}x)\equal{}2x\plus{}4$.

Call a pair of integers $a$ and $b$ square makers , if $ab+1$ is a perfect square. Determine for which $n$ is it possible to divide the set $\{1,2, \dots , 2n\}$ into $n$ pairs of square makers.

Let $P(x)$ be a polynomial with integer coefficients that has at least one rational root. Let $n$ be a positive integer. Alan and Allan are playing a game. First, Alan writes down $n$ integers at $n$ different locations on a board. Then Allan may make moves of the following kind: choose a position that has integer $a$ written, then choose a different position that has integer $b$ written, then at the first position erase $a$ and in its place write $a+P(b)$. After any nonnegative number of moves, Allan may choose to end the game. Once Allan ends the game, his score is the number of times the mode (most common element) of the integers on the board appears. Find, in terms of $P(x)$ and $n$, the maximum score Allan can guarantee. [i]Henrick Rabinovitz[/i]

What is the greatest number of integers that can be selected from a set of $2015$ consecutive numbers so that no sum of any two selected numbers is divisible by their difference?