We are given a natural number $d$. Find all open intervals of maximum length $I \subseteq R$ such that for all real numbers $a_0,a_1,...,a_{2d-1}$ inside interval $I$, we have that the polynomial $P(x)=x^{2d}+a_{2d-1}x^{2d-1}+...+a_1x+a_0$ has no real roots.

Alice and Bob find themselves on a coordinate plane at time $t=0$ at $A(1,0)$ and $B(-1,0)$ respectively. They have no sense of direction, but they want to find each other. They each pick a direction independently and with uniform random probability. Both Alice and Bob travel at a constant speed of $1 \frac{unit}{min}$ in their chosen directions. They continue on their straight line paths forever, each hoping to catch sight of the other. They both have a $1$ unit radius of view; they can see something if and only if its distance from them is at most $1$ unit. What is the probability they never see each other?

Determine all integers $n \geq 3$ for which there exists a conguration of $n$ points in the plane, no three collinear, that can be labelled $1$ through $n$ in two different ways, so that the following condition be satisfied: For every triple $(i,j,k), 1 \leq i < j < k \leq n$, the triangle $ijk$ in one labelling has the same orientation as the triangle labelled $ijk$ in the other, except for $(i,j,k) = (1,2,3)$.

A positive number $x$ satisfies the inequality $\sqrt{x} < 2x$ if and only if $\text{(A)} \ x > \frac{1}{4} \qquad \text{(B)} \ x > 2 \qquad \text{(C)} x > 4 \qquad \text{(D)} \ x < \frac{1}{4}\qquad \text{(E)} x < 4$

Let $n\geq 2$ be a given integer. Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that \[f(x-f(y))=f(x+y^n)+f(f(y)+y^n), \qquad \forall x,y \in \mathbb R.\]

Let $\lambda$ the positive root of the equation $t^2-1998t-1=0$. It is defined the sequence $x_0,x_1,x_2,\ldots,x_n,\ldots$ by $x_0=1,\ x_{n+1}=\lfloor\lambda{x_n}\rfloor\mbox{ for }n=1,2\ldots$ Find the remainder of the division of $x_{1998}$ by $1998$. Note: $\lfloor{x}\rfloor$ is the greatest integer less than or equal to $x$.

Integers from 1 to 100 are placed in a row in some order. Let us call a number [i]large-right[/i], if it is greater than each number to the right of it; let us call a number [i]large-left[/i], is it is greater than each number to the left of it. It appears that in the row there are exactly $k$ large-right numbers and exactly $k$ large-left numbers. Find the maximal possible value of $k$.

Let $a$ be a real number and $b$ a real number with $b\neq-1$ and $b\neq0. $ Find all pairs $ (a, b)$ such that $$\frac{(1 + a)^2 }{1 + b}\leq 1 + \frac{a^2}{b}.$$ For which pairs (a, b) does equality apply? (Walther Janous)

Let $ABC$ be a triangle such that $AB = 3$, $BC = 4$, and $AC = 5$. Let $X$ be a point in the triangle. Compute the minimal possible value of $AX^2 + BX^2 + CX^2$

Three line segments, all of length $1$, form a connected figure in the plane. Any two different line segments can intersect only at their endpoints. Find the maximum area of the convex hull of the figure.

An ordered pair $(a,b)$ of positive integers is called [i]spicy[/i] if $\gcd(a+b, ab+1)=1.$ Compute the probability that both $(99, n)$ and $(101,n)$ are spicy when $n$ is chosen from $\{1, 2, \ldots, 2024!\}$ uniformly at random.

Let $ a\equal{}\pi/2008$. Find the smallest positive integer $ n$ such that \[ 2[\cos(a)\sin(a)\plus{}\cos(4a)\sin(2a)\plus{}\cos(9a)\sin(3a)\plus{}\cdots\plus{}\cos(n^2a)\sin(na)]\] is an integer.

Circles $S_1$ and $S_2$ with centers $O_1$ and $O_2$ respectively intersect at $A$ and $B$. The circle passing through $O_1$, $O_2$, and $A$ intersects $S_1$, $S_2$ and line $AB$ again at $D$, $E$, and $C$, respectively. Show that $CD = CB = CE$.

