Is it possible for an isosceles triangle with all its sides of positive integer lengths to have an angle of $36^o$? [i] (Adapted from Archimedes 2011, Traian Preda)[/i]

We consider the following figure: [See attachment] We are looking for labellings of the nine fields with the numbers 1, 2, ..., 9. Each of these numbers has to be used exactly once. Moreover, the six sums of three resp. four numbers along the drawn lines have to be be equal. Give one such labelling. Show that all such labellings have the same number in the top field. How many such labellings do there exist? (Two labellings are considered different, if they disagree in at least one field.) (Walther Janous)

We say that a strictly increasing positive real sequence $a_1,a_2,\cdots $ is an [i]elf sequence[/i] if for any $c>0$ we can find an $N$ such that $a_n<cn$ for $n=N,N+1,\cdots$. Furthermore, we say that $a_n$ is a [i]hat[/i] if $a_{n-i}+a_{n+i}<2a_n$ for $\displaystyle 1\le i\le n-1$. Is it true that every elf sequence has infinitely many hats?

In triangle $ABC$, $AB = AC$. Point $D$ is the midpoint of side $BC$. Point $E$ lies outside the triangle $ABC$ such that $CE \perp AB$ and $BE = BD$. Let $M$ be the midpoint of segment $BE$. Point $F$ lies on the minor arc $\widehat{AD}$ of the circumcircle of triangle $ABD$ such that $MF \perp BE$. Prove that $ED \perp FD.$ [asy] defaultpen(fontsize(10)); size(6cm); pair A = (3,10), B = (0,0), C = (6,0), D = (3,0), E = intersectionpoints( Circle(B, 3), C--(C+100*dir(B--A)*dir(90)) )[1], M = midpoint(B--E), F = intersectionpoints(M--(M+50*dir(E--B)*dir(90)), circumcircle(A,B,D))[0]; dot(A^^B^^C^^D^^E^^M^^F); draw(B--C--A--B--E--D--F--M^^circumcircle(A,B,D)); pair point = extension(M,F,A,D); pair[] p={A,B,C,D,E,F,M}; string s = "A,B,C,D,E,F,M"; int size = p.length; real[] d; real[] mult; for(int i = 0; i<size; ++i) { d[i] = 0; mult[i] = 1;} d[4] = -50; string[] k= split(s,","); for(int i = 0;i<p.length;++i) { label("$"+k[i]+"$",p[i],mult[i]*dir(point--p[i])*dir(d[i])); }[/asy]

Let $x_1, x_2, \ldots ,x_n(n\ge 2)$ be real numbers greater than $1$. Suppose that $|x_i-x_{i+1}|<1$ for $i=1, 2,\ldots ,n-1$. Prove that \[\frac{x_1}{x_2}+\frac{x_2}{x_3}+\ldots +\frac{x_{n-1}}{x_n}+\frac{x_n}{x_1}<2n-1\]

Let $f$ be a linear function such that $f(0) = -5$ and $f(f(0)) = -15$. Find the values of $ k \in R$ for which the solutions of the inequality $f(x) \cdot f(k - x) > 0$, lie in an interval of[u][/u] length $2$.

Given a real number $ c > 0$, a sequence $ (x_n)$ of real numbers is defined by $ x_{n \plus{} 1} \equal{} \sqrt {c \minus{} \sqrt {c \plus{} x_n}}$ for $ n \ge 0$. Find all values of $ c$ such that for each initial value $ x_0$ in $ (0, c)$, the sequence $ (x_n)$ is defined for all $ n$ and has a finite limit $ \lim x_n$ when $ n\to \plus{} \infty$.

Prove that, abc≤1 and a,b,c>0 \[\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\geq 1+ \frac{6}{a+b+c} \]

There exists a block of 1000 consecutive positive integers containing no prime numbers, namely, $1001!+2,1001!+3,...,1001!+1001$. Does there exist a block of 1000 consecutive positive intgers containing exactly five prime numbers?

Arne has $2n + 1$ tickets. Each card has one number on it. One card has the number $0$ on it. The natural numbers $1, 2, . . . , n$ occur on exactly two cards each. Prove that Arne can arrange cards in a row so that there are exactly $m$ cards between the two cards with the number $m$, for every $m \in \{1, 2, . . . , n\}$.

