[u]Townspeople and Goons[/u] In the city of Lincoln, there is an empty jail, at least two townspeople and at least one goon. A game proceeds over several days, starting with morning. $\bullet$ Each morning, one randomly selected unjailed person is placed in jail. If at this point all goons are jailed, and at least one townsperson remains, then the townspeople win. If at this point all townspeople are jailed and at least one goon remains, then the goons win. $\bullet$ Each evening, if there is at least one goon and at least one townsperson not in jail, then one randomly selected townsperson is jailed. If at this point there are at least as many goons remaining as townspeople remaining, then the goons win. The game ends immediately after any group wins. [b]p1. [/b]Find the probability that the townspeople win if there are initially two townspeople and one goon. [b]p2.[/b] Find the smallest positive integer $n$ such that, if there are initially $2n$ townspeople and $1$ goon, then the probability the townspeople win is greater than $50\%$. [b]p3.[/b] Find the smallest positive integer $n$ such that, if there are initially $n + 1$ townspeople and $n$ goons, then the probability the townspeople win is less than $1\%$. [b]p4[/b]. Suppose there are initially $1001$ townspeople and two goons. What is the probability that, when the game ends, there are exactly $1000$ people in jail? [b]p5.[/b] Suppose that there are initially eight townspeople and one goon. One of the eight townspeople is named Jester. If Jester is sent to jail during some morning, then the game ends immediately in his sole victory. (However, the Jester does not win if he is sent to jail during some night.) Find the probability that only the Jester wins.

Three $ \Delta $'s and a $ \diamondsuit $ will balance nine $ \bullet $'s. One $ \Delta $ will balance a $ \diamondsuit $ and a $ \bullet $. [asy] unitsize(5.5); fill((0,0)--(-4,-2)--(4,-2)--cycle,black); draw((-12,2)--(-12,0)--(12,0)--(12,2)); draw(ellipse((-12,5),8,3)); draw(ellipse((12,5),8,3)); label("$\Delta \hspace{2 mm}\Delta \hspace{2 mm}\Delta \hspace{2 mm}\diamondsuit $",(-12,6.5),S); label("$\bullet \hspace{2 mm}\bullet \hspace{2 mm}\bullet \hspace{2 mm} \bullet $",(12,5.2),N); label("$\bullet \hspace{2 mm}\bullet \hspace{2 mm}\bullet \hspace{2 mm}\bullet \hspace{2 mm}\bullet $",(12,5.2),S); fill((44,0)--(40,-2)--(48,-2)--cycle,black); draw((34,2)--(34,0)--(54,0)--(54,2)); draw(ellipse((34,5),6,3)); draw(ellipse((54,5),6,3)); label("$\Delta $",(34,6.5),S); label("$\bullet \hspace{2 mm}\diamondsuit $",(54,6.5),S);[/asy] How many $ \bullet $'s will balance the two $ \diamondsuit $'s in this balance? [asy] unitsize(5.5); fill((0,0)--(-4,-2)--(4,-2)--cycle,black); draw((-12,4)--(-12,2)--(12,-2)--(12,0)); draw(ellipse((-12,7),6.5,3)); draw(ellipse((12,3),6.5,3)); label("$?$",(-12,8.5),S); label("$\diamondsuit \hspace{2 mm}\diamondsuit $",(12,4.5),S);[/asy] $ \text{(A)}\ 1\qquad\text{(B)}\ 2\qquad\text{(C)}\ 3\qquad\text{(D)}\ 4\qquad\text{(E)}\ 5 $

Let $a,b$ be positive integers such that $a+b=10$. Let $\tfrac{p}{q}$ be the difference between the maximum and minimum possible values of $\tfrac{1}{a}+\tfrac{1}{b}$, where $p$ and $q$ are relatively prime positive integers. Compute $p+q$.

Solve the equation $$\left(x^2+3x-4\right)^3+\left(2x^2-5x+3\right)^3=\left(3x^2-2x-1\right)^3.$$

