Given the rational numbers $r$, $q$, and $n$, such that $\displaystyle\frac1{r+qn}+\frac1{q+rn}=\frac1{r+q}$, prove that $\displaystyle\sqrt{\frac{n-3}{n+1}}$ is a rational number.

Given an integer $n\ge 2$. Prove that there only exist a finite number of n-tuples of positive integers $(a_1,a_2,\ldots,a_n)$ which simultaneously satisfy the following three conditions: [list] [*] $a_1>a_2>\ldots>a_n$; [*] $\gcd (a_1,a_2,\ldots,a_n)=1$; [*] $a_1=\sum_{i=1}^{n}\gcd (a_i,a_{i+1})$,where $a_{n+1}=a_1$.[/list]

A road has constant width. It is made up of finitely many straight segments joined by corners, where the inner corner is a point and the outer side is a circular arc. The direction of the straight sections is always between $NE$ ($45^o$) and $SSE$ ($157 1/2^o$). A person wishes to walk along the side of the road from point $A$ to point $B$ on the same side. He may only cross the street perpendicularly. What is the shortest route? [figure missing]

Given six positive numbers $a,b,c,d,e,f$ such that $a < b < c < d < e < f.$ Let $a+c+e=S$ and $b+d+f=T.$ Prove that \[2ST > \sqrt{3(S+T)\left(S(bd + bf + df) + T(ac + ae + ce) \right)}.\] [i]Proposed by Sung Yun Kim, South Korea[/i]

$ABCD$ - convex quadrilateral. $M$ -midpoint $AC$ and $\angle MCB=\angle CMD =\angle MBA=\angle MBC-\angle MDC$. Prove, that $AD=DC+AB$

Place $n$ points on a circle and draw all possible chord joining these points. If no three chord are concurent, find the number of disjoint regions created. [color=#008000]Moderator says: http://www.artofproblemsolving.com/Forum/viewtopic.php?f=151&t=260926&hilit=circle+points+segments+regions[/color]

Davi and George are taking a city tour through Fortaleza, with Davi initially leading. Fortaleza is organized like an $n \times n$ grid. They start in one of the grid's squares and can move from one square to another adjacent square via a street (for each pair of neighboring squares on the grid, there is a street connecting them). Some streets are dangerous. If Davi or George pass through a dangerous street, they get scared and swap who is leading the city tour. Their goal is to pass through every block of Fortaleza exactly once. However, if the city tour ends with George in command, the entire world becomes unemployed and everyone starves to death. Given that there is at least one street that is not dangerous, prove that Davi and George can achieve their goal without everyone dying of hunger.

Recall that a palindrome is a number that reads the same forward and backward. Find the greatest integer less than $1000$ that is a palindrome both when written in base ten and when written in base eight, such as $292=444_{\text{eight}}$.

Simplify \[\sum_{k=0}^n \frac{(2n)!}{(k!)^2((n-k)!)^2}.\]

The vertices of a $33$-gon are labelled with the integers from $1$ to $33$. Each edge is then labelled with the sum of the labels of its two vertices. Is it possible for the edge labels to consist of $33$ consecutive numbers?

In an acute triangle $\triangle ABC$ the points $C_m, A_m, B_m$ are the midpoints of $AB, BC, CA$ respectively. Inside the triangle $\triangle ABC$ a point $P$ is chosen so that $\angle PCB = \angle B_mBC$ and $\angle PAB = \angle ABB_m.$ A line passing through $P$ and perpendicular to $AC$ meets the median $BB_m$ at $E.$ Prove that $E$ lies on the circumcircle of the triangle $\triangle A_mB_mC_m.$ [i](K. Ivanov )[/i]

Some cities of Russia are connected with some cities of Ukraine with international airlines. The Interstate Council for the Promotion of Migration intends to introduce a one-way traffic on each airline so that, by taking off from the city, it could no longer be returned in this city (using other one-way airlines). Prove that the number of ways to do this is not divided by $3$.

A cafe has 3 tables and 5 individual counter seats. People enter in groups of size between 1 and 4, inclusive, and groups never share a table. A group of more than 1 will always try to sit at a table, but will sit in counter seats if no tables are available. Conversely, a group of 1 will always try to sit at the counter first. One morning, $M$ groups consisting of a total of $N$ people enter and sit down. Then, a single person walks in, and realizes that all the tables and counter seats are occupied by some person or group. What is the minimum possible value of $M + N$?

Let $\Gamma$ be a circle of center $S$ and radius $r$ and let be $A$ a point outside the circle. Let $BC$ be a diameter of $\Gamma$ such that $B$ does not belong to the line $AS$ and consider the point $O$ where the perpendicular bisectors of triangle $ABC$ intersect, that is, the circumcenter of $ABC$. Determine all possible locations of point $O$ when $B$ varies in circle $\Gamma$.

Given is an positive integer $a>2$ a) Prove that there exists positive integer $n$ different from $1$, which is not a prime, such that $a^n=1(mod n)$ b) Prove that if $p$ is the smallest positive integer, different from $1$, such that $a^p=1(mod p)$, then $p$ is a prime. c) There does not exist positive integer $n$, different from $1$, such that $2^n=1(mod n)$

A random number generator will always output $7$. Sam uses this random number generator once. What is the expected value of the output?

In a convex quadrilateral $ABCD$, We have $\angle{B} = \angle{D} = 120^{\circ}$. Points $A'$, $B'$ and $C'$ are symmetric to $D$ relative to $BC$, $CA$ and $AB$, respectively. Prove that lines $AA'$, $BB'$ and $CC'$ are concurrent.