Given a positive integer $k$ show that there exists a prime $p$ such that one can choose distinct integers $a_1,a_2\cdots, a_{k+3} \in \{1, 2, \cdots ,p-1\}$ such that p divides $a_ia_{i+1}a_{i+2}a_{i+3}-i$ for all $i= 1, 2, \cdots, k$. [i]South Africa [/i]

Prove that for any positive integer $M$ there exists an integer divisible by $M$ such that the sum of its digits (in its decimal representation) is odd. (D Fomin, St Petersburg)

Let $c \ge 1$ be an integer. Define a sequence of positive integers by $a_1 = c$ and \[a_{n+1}=a_n^3-4c\cdot a_n^2+5c^2\cdot a_n+c\] for all $n\ge 1$. Prove that for each integer $n \ge 2$ there exists a prime number $p$ dividing $a_n$ but none of the numbers $a_1 , \ldots , a_{n -1}$ . [i]Proposed by Austria[/i]

Find all pairs $(a, b)$ of positive integers that satisfy the equation $a^2 -3 \cdot 2^b = 1$.

For any positive integer $m$, denote by $d_i(m)$ the number of positive divisors of $m$ that are congruent to $i$ modulo $2$. Prove that if $n$ is a positive integer, then \[\left|\sum_{k=1}^n \left(d_0(k)-d_1(k)\right)\right|\le n.\]

Find the number of ways to write the number $2013$ as the sum of two integers greater than or equal to zero so that when adding there is no carry over. Clarification: In the sum $2008+5=2013$ there is carry over from the units to the tens

Given the following list of numbers: $$1990, 1991, 1992, ..., 2002, 2003, 2003, 2003, ..., 2003$$ where the number $2003$ appears $12$ times. Is it possible to write these numbers in some order so that the $100$-digit number that we get is prime?

Let $A = \{1,...,n\}$ with $n \textgreater 5$. Prove that one can find $B$ a finite set of positive integers such that $A$ is a subset of $B$ and $\displaystyle\sum_{x \in B} x^2 = \displaystyle\prod_{x \in B} x$

Given integers $a_1, \ldots, a_{10},$ prove that there exist a non-zero sequence $\{x_1, \ldots, x_{10}\}$ such that all $x_i$ belong to $\{-1,0,1\}$ and the number $\sum^{10}_{i=1} x_i \cdot a_i$ is divisible by 1001.

Let $(a_n)_{n\ge 1}$ be a sequence of positive integers defined as $a_1,a_2>0$ and $a_{n+1}$ is the least prime divisor of $a_{n-1}+a_{n}$, for all $n\ge 2$. Prove that a real number $x$ whose decimals are digits of the numbers $a_1,a_2,\ldots a_n,\ldots $ written in order, is a rational number. [i]Laurentiu Panaitopol[/i]

Equilateral triangle $ T$ is inscribed in circle $ A$, which has radius $ 10$. Circle $ B$ with radius $ 3$ is internally tangent to circle $ A$ at one vertex of $ T$. Circles $ C$ and $ D$, both with radius $ 2$, are internally tangent to circle $ A$ at the other two vertices of $ T$. Circles $ B$, $ C$, and $ D$ are all externally tangent to circle $ E$, which has radius $ \frac {m}{n}$, where $ m$ and $ n$ are relatively prime positive integers. Find $ m \plus{} n$. [asy]unitsize(2.2mm); defaultpen(linewidth(.8pt)+fontsize(8pt)); dotfactor=4; pair A=(0,0), D=8*dir(330), C=8*dir(210), B=7*dir(90); pair Ep=(0,4-27/5); pair[] dotted={A,B,C,D,Ep}; draw(Circle(A,10)); draw(Circle(B,3)); draw(Circle(C,2)); draw(Circle(D,2)); draw(Circle(Ep,27/5)); dot(dotted); label("$E$",Ep,E); label("$A$",A,W); label("$B$",B,W); label("$C$",C,W); label("$D$",D,E);[/asy]

Let $a{}$ and $b{}$ be positive integers, whose difference is a prime number. Prove that $(a^n+a+1)(b^n+b+1)$ is not a perfect square for infinitely many positive integers $n{}$. [i]Proposed by Vlad Matei[/i]

a) Do there exist positive integers $a$ and $d$ such that $[a, a+d] = [a, a+2d]$? b) Do there exist positive integers $a$ and $d$ such that $[a, a+d] = [a, a+4d]$? Here $[a, b]$ denotes the least common multiple of integers $a, b$.