„œ‚Find all continuous functions $ f: \mathbb{R}\to [1,\infty)$ for wich there exists $ a\in\mathbb{R}$ and a positive integer $ k$ such that \[ f(x)f(2x)\cdot...\cdot f(nx)\leq an^k\] for all real $ x$ and all positive integers $ n$. [i]author :Radu Gologan[/i]

Let $n$ be a given natural number. Determine the number of all orderer triples $(x, y, z)$ of non-negative integers $x, y, z$ that satisfy the equation $$x + 2y + 5z=10n.$$

Let be areal number $ r, $ a nonconstant and continuous function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ with period $ T $ and $ F $ be its primitive having $ F(0)=0. $ Define the funtion $ g:\mathbb{R}\longrightarrow\mathbb{R} $ as $$ g(x)=\left\{\begin{matrix} f(1/x), & x\neq 0 \\ r, & x=0 \end{matrix}\right. $$ Prove that: [b]a)[/b] the image of $ f $ is closed. [b]b)[/b] $ g $ has the intermediate value property if and only if $ r\in f\left(\mathbb{R}\right) . $ [b]c)[/b] $ g $ is primitivable if and only if $ r=\frac{F(T)}{T} . $

Prove that the set $\{1, 2, \cdots, 2007\}$ can be expressed as the union of disjoint subsets $A_i$ for $i=1,2,\cdots, 223$ such that each $A_i$ contains nine elements and the sum of all the elements in each $A_i$ is the same.

A [i]self-avoiding rook walk[/i] on a chessboard (a rectangular grid of unit squares) is a path traced by a sequence of moves parallel to an edge of the board from one unit square to another, such that each begins where the previous move ended and such that no move ever crosses a square that has previously been crossed, i.e., the rook's path is non-self-intersecting. Let $ R(m, n)$ be the number of self-avoiding rook walks on an $ m \times n$ ($ m$ rows, $ n$ columns) chessboard which begin at the lower-left corner and end at the upper-left corner. For example, $ R(m, 1) \equal{} 1$ for all natural numbers $ m$; $ R(2, 2) \equal{} 2$; $ R(3, 2) \equal{} 4$; $ R(3, 3) \equal{} 11$. Find a formula for $ R(3, n)$ for each natural number $ n$.

In a triangle $ABC$, the bisector of $\angle BAC$ meets the side $BC$ at the point $D$. Knowing that $|BD|\cdot |CD|=|AD|^2$ and $\angle ADB=45^{\circ}$, determine the angles of triangle $ABC$.

You want to paint some edges of a regular dodecahedron red so that each face has an even number of painted edges (which can be zero). Determine from How many ways this coloration can be done. Note: A regular dodecahedron has twelve pentagonal faces and in each vertex concur three edges. The edges of the dodecahedron are all different for the purpose of the coloring . In this way, two colorings are the same only if the painted edges they are the same.

In a plane we have $n$ lines, no two of which are parallel or perpendicular, and no three of which are concurrent. A cartesian system of coordinates is chosen for the plane with one of the lines as the $x$-axis. A point $P$ is located at the origin of the coordinate system and starts moving along the positive $x$-axis with constant velocity. Whenever $P$ reaches the intersection of two lines, it continues along the line it just reached in the direction that increases its $x$-coordinate. Show that it is possible to choose the system of coordinates in such a way that $P$ visits points from all $n$ lines.

Prove that for any triangle the equation holds $a \cdot \cos (\beta + \gamma ) + b \cdot \cos (\gamma +\alpha) + c\cdot \cos (\alpha -\beta) = 0$, where $a, b, c$ are the sides of the triangle and $\alpha, \beta,\gamma$ according to their angles sizes of opposite angles.

Let $a,b,c,d,e$ be nonnegative integers such that $625a+250b+100c+40d+16e=15^3$. What is the maximum possible value of $a+b+c+d+e$?

Let $AA_1$ and $CC_1$ be the altitudes of the acute-angled triangle $ABC$. Let $K,L$ and $M$ be the midpoints of the sides $AB,BC$ and $CA$ respectively. Prove that if $\angle C_1MA_1 =\angle ABC$, then $C_1 K = A_1L$.

Evaluate $ \int_{\sqrt{2}\minus{}1}^{\sqrt{2}\plus{}1} \frac{x^4\plus{}x^2\plus{}2}{(x^2\plus{}1)^2}\ dx.$