Prove that every infinite arithmetic progression $a$, $a+d$, $a+2d$,... where $a$ and $d$ are positive integers, contains infinte geometric progression $b$, $bq$, $bq^2$,... where $b$ and $q$ are also positive integers

Let $P$ be a point inside a triangle $ABC$ such that $\angle PAC= \angle PCB$. Let the projections of $P$ onto $BC$, $CA$, and $AB$ be $X,Y,Z$ respectively. Let $O$ be the circumcenter of $\triangle XYZ$, $H$ be the foot of the altitude from $B$ to $AC$, $N$ be the midpoint of $AC$, and $T$ be the point such that $TYPO$ is a parallelogram. Show that $\triangle THN$ is similar to $\triangle PBC$. [i]Proposed by Sammy Luo[/i]

Given a right triangle $ABC$ with $ \angle C=90^o$. On its hypotenuse $AB$ is arbitrary mark the point$ P$. The point $Q$ is symmetric to the point $P$ wrt $AC$. Let the lines $PQ$ and $BQ$ intersect $AC$ at points $O$ and $R$ respectively. Denote by $S$ the foot of the perpendicular from the point $R$ on the line $AB$ ($S \ne P$), and let $T$ be the intersection point of lines $OS$ and $BR$. Prove that $R$ is the center of the circle inscribed in the triangle $CST$.

In a 14 team baseball league, each team played each of the other teams 10 times. At the end of the season, the number of games won by each team differed from those won by the team that immediately followed it by the same amount. Determine the greatest number of games the last place team could have won, assuming that no ties were allowed.

It is given the equation $x^2+px+1=0$, with roots $x_1$ and $x_2$; (a) find a second-degree equation with roots $y_1,y_2$ satisfying the conditions $y_1=x_1(1-x_1)$, $y_2=x_2(1-x_2)$; (b) find all possible values of the real parameter $p$ such that the roots of the new equation lies between $-2$ and $1$.

The side $AD$ of a square $ABCD$ is the base of an obtuse-angled isosceles triangle $AED$ with vertex $E$ lying inside the square. Let $AF$ be a diameter of the circumcircle of this triangle, and $G$ be a point on $CD$ such that $CG = DF$. Prove that angle $BGE$ is less than half of angle $AED$.

Christian Reiher and Reid Barton want to open a security box, they already managed to discover the algorithm to generate the key codes and they obtained the following information: $i)$ In the screen of the box will appear a sequence of $n+1$ numbers, $C_0 = (a_{0,1},a_{0,2},...,a_{0,n+1})$ $ii)$ If the code $K = (k_1,k_2,...,k_n)$ opens the security box then the following must happen: a) A sequence $C_i = (a_{i,1},a_{i,2},...,a_{i,n+1})$ will be asigned to each $k_i$ defined as follows: $a_{i,1} = 1$ and $a_{i,j} = a_{i-1,j}-k_ia_{i,j-1}$, for $i,j \ge 1$ b) The sequence $(C_n)$ asigned to $k_n$ satisfies that $S_n = \sum_{i=1}^{n+1}|a_i|$ has its least possible value, considering all possible sequences $K$. The sequence $C_0$ that appears in the screen is the following: $a_{0,1} = 1$ and $a_0,i$ is the sum of the products of the elements of each of the subsets with $i-1$ elements of the set $A =$ {$1,2,3,...,n$}, $i\ge 2$, such that $a_{0, n+1} = n!$ Find a sequence $K = (k_1,k_2,...,k_n)$ that satisfies the conditions of the problem and show that there exists at least $n!$ of them.

Find all polynomials of the form $$P_n(x)=n!x^n+a_{n-1}x^{n-1}+\dots+a_1x+(-1)^n(n+1)$$ with integer coefficients, having $n$ real roots $x_1,\dots,x_n$ satisfying $k \leq x_k \leq k+1$ for $k=1, \dots,n$.

A sequence $\left(a_n\right)$ with $a_1 = 1$ satisfies the following recursion: In the decimal expansion of $a_n$ (without trailing zeros) let $k$ be the smallest digest then $a_{n+1} = a_n + 2^k.$ How many digits does $a_{9 \cdot 10^{2010}}$ have in the decimal expansion?

