Let $a_1, \dots, a_n, b_1, \dots, b_n$ be $2n$ positive integers such that the $n+1$ products \[a_1 a_2 a_3 \cdots a_n, b_1 a_2 a_3 \cdots a_n, b_1 b_2 a_3 \cdots a_n, \dots, b_1 b_2 b_3 \cdots b_n\] form a strictly increasing arithmetic progression in that order. Determine the smallest possible integer that could be the common difference of such an arithmetic progression.

[b]p1.[/b] There are $32$ balls in a box: $6$ are blue, $8$ are red, $4$ are yellow, and $14$ are brown. If I pull out three balls at once, what is the probability that none of them are brown? [b]p2.[/b] Circles $A$ and $B$ are concentric, and the area of circle $A$ is exactly $20\%$ of the area of circle $B$. The circumference of circle $B$ is $10$. A square is inscribed in circle $A$. What is the area of that square? [b]p3.[/b] If $x^2 +y^2 = 1$ and $x, y \in R$, let $q$ be the largest possible value of $x+y$ and $p$ be the smallest possible value of $x + y$. Compute $pq$. [b]p4.[/b] Yizheng and Jennifer are playing a game of ping-pong. Ping-pong is played in a series of consecutive matches, where the winner of a match is given one point. In the scoring system that Yizheng and Jennifer use, if one person reaches $11$ points before the other person can reach $10$ points, then the person who reached $11$ points wins. If instead the score ends up being tied $10$-to-$10$, then the game will continue indefinitely until one person’s score is two more than the other person’s score, at which point the person with the higher score wins. The probability that Jennifer wins any one match is $70\%$ and the score is currently at $9$-to-$9$. What is the probability that Yizheng wins the game? [b]p5.[/b] The squares on an $8\times 8$ chessboard are numbered left-to-right and then from top-to-bottom (so that the top-left square is $\#1$, the top-right square is $\#8$, and the bottom-right square is $\#64$). $1$ grain of wheat is placed on square $\#1$, $2$ grains on square $\#2$, $4$ grains on square $\#3$, and so on, doubling each time until every square of the chessboard has some number of grains of wheat on it. What fraction of the grains of wheat on the chessboard are on the rightmost column? [b]p6.[/b] Let $f$ be any function that has the following property: For all real numbers $x$ other than $0$ and $1$, $$f \left( 1 - \frac{1}{x} \right) + 2f \left( \frac{1}{1 - x}\right)+ 3f(x) = x^2.$$ Compute $f(2)$. [b]p7.[/b] Find all solutions of: $$(x^2 + 7x + 6)^2 + 7(x^2 + 7x + 6)+ 6 = x.$$ [b]p8.[/b] Let $\vartriangle ABC$ be a triangle where $AB = 25$ and $AC = 29$. $C_1$ is a circle that has $AB$ as a diameter and $C_2$ is a circle that has $BC$ as a diameter. $D$ is a point on $C_1$ so that $BD = 15$ and $CD = 21$. $C_1$ and $C_2$ clearly intersect at $B$; let $E$ be the other point where $C_1$ and $C_2$ intersect. Find all possible values of $ED$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

We say that a positive integer $n$ is [i]good[/i] if the result of multiplying the first $n$ positive odd integers consists only of the digits $1$, $3$, $5$ and $9$. For example, $n = 3$ is good because $1 \times 3 \times 5 = 15$, but $n = 4$ is not good because $1 \times 3 \times 5 \times 7 = 105$. Determine all the good numbers.

Let $a$ be an odd positive integer. Prove that if $d$ divides $a^2+2$, then $d\equiv1\pmod8$ or $d\equiv3\pmod8$.

Given an integer $h > 1$. Let's call a positive common fraction (not necessarily irreducible) [i]good[/i] if the sum of its numerator and denominator is equal to $h$. Let's say that a number $h$ is [i]remarkable[/i] if every positive common fraction whose denominator is less than $h$ can be expressed in terms of good fractions (not necessarily various) using the operations of addition and subtraction. Prove that $h$ is remarkable if and only if it is prime. (Recall that an common fraction has an integer numerator and a natural denominator.)

Positive integers $x>1$ and $y$ satisfy an equation $2x^2-1=y^{15}$. Prove that 5 divides $x$.

Find all functions $f:\mathbb{N}_0\to\mathbb{N}_0$ for which $f(0)=0$ and \[f(x^2-y^2)=f(x)f(y) \] for all $x,y\in\mathbb{N}_0$ with $x>y$.

Prove that the set $\{1,2,…,12001\}$ can be partitioned into 5 groups so that none of them contains an arithmetic progression with length 11.

The two pairs of consecutive natural numbers $(8, 9)$ and $(288, 289)$ have the following property: in each pair, each number contains each of its prime factors to a power not less than $2$. Prove that there are infinitely many such pairs. (A Andjans, Riga)

Given positive integer $n,k$ such that $2 \le n <2^k$. Prove that there exist a subset $A$ of $\{0,1,\cdots,n\}$ such that for any $x \neq y \in A$, ${y\choose x}$ is even, and $$|A| \ge \frac{{k\choose \lfloor \frac{k}{2} \rfloor}}{2^k} \cdot (n+1)$$

Let $a$ be a natural number, $a>3$. Prove there is an infinity of numbers n, for which $a+n|a^{n}+1$

In a sports competition in which several tests are carried out, only the three athletes $A, B, C$. In each event, the winner receives $x$ points, the second receives $y$ points, and the third receives $z$ points. There are no ties, and the numbers $x, y, z$ are distinct positive integers with $x$ greater than $y$, and $y$ greater than $z$. At the end of the competition it turns out that $A$ has accumulated $20$ points, $B$ has accumulated $10$ points and $C$ has accumulated $9$ points. We know that athlete $A$ was second in the 100-meter event. Determine which of the three athletes he was second in the jumping event.

Find $100m+n$ if $m$ and $n$ are relatively prime positive integers such that \[ \sum_{\substack{i,j \ge 0 \\ i+j \text{ odd}}} \frac{1}{2^i3^j} = \frac{m}{n}. \][i]Proposed by Aaron Lin[/i]

Given positive integer $k$, prove that there exists a positive integer $N$ depending only on $k$ such that for any integer $n\geq N$, $\binom{n}{k}$ has at least $k$ different prime divisors.

Let $m$ be a fixed positive integer. The infinite sequence $\{a_n\}_{n\geq 1}$ is defined in the following way: $a_1$ is a positive integer, and for every integer $n\geq 1$ we have $$a_{n+1} = \begin{cases}a_n^2+2^m & \text{if } a_n< 2^m \\ a_n/2 &\text{if } a_n\geq 2^m\end{cases}$$ For each $m$, determine all possible values of $a_1$ such that every term in the sequence is an integer.

Consider the sequence of numbers $\left[n+\sqrt{2n}+\frac12\right]$, where $[x]$ denotes the greatest integer not exceeding $x$. If the missing integers in the sequence are $n_1<n_2<n_3<\ldots$ find $n_{12}$

Show that there are at least $3$ and at most $4$ powers of $2$ with $m$ digits. For which $m$ are there $4$?

$p$ is an odd prime. Show that $p$ divides $n(n+1)(n+2)(n+3) + 1$ for some integer $n$ iff $p$ divides $m^2 - 5$ for some integer $m$.

Find all pairs of integers $m, n \geq 2$ such that $$n\mid 1+m^{3^n}+m^{2\cdot 3^n}.$$

$a,b,c,t$ are antural numbers and $k=c^{t}$ and $n=a^{k}-b^{k}$. a) Prove that if $k$ has at least $q$ different prime divisors, then $n$ has at least $qt$ different prime divisors. b)Prove that $\varphi(n)$ id divisible by $2^{\frac{t}{2}}$