Find all pairs of coprime natural numbers $a$ and $b$ such that the fraction $\frac{a}{b}$ is written in the decimal system as $b.a.$

p1. Given the set $H = \{(x, y)|(x -y)^2 + x^2 - 15x + 50 = 0$ where x and y are natural numbers $\}$. Find the number of subsets of $H$. p2. A magician claims to be an expert at guessing minds with following show. One of the viewers was initially asked to hidden write a five-digit number, then subtract it with the sum of the digits that make up the number, then name four of the five digits that make up the resulting number (in order of any). Then the magician can guess the numbers hidden. For example, if the audience mentions four numbers result: $0, 1, 2, 3$, then the magician will know that the hidden number is $3$. a. Give an example of your own from the above process. b. Explain mathematically the general form of the process. p3. In a fruit basket there are $20$ apples, $18$ oranges, $16$ mangoes, $10$ pineapples and $6$ papayas. If someone wants to take $10$ pieces from the basket. After that, how many possible compositions of fruit are drawn? p4. Inside the Equator Park, a pyramid-shaped building will be made with base of an equilateral triangle made of translucent material with a side length of the base $8\sqrt3$ m long and $8$ m high. A globe will be placed in a pyramid the. Ignoring the thickness of the pyramidal material, determine the greatest possible length of the radius of the globe that can be made. p5. What is the remainder of $2012^{2012} + 2014^{2012}$ divided by $2013^2$?

Let $0 < a_1 < a_2 <... < a_{16} < 122$ be $16$ integers. Prove that there exist integers $(p, q, r, s)$, with $1 \le p < r \le s < q \le 16$, such that $a_p + a_q = a_r + a_s$. An additional $2$ points will be awarded for this problem, if you can find a larger bound than $122$ (with proof).

[b][b]p1.[/b][/b] Find the perimeter of a regular hexagon with apothem $3$. [b]p2.[/b] Concentric circles of radius $1$ and r are drawn on a circular dartboard of radius $5$. The probability that a randomly thrown dart lands between the two circles is $0.12$. Find $r$. [b]p3.[/b] Find all ordered pairs of integers $(x, y)$ with $0 \le x \le 100$, $0 \le y \le 100$ satisfying $$xy = (x - 22) (y + 15) .$$ [b]p4.[/b] Points $A_1$,$A_2$,$...$,$A_{12}$ are evenly spaced around a circle of radius $1$, but not necessarily in order. Given that chords $A_1A_2$, $A_3A_4$, and $A_5A_6$ have length $2$ and chords $A_7A_8$ and $A_9A_{10}$ have length $2 sin (\pi / 12)$, find all possible lengths for chord $A_{11}A_{12}$. [b]p5.[/b] Let $a$ be the number of digits of $2^{1998}$, and let $b$ be the number of digits in $5^{1998}$. Find $a + b$. [b]p6.[/b] Find the volume of the solid in $R^3$ defined by the equations $$x^2 + y^2 \le 2$$ $$x + y + |z| \le 3.$$ [b]p7.[/b] Positive integer $n$ is such that $3n$ has $28$ positive divisors and $4n$ has $36$ positive divisors. Find the number of positive divisors of $n$. [b]p8.[/b] Define functions $f$ and $g$ by $f (x) = x +\sqrt{x}$ and $g (x) = x + 1/4$. Compute $$g(f(g(f(g(f(g(f(3)))))))).$$ (Your answer must be in the form $a + b \sqrt{ c}$ where $a$, $b$, and $c$ are rational.) [b]p9.[/b] Sequence $(a_1, a_2,...)$ is defined recursively by $a_1 = 0$, $a_2 = 100$, and $a_n = 2a_{n-1}-a_{n-2}-3$. Find the greatest term in the sequence $(a_1, a_2,...)$. [b]p10.[/b] Points $X = (3/5, 0)$ and $Y = (0, 4/5)$ are located on a Cartesian coordinate system. Consider all line segments which (like $\overline{XY}$ ) are of length 1 and have one endpoint on each axis. Find the coordinates of the unique point $P$ on $\overline{XY}$ such that none of these line segments (except $\overline{XY}$ itself) pass through $P$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] There are $2000$ cans of paint. Show that at least one of the following two statements must be true. There are at least $45$ cans of the same color. There are at least $45$ cans all of different colors. [b]p2.[/b] The measures of the $3$ angles of one triangle are all different from each other but are the same as the measures of the $3$ angles of a second triangle. The lengths of $2$ sides of the first triangle are different from each other but are the same as the lengths of $2$ sides of the second triangle. Must the length of the remaining side of the first triangle be the same as the length of the remaining side of the second triangle? If yes, prove it. If not, provide an example. [b]p3.[/b] Consider the sequence $a_1=1$, $a_2=2$, $a_3=5/2$, ... satisfying $a_{n+1}=a_n+(a_n)^{-1}$ for $n>1$. Show that $a_{10000}>141$. [b]p4.[/b] Prove that no matter how $250$ points are placed in a disk of radius $1$, there is a disk of radius $1/10$ that contains at least $3$ of the points. [b]p5.[/b] Prove that: Given any $11$ integers (not necessarily distinct), one can select $6$ of them so that their sum is divisible by $6$. Given any $71$ integers (not necessarily distinct), one can select $36$ of them so that their sum is divisible by $36$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Consider and odd prime $p$. For each $i$ at $\{1, 2,..., p-1\}$, let $r_i$ be the rest of $i^p$ when it is divided by $p^2$. Find the sum: $r_1 + r_2 + ... + r_{p-1}$