Let $G$ be a simple undirected graph with vertices $v_1,v_2,...,v_n$. We denote the number of acyclic orientations of $G$ with $f(G)$. [b]a)[/b] Prove that $f(G)\le f(G-v_1)+f(G-v_2)+...+f(G-v_n)$. [b]b)[/b] Let $e$ be an edge of the graph $G$. Denote by $G'$ the graph obtained by omiting $e$ and making it's two endpoints as one vertex. Prove that $f(G)=f(G-e)+f(G')$. [b]c)[/b] Prove that for each $\alpha >1$, there exists a graph $G$ and an edge $e$ of it such that $\frac{f(G)}{f(G-e)}<\alpha$. [i]Proposed by Morteza Saghafian[/i]

Let $ABCD$ be a square. Let $M$ be the midpoint of $BC$ and $N$ be the point on $AB$ such that $2AN=BN$. If the area of $\triangle DMN$ is 15, find the area of square $ABCD$. [i]Proposed by Harry Kim[/i]

A positive integer $N$ is written on a board. In a step, the last digit $c$ of the number on the board is erased, and after this, the remaining number $m$ is erased and replaced with $|m-3c|$ (for example, if the number $1204$ is on the board, after one step, we will replace it with $120 - 3 \cdot 4 = 108$). We repeat this until the number on the board has only one digit. Find all positive integers $N$ such that after a finite number of steps, the remaining one-digit number is $0$.

Suppose that $k$ is a positive integer. A bijective map $f : Z \to Z$ is said to be $k$-[i]jumpy [/i] if $|f(z) - z| \le k$ for all integers $z$. Is it that case that for every $k$, each $k$-jumpy map is a composition of $1$-jumpy maps? [i]It is well known that this is the case when the support of the map is finite.[/i]

Take two points $A\ (-1,\ 0),\ B\ (1,\ 0)$ on the $xy$-plane. Let $F$ be the figure by which the whole points $P$ on the plane satisfies $\frac{\pi}{4}\leq \angle{APB}\leq \pi$ and the figure formed by $A,\ B$. Answer the following questions: (1) Illustrate $F$. (2) Find the volume of the solid generated by a rotation of $F$ around the $x$-axis.

The center of the circumcircle of the acute triangle $ABC$ is $O$. The line $AO$ intersects $BC$ at $D$. On the sides $AB$ and $AC$ of the triangle, choose points $E$ and $F$, respectively, so that the points $A, E, D, F$ lie on the same circle. Let $E'$ and $F'$ projections of points $E$ and $F$ on side $BC$ respectively. Prove that length of the segment $E'F'$ does not depend on the position of points $E$ and $F$.

For a prime $p$, a subset $S$ of residues modulo $p$ is called a [i]sum-free multiplicative subgroup[/i] of $\mathbb F_p$ if $\bullet$ there is a nonzero residue $\alpha$ modulo $p$ such that $S = \left\{ 1, \alpha^1, \alpha^2, \dots \right\}$ (all considered mod $p$), and $\bullet$ there are no $a,b,c \in S$ (not necessarily distinct) such that $a+b \equiv c \pmod p$. Prove that for every integer $N$, there is a prime $p$ and a sum-free multiplicative subgroup $S$ of $\mathbb F_p$ such that $\left\lvert S \right\rvert \ge N$. [i]Proposed by Noga Alon and Jean Bourgain[/i]

Nine light bulbs are equally spaced around a circle. When the power is turned on, each of the nine light bulbs turns blue or red, where the color of each bulb is determined randomly and independently of the colors of the other bulbs. Each time the power is turned on, the probability that the color of each bulb will be the same as at least one of the two adjacent bulbs on the circle is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

In the plane, $\Gamma$ is a circle with centre $O$ and radius $r, P$ and $Q$ are distinct points on $\Gamma , A$ is a point outside $\Gamma , M$ and $N$ are the midpoints of $PQ$ and $AO$ respectively. Suppose$ OA = 2a$ and $\angle PAQ$ is a right angle. Find the length of $MN$ in terms of $r$ and $a$. Express your answer in its simplest form, and justify your answer.

[u]Round 1 [/u] [b]p1. [/b]Twelve people, some are knights and some are knaves, are sitting around a table. Knaves always lie and knights always tell the truth. At some point they start up a conversation. The first person says, “There are no knights around this table.” The second says, “There is at most one knight at this table.” The third – “There are at most two knights at the table.” And so on until the 12th says, “There are at most eleven knights at the table.” How many knights are at the table? Justify your answer. [b]p2.[/b] Show that in the sequence $10017$, $100117$, $1001117$, $...$ all numbers are divisible by $53$. [b]p3.[/b] Harry and Draco have three wands: a bamboo wand, a willow wand, and a cherry wand, all of the same length. They must perform a spell wherein they take turns picking a wand and breaking it into three parts – first Harry, then Draco, then Harry again. But in order for the spell to work, Harry has to make sure it is possible to form three triangles out of the pieces of the wands, where each triangle has a piece from each wand. How should he break the wands to ensure the success of the spell? [b]p4.[/b] A $2\times 2\times 2$ cube has $4$ equal squares on each face. The squares that share a side are called neighbors (thus, each square has $4$ neighbors – see picture). Is it possible to write an integer in each square in such a way that the sum of each number with its $4$ neighbors is equal to $13$? If yes, show how. If no, explain why not. [img]https://cdn.artofproblemsolving.com/attachments/8/4/0f7457f40be40398dee806d125ba26780f9d3a.png[/img] [b]p5.[/b] Two girls are playing a game. The first player writes the letters $A$ or $B$ in a row, left to right, adding one letter on her turn. The second player switches any two letters after each move by the first player (the letters do not have to be adjacent), or does nothing, which also counts as a move. The game is over when each player has made $2011$ moves. Can the second player plan her moves so that the resulting letters form a palindrome? (A palindrome is a sequence that reads the same forward and backwards, e.g. $AABABAA$.) [u]Round 2 [/u] [b]p6.[/b] A red square is placed on a table. $2010$ white squares, each the same size as the red square, are then placed on the table in such a way that the red square is fully covered and the sides of every white square are parallel to the sides of the red square. Is it always possible to remove one of the white squares so the red square remains completely covered? [b]p7.[/b] A computer starts with a given positive integer to which it randomly adds either $54$ or $77$ every second and prints the resulting sum after each addition. For example, if the computer is given the number $1$, then a possible output could be: $1$, $55$, $109$, $186$, $…$ Show that after finitely many seconds the computer will print a number whose last two digits are the same. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a$ ,$b$ and $c$ be distinct real numbers. $a)$ Determine value of $ \frac{1+ab }{a-b} \cdot \frac{1+bc }{b-c} + \frac{1+bc }{b-c} \cdot \frac{1+ca }{c-a} + \frac{1+ca }{c-a} \cdot \frac{1+ab}{a-b} $ $b)$ Determine value of $ \frac{1-ab }{a-b} \cdot \frac{1-bc }{b-c} + \frac{1-bc }{b-c} \cdot \frac{1-ca }{c-a} + \frac{1-ca }{c-a} \cdot \frac{1-ab}{a-b} $ $c)$ Prove the following ineqaulity $ \frac{1+a^2b^2 }{(a-b)^2} + \frac{1+b^2c^2 }{(b-c)^2} + \frac{1+c^2a^2 }{(c-a)^2} \geq \frac{3}{2} $ When does eqaulity holds?

Let $ x$, $ y$, $ z$ be positive numbers. Find the minimum value of: $ (a)\quad \frac{x^2 \plus{} y^2 \plus{} z^2}{xy \plus{} yz}$ $ (b)\quad \frac{x^2 \plus{} y^2 \plus{} 2z^2}{xy \plus{} yz}$

Determine the smallest positive integer containing only $0$ and $1$ as digits that is divisible by each integer $1$ through $9$.

Let $ABC$ be a triangle. Points $D$ and $E$ are taken on the line $BC$ such that $AD$ and $AE$ are parallel to the respective tangents to the circumcircle at $C$ and $B$. Prove that \[\frac{BE}{CD}=\left(\frac{AB}{AC}\right)^2 \]

Suppose that $\lim_{n\to \infty} a_n=a$ and $\lim_{n\to \infty} b_n=b$. Prove that $\lim_{n\to \infty}\frac{1}{n}(a_1b_n+a_2b_{n-1}+...+a_nb_1)=ab$.

A sequence $a_0, a_1, a_2, \dots$ of real numbers satisfies $a_0 = 999$, $a_1 = -999$, and $a_n = a_{n-1}a_{n+1}$ for each positive integer $n$. Compute $\left\lvert a_1 + a_2 + \dots + a_{1000} \right\rvert$. [i]Proposed by Jeremy Lu[/i]