[b]p1.[/b] Sarah needed a ride home to the farm from town. She telephoned for her father to come and get her with the pickup truck. Being eager to get home, she began walking toward the farm as soon as she hung up the phone. However, her father had to finish milking the cows, so could not leave to get her until fifteen minutes after she called. He drove rapidly to make up for lost time. They met on the road, turned right around and drove back to the farm at two-thirds of the speed her father drove coming. They got to the farm two hours after she had called. She walked and he drove both ways at constant rates of speed. How many minutes did she spend walking? [b]p2.[/b] Let $A = (a,b)$ be any point in a coordinate plane distinct from the origin $O$. Let $M$ be the midpoint of $OA$, and let $P$ be a point such that $MP$ is perpendicular to $OA$ and the lengths $\overline{MP}$ and $\overline{OM}$ are equal. Determine the coordinates $(x,y)$ of $P$ in terms of $a$ and $b$. Give all possible solutions. [b]p3.[/b] Determine the exact sum of the series $$\frac{1}{1 \cdot 2\cdot 3} + \frac{1}{2\cdot 3\cdot 4} + \frac{1}{3\cdot 4\cdot 5} + ... + \frac{1}{98\cdot 99\cdot 100}$$ [b]p4.[/b] A six pound weight is attached to a four foot nylon cord that is looped over two pegs in the manner shown in the drawing. At $B$ the cord passes through a small loop in its end. The two pegs $A$ and $C$ are one foot apart and are on the same level. When the weight is released the system obtains an equilibrium position. Determine angle $ABC$ for this equilibrium position, and verify your answer. (Your verification should assume that friction and the weight of the cord are both negligible, and that the tension throughout the cord is a constant six pounds.) [img]https://cdn.artofproblemsolving.com/attachments/a/1/620c59e678185f01ca8743c39423234d5ba04d.png[/img] [b]p5.[/b] The four corners of a rectangle have the property that when they are taken three at a time, they determine triangles all of which have the same perimeter. We will consider whether a set of five points can have this property. Let $S = \{p_1, p_2, p_3, p_4, p_5\}$ be a set of five points. For each $i$ and $j$, let $d_{ij}$ denote the distance from $p_i$ to $p_j$. Suppose that $S$ has the property that all triangles with vertices in $S$ have the same perimeter. (a) Prove that $d$ must be the same for every pair $(i,j)$ with $i \ne j$. (b) Can such a five-element set be found in three dimensional space? Justify your answer. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n = 2^{p-1} (2^p - 1)$, and let $2^p- 1$ be a prime number. Prove that the sum of all (positive) divisors of $n$ (not including $n$ itself) is exactly $n$.

Let $N = 6^{n}$, where $n$ is a positive integer, and let $M = a^{N}+b^{N}$, where $a$ and $b$ are relatively prime integers greater than $1. M$ has at least two odd divisors greater than $1$ are $p,q$. Find the residue of $p^{N}+q^{N}\mod 6\cdot 12^{n}$.

In the table $n \times n$ numbers from $1$ to $n$ are written in a spiral way. For which $n$ all the numbers on the main diagonal are distinct?

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$.