Consider the set \[A = \left\{1+\frac{1}{k} : k=1,2,3,4,\cdots \right\}.\] [list=a] [*]Prove that every integer $x \geq 2$ can be written as the product of one or more elements of $A$, which are not necessarily different. [*]For every integer $x \geq 2$ let $f(x)$ denote the minimum integer such that $x$ can be written as the product of $f(x)$ elements of $A$, which are not necessarily different. Prove that there exist infinitely many pairs $(x,y)$ of integers with $x\geq 2$, $y \geq 2$, and \[f(xy)<f(x)+f(y).\] (Pairs $(x_1,y_1)$ and $(x_2,y_2)$ are different if $x_1 \neq x_2$ or $y_1 \neq y_2$). [/list]

Let $P_1$, $P_2$, $\ldots$, $P_{1993} = P_0$ be distinct points in the $xy$-plane with the following properties: (i) both coordinates of $P_i$ are integers, for $i = 1, 2, \ldots, 1993$; (ii) there is no point other than $P_i$ and $P_{i+1}$ on the line segment joining $P_i$ with $P_{i+1}$ whose coordinates are both integers, for $i = 0, 1, \ldots, 1992$. Prove that for some $i$, $0 \leq i \leq 1992$, there exists a point $Q$ with coordinates $(q_x, q_y)$ on the line segment joining $P_i$ with $P_{i+1}$ such that both $2q_x$ and $2q_y$ are odd integers.

Let $a_1,a_2,...,a_n$ be integers such that $a_1^{20}+a_2^{20}+...+a_n^{20}$ is divisible by $2020$. Show that $a_1^{2020}+a_2^{2020}+...+a_n^{2020}$ is divisible by $2020$.

By dividing the integer $m$ by the integer $n, 22$ is the quotient and $5$ the remainder. As the division of the remainder with $n$ continues, the new quotient is $0.4$ and the new remainder is $0.2$. Find $m$ and $n$.

On a board, the numbers from 1 to 2009 are written. A couple of them are erased and instead of them, on the board is written the remainder of the sum of the erased numbers divided by 13. After a couple of repetition of this erasing, only 3 numbers are left, of which two are 9 and 999. Find the third number.

A diabolical combination lock has $n$ dials (each with $c$ possible states), where $n,c>1$. The dials are initially set to states $d_1, d_2, \ldots, d_n$, where $0\le d_i\le c-1$ for each $1\le i\le n$. Unfortunately, the actual states of the dials (the $d_i$'s) are concealed, and the initial settings of the dials are also unknown. On a given turn, one may advance each dial by an integer amount $c_i$ ($0\le c_i\le c-1$), so that every dial is now in a state $d_i '\equiv d_i+c_i \pmod{c}$ with $0\le d_i ' \le c-1$. After each turn, the lock opens if and only if all of the dials are set to the zero state; otherwise, the lock selects a random integer $k$ and cyclically shifts the $d_i$'s by $k$ (so that for every $i$, $d_i$ is replaced by $d_{i-k}$, where indices are taken modulo $n$). Show that the lock can always be opened, regardless of the choices of the initial configuration and the choices of $k$ (which may vary from turn to turn), if and only if $n$ and $c$ are powers of the same prime. [i]Bobby Shen.[/i]