Find all quadruplets of positive integers $(m,n,k,l)$ such that $3^m = 2^k + 7^n$ and $m^k = 1 + k + k^2 + k^3 + \ldots + k^l$.

A [i]prime power[/i] is an integer of the form $p^k,$ where $p$ is a prime and $k$ is a nonnegative integer. How many prime powers are there less than or equal to $10^6?$ Your score will be $16-80|\frac{\textbf{Your Answer}}{\textbf{Actual Answer}}-1|$ rounded to the nearest integer or $0,$ whichever is higher.

Prove that if $ a $, $ b $, $ c $, $ d $ are the sides of a quadrilateral in which a circle can be circumscribed and a circle can be inscribed in it, then the area $ S $ of the quadrilateral is given by $$S = \sqrt{abcd}.$$

If $\lfloor x\rfloor$ is the greatest integer less than or equal to $x$, then \[\displaystyle\sum_{N=1}^{1024} \lfloor \log_{2}N\rfloor = \] $ \textbf{(A)}\ 8192\qquad\textbf{(B)}\ 8204\qquad\textbf{(C)}\ 9218\qquad\textbf{(D)}\ \lfloor \log_{2}(1024!)\rfloor\qquad\textbf{(E)}\ \text{none of these} $

Let there be a $n\times n$ board. Write down $0$ or $1$ in all $n^2$ squares. For $1 \le k \le n$, let $A_k$ be the product of all numbers in the $k$th row. How many ways are there to write down the numbers so that $A_1 + A_2 + ... + A_n$ is even?

The numbers $a$, $b$, and $c$ are real. Prove that $$(a^5+b^5+c^5+a^3c^2+b^3a^2+c^3b^2)^2\geq 4(a^2+b^2+c^2)(a^5b^3+b^5c^3+c^5a^3)$$

Show that there exists a positive integer $n$ such that the decimal representations of $3^n$ and $7^n$ both start with the digits $10$.

A circle having center $ (0,k)$, with $ k > 6$, is tangent to the lines $ y \equal{} x, y \equal{} \minus{} x$ and $ y \equal{} 6$. What is the radius of this circle? $ \textbf{(A)}\ 6 \sqrt 2 \minus{} 6\qquad \textbf{(B)}\ 6\qquad \textbf{(C)}\ 6 \sqrt 2\qquad \textbf{(D)}\ 12\qquad \textbf{(E)}\ 6 \plus{} 6 \sqrt 2$

The sum of sixth powers of six integers minus $1$ is six times greater than the product of these six integers. Prove that one of them is $1$ or $-1$ and all others are $0$s. (LD Kurliandchik)

In an isosceles triangle \(ABC\) with \(AB = AC\), \(BK\) is the altitude and \(H\) is the orthocenter. On the side \(AB\), a point \(N\) is chosen such that \(AN = HN\). Prove that the circumcircles of triangles \(BCK\) and \(ABH\) have a common point on the line \(KN\). [i]Proposed by Fedir Yudin[/i]

The sequence $(x_n)$ is defined as follows: $$x_0=2,\, x_1=1,\, x_{n+2}=x_{n+1}+x_n$$ for every non-negative integer $n$. a. For each $n\geq 1$, prove that $x_n$ is a prime number only if $n$ is a prime number or $n$ has no odd prime divisors b. Find all non-negative pairs of integers $(m,n)$ such that $x_m|x_n$.

Can one place positive integers at all vertices of a cube in such a way that for every pair of numbers connected by an edge, one will be divisible by the other , and there are no other pairs of numbers with this property? (A Shapovalov)

[b](a)[/b]Prove that every pentagon with integral coordinates has at least two vertices , whose respective coordinates have the same parity. [b](b)[/b]What is the smallest area possible of pentagons with integral coordinates. Albanian National Mathematical Olympiad 2010---12 GRADE Question 3.