Let be three positive integers $ a,b,c $ and a function $ f:\mathbb{N}\longrightarrow\mathbb{N} $ defined as $$ f(n)=\left\{ \begin{matrix} n-a, & n>c\\ f\left( f(n+b) \right) ,& n\le c \end{matrix} \right. . $$ Determine the number of fixed points this function has.

For a given triangle ABC, let X be a variable point on the line BC such that the point C lies between the points B and X. Prove that the radical axis of the incircles of the triangles ABX and ACX passes through a point independent of X. This is a slight extension of the [url=http://www.mathlinks.ro/Forum/viewtopic.php?t=41033]IMO Shortlist 2004 geometry problem 7[/url] and can be found, together with the proposed solution, among the files uploaded at http://www.mathlinks.ro/Forum/viewtopic.php?t=15622 . Note that the problem was proposed by Russia. I could not find the names of the authors, but I have two particular persons under suspicion. Maybe somebody could shade some light on this... Darij

Let $p$ be a prime number and let $k$ be a positive integer. Suppose that the numbers $a_i=i^k+i$ for $i=0,1, \ldots,p-1$ form a complete residue system modulo $p$. What is the set of possible remainders of $a_2$ upon division by $p$?

Let $ABC$ be a triangle with $\angle A = 60^\circ$. Points $E$ and $F$ are the foot of angle bisectors of vertices $B$ and $C$ respectively. Points $P$ and $Q$ are considered such that quadrilaterals $BFPE$ and $CEQF$ are parallelograms. Prove that $\angle PAQ > 150^\circ$. (Consider the angle $PAQ$ that does not contain side $AB$ of the triangle.) [i]Proposed by Alireza Dadgarnia[/i]

Let be $f:\left[0,1\right]\rightarrow\left[0,1\right]$ a continuous and bijective function,such that : $f\left(0\right)=0$.Then the following inequality holds: $\left(\alpha+2\right)\cdotp\int_{0}^{1}x^{\alpha}\left(f\left(x\right)+f^{-1}\left(x\right)\right)\leq2,\forall\alpha\geq0 $

Find the largest real number $ C_1 $ and the smallest real number $ C_2 $, such that, for all reals $ a,b,c,d,e $, we have \[ C_1 < \frac{a}{a+b}+\frac{b}{b+c}+\frac{c}{c+d}+\frac{d}{d+e}+\frac{e}{e+a} < C_2 \]

Let $(X,d)$ be a nonempty connected metric space such that the limit of every convergent sequence, is a term of that sequence. Prove that $X$ has exactly one element.

One container of paint is exactly enough to cover the inside of an old rectangle which is three times as long as it is wide. If we make a new rectangle by shortening the old rectangle by $18$ feet and widening it by $8$ feet as shown below, one container of paint is also exactly enough to cover the inside of the new rectangle. Find the length in feet of the perimeter of the new rectangle. [asy] size(250); defaultpen(linewidth(0.8)); draw((-2,0)--(-2,5)--(13,5)--(13,0)--cycle^^(16,-1)--(16,6)--(27,6)--(27,-1)--cycle^^(9,5)--(9,0)^^(16,4)--(27,4)); path rect1=(13,5)--(13,0)--(9,0)--(9,5)--cycle,rect2=(16,6)--(16,4)--(27,4)--(27,6)--cycle; fill(rect1,lightgray); fill(rect2,lightgray); draw(rect1^^rect2); [/asy]

Show there do not exist four points in the Euclidean plane such that the pairwise distances between the points are all odd integers.

Let $ p \geq 2$ be a prime number. Eduardo and Fernando play the following game making moves alternately: in each move, the current player chooses an index $i$ in the set $\{0,1,2,\ldots, p-1 \}$ that was not chosen before by either of the two players and then chooses an element $a_i$ from the set $\{0,1,2,3,4,5,6,7,8,9\}$. Eduardo has the first move. The game ends after all the indices have been chosen .Then the following number is computed: $$M=a_0+a_110+a_210^2+\cdots+a_{p-1}10^{p-1}= \sum_{i=0}^{p-1}a_i.10^i$$. The goal of Eduardo is to make $M$ divisible by $p$, and the goal of Fernando is to prevent this. Prove that Eduardo has a winning strategy. [i]Proposed by Amine Natik, Morocco[/i]

Let $M = F_1\times\cdots\times F_k$ be the product of $k$ smooth, closed surfaces (2-dimensional, $C^\infty$, compact, connected, manifold without boundary), $s$ of which are non-orientable. Prove that $M$ can be embedded in $\mathbb{R}^{2k+s+1}$.

Let $ABC$ be an acute triangle with $AB = 3$ and $AC = 4$. Suppose $M$ is the midpoint of segment $\overline{BC}$, $N$ is the midpoint of $\overline{AM}$, and $E$ and $F$ are the feet of the altitudes of $M$ onto $\overline{AB}$ and $\overline{AC}$, respectively. Further suppose $BC$ intersects $NE$ at $S$ and $NF$ at $T$, and let $X$ and $Y$ be the circumcenters of $\triangle MES$ and $\triangle MFT$, respectively. If $XY$ is tangent to the circumcircle of $\triangle ABC$, what is the area of $\triangle ABC$?

Let $ABC$ be an acute scalene triangle with circumcenter $O$. Let $D$ be the foot of the altitude from $A$ to the side $BC$. The lines $BC$ and $AO$ intersect at $E$. Let $s$ be the line through $E$ perpendicular to $AO$. The line $s$ intersects $AB$ and $AC$ at $K$ and $L$, respectively. Denote by $\omega$ the circumcircle of triangle $AKL$. Line $AD$ intersects $\omega$ again at $X$. Prove that $\omega$ and the circumcircles of triangles $ABC$ and $DEX$ have a common point.

Let $ ABC$ be a triangle with $ \angle A = 60^{\circ}$.Prove that if $ T$ is point of contact of Incircle And Nine-Point Circle, Then $ AT = r$, $ r$ being inradius.

Let $ABC$ be a triangle. The angle bisectors of $\angle ABC$ and $\angle ACB$ intersect at $D$. If $\angle BAC =80^o$ , what are all possible values for $\angle BDC$ ?