If $p$, $q$ and $r$ are nonzero rational numbers such that $\sqrt[3]{pq^2}+\sqrt[3]{qr^2}+\sqrt[3]{rp^2}$ is a nonzero rational number, prove that $\frac{1}{\sqrt[3]{pq^2}}+\frac{1}{\sqrt[3]{qr^2}}+\frac{1}{\sqrt[3]{rp^2}}$ is also a rational number.

Crisp All, a basketball player, is [i]dropping dimes[/i] and nickels on a number line. Crisp drops a dime on every positive multiple of $10$, and a nickel on every multiple of $5$ that is not a multiple of $10$. Crisp then starts at $0$. Every second, he has a $\frac{2}{3}$ chance of jumping from his current location $x$ to $x+3$, and a $\frac{1}{3}$ chance of jumping from his current location $x$ to $x+7$. When Crisp jumps on either a dime or a nickel, he stops jumping. What is the probability that Crisp [i]stops on a dime[/i]?

We have a positive integer $ n$ such that $ n \neq 3k$. Prove that there exists a positive integer $ m$ such that $ \forall_{k\in N \ k\geq m} \ k$ can be represented as a sum of digits of some multiplication of $ n$.

Let $T_1, T_2, T_3, T_4$ be pairwise distinct collinear points such that $T_2$ lies between $T_1$ and $T_3$, and $T_3$ lies between $T_2$ and $T_4$. Let $\omega_1$ be a circle through $T_1$ and $T_4$; let $\omega_2$ be the circle through $T_2$ and internally tangent to $\omega_1$ at $T_1$; let $\omega_3$ be the circle through $T_3$ and externally tangent to $\omega_2$ at $T_2$; and let $\omega_4$ be the circle through $T_4$ and externally tangent to $\omega_3$ at $T_3$. A line crosses $\omega_1$ at $P$ and $W$, $\omega_2$ at $Q$ and $R$, $\omega_3$ at $S$ and $T$, and $\omega_4$ at $U$ and $V$, the order of these points along the line being $P,Q,R,S,T,U,V,W$. Prove that $PQ + TU = RS + VW$ [i]Geza Kos, Hungary[/i]

Given a $m\times n$ grid rectangle with $m,n \ge 4$ and a closed path $P$ that is not self intersecting from inner points of the grid, let $A$ be the number of points on $P$ such that $P$ does not turn in them and let $B$ be the number of squares that $P$ goes through two non-adjacent sides of them furthermore let $C$ be the number of squares with no side in $P$. Prove that $$A=B-C+m+n-1.$$

Let $f$ be a function from the set $Q$ of the rational numbers onto itself such that $f(x+y)=f(x)+f(y)+2547$ for all rational numbers $x,y$. Moreover $f(2004) = 2547$. Determine $f(2547).$ Pierre.

Let $f(x)=ax^2+bx+c$, where $a,b,c$ are nonnegative real numbers, not all equal to zero. Prove that $f(xy)^2\le f(x^2)f(y^2)$ for all real numbers $x,y$.

Let $ABCD$ be a convex quadrilateral. It is known that $S_{ABD} = 7$, $S_{BCD}= 5$ and $S_{ABC}= 3$. Inside the quadrilateral mark the point $X$ so that $ABCX$ is a parallelogram. Find $S_{ADX}$ and $S_{BDX}$.

$ n\geq 4 $ points are given in a plane such that any 3 of them are not collinear. Prove that a triangle exist such that all the points are in its interior and there is exactly one point laying on each side.

An article costing $ C$ dollars is sold for $ \$100$ at a lostt of $ x$ percent of the selling price. It is then resold at a profit of $ x$ percent of the new selling price $ S'$. If the difference between $ S'$ and $ C$ is $ 1\frac {1}{9}$ dollars, then $ x$ is: $ \textbf{(A)}\ \text{undetermined} \qquad \textbf{(B)}\ \frac {80}{9} \qquad \textbf{(C)}\ 10 \qquad \textbf{(D)}\ \frac {95}{9} \qquad \textbf{(E)}\ \frac {100}{9}$

Ivan is playing Lego with $4n^2$ $1 \times 2$ blocks. First, he places $2n^2$ $1 \times 2$ blocks to fit a $2n \times 2n$ square as the bottom layer. Then he builds the top layer on top of the bottom layer using the remaining $2n^2$ $1 \times 2$ blocks. Note that the blocks in the bottom layer are connected to the blocks above it in the top layer, just like real Lego blocks. He wants the whole two-layered building to be connected and not in seperate pieces. Prove that if he can do so, then the four $1\times 2$ blocks connecting the four corners of the bottom layer, must be all placed horizontally or all vertically. [i]Proposed by Ivan Chan Kai Chin[/i]

An unfair coin lands on heads with a probability of $\tfrac{1}{4}$. When tossed $n$ times, the probability of exactly two heads is the same as the probability of exactly three heads. What is the value of $n$? $ \textbf {(A) } 5 \qquad \textbf {(B) } 8 \qquad \textbf {(C) } 10 \qquad \textbf {(D) } 11 \qquad \textbf {(E) } 13 $

Let $ABCD$ be an inscribed quadrilateral in a circle $c(O,R)$ (of circle $O$ and radius $R$). With centers the vertices $A,B,C,D$, we consider the circles $C_{A},C_{B},C_{C},C_{D}$ respectively, that do not intersect to each other . Circle $C_{A}$ intersects the sides of the quadrilateral at points $A_{1} , A_{2}$ , circle $C_{B}$ intersects the sides of the quadrilateral at points $B_{1} , B_{2}$ , circle $C_{C}$ at points $C_{1} , C_{2}$ and circle $C_{D}$ at points $C_{1} , C_{2}$ . Prove that the quadrilateral defined by lines $A_{1}A_{2} , B_{1}B_{2} , C_{1}C_{2} , D_{1}D_{2}$ is cyclic.

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.