Balls of $3$ colours — red, blue and white — are placed in two boxes. If you take out $3$ balls from the first box, there would definitely be a blue one among them. If you take out $4$ balls from the second box, there would definitely be a red one among them. If you take out any $5$ balls (only from the first, only from the second, or from two boxes at the same time), then there would definitely be a white ball among them. Find the greatest possible total number of balls in two boxes.

Find all functions $f:\mathbb{N}\rightarrow\mathbb{N}$ such that for every positive integer $n$ the following is valid: If $d_1,d_2,\ldots,d_s$ are all the positive divisors of $n$, then $$f(d_1)f(d_2)\ldots f(d_s)=n.$$

Equilateral $\triangle ABC$ with side length $14$ is rotated about its center by angle $\theta$, where $0 < \theta < 60^{\circ}$, to form $\triangle DEF$. The area of hexagon $ADBECF$ is $91\sqrt{3}$. What is $\tan\theta$? [asy] defaultpen(fontsize(13)); size(200); pair O=(0,0),A=dir(225),B=dir(-15),C=dir(105),D=rotate(38.21,O)*A,E=rotate(38.21,O)*B,F=rotate(38.21,O)*C; draw(A--B--C--A,gray+0.4);draw(D--E--F--D,gray+0.4); draw(A--D--B--E--C--F--A,black+0.9); dot(O); dot("$A$",A,dir(A)); dot("$B$",B,dir(B)); dot("$C$",C,dir(C)); dot("$D$",D,dir(D)); dot("$E$",E,dir(E)); dot("$F$",F,dir(F)); [/asy] $\textbf{(A)}~\displaystyle\frac{3}{4}\qquad\textbf{(B)}~\displaystyle\frac{5\sqrt{3}}{11}\qquad\textbf{(C)}~\displaystyle\frac{4}{5}\qquad\textbf{(D)}~\displaystyle\frac{11}{13}\qquad\textbf{(E)}~\displaystyle\frac{7\sqrt{3}}{13}$

Let $ABCD$ and $AEFG$ be two similar cyclic quadrilaterals (with the vertices denoted counterclockwise). Their circumcircles intersect again at point $P$. Prove that $P$ lies on line $BE$.

Let $ABCD$ be a parallelogram. A variable line $g$ through the vertex $A$ intersects the rays $BC$ and $DC$ at the points $X$ and $Y$, respectively. Let $K$ and $L$ be the $A$-excenters of the triangles $ABX$ and $ADY$. Show that the angle $\measuredangle KCL$ is independent of the line $g$. [i]Proposed by Vyacheslev Yasinskiy, Ukraine[/i]

The sides of a triangle are $25,39,$ and $40$. The diameter of the circumscribed circle is: $ \textbf{(A)}\ \frac{133}{3}\qquad\textbf{(B)}\ \frac{125}{3}\qquad\textbf{(C)}\ 42\qquad\textbf{(D)}\ 41\qquad\textbf{(E)}\ 40 $

Given two positive integers $a$ and $b$, an [i]legal move[/i] consists in choosing a proper divisor of one of them and adding it to $a$ or adding it to $b$. Two players, Agustin and Ian, take turns making an legal move; Agustin plays first. Whoever gets a number greater than or equal to $2015$ wins the game. [list=a] [*]Determine which of the players has a winning strategy if $a=3, b=5$. [*]Determine which of the players has a winning strategy if $a=6, b=7$. [/list]

Define $ f(n) = \dfrac{n^2 + n}{2} $. Compute the number of positive integers $ n $ such that $ f(n) \leq 1000 $ and $ f(n) $ is the product of two prime numbers.

Let $\ell$ be a line and $P$ be a point in $\mathbb{R}^3$. Let $S$ be the set of points $X$ such that the distance from $X$ to $\ell$ is greater than or equal to two times the distance from $X$ to $P$. If the distance from $P$ to $\ell$ is $d>0$, find $\text{Volume}(S)$.

In how many ways rooks can be placed on a $8$ by $8$ chess board such that every row and every column has at least one rook? (Any number of rooks are available,each square can have at most one rook and there is no relation of attacking between them)

Let $ABCDEF$ be a regular hexagon of side lengths $1$ and $O$ its centre, Join $O$ cto each of the six vertices , thus getting $12$ unit line segments in all. Find the number of closed paths from (i) $O$ to $O$ (ii) $A$ to $A$ each of length $2004$

Let $ n$ be a positive integer. Given an integer coefficient polynomial $ f(x)$, define its [i]signature modulo $ n$[/i] to be the (ordered) sequence $ f(1), \ldots , f(n)$ modulo $ n$. Of the $ n^n$ such $ n$-term sequences of integers modulo $ n$, how many are the signature of some polynomial $ f(x)$ if a) $ n$ is a positive integer not divisible by the square of a prime. b) $ n$ is a positive integer not divisible by the cube of a prime.

The four points $A(-1,2), B(3,-4), C(5,-6),$ and $D(-2,8)$ lie in the coordinate plane. Compute the minimum possible value of $PA + PB + PC + PD$ over all points P .

Find all pairs of integers, $n$ and $k$, $2 < k < n$, such that the binomial coefficients \[\binom{n}{k-1}, \binom{n}{k}, \binom{n}{k+1}\] form an increasing arithmetic series.

Let $A,B,C,D$ be the vertices of a rhombus, let $k_1$ be the circle through $B,C$ and $D$, let $k_2$ be the circle through $A,C$ and $D$, let $k_3$ be the circle through $A,B$ and $D$, let $k_4$ be the circle through $A,B$ and $C$. Prove that the tangents to $k_1$ and $k_3$ at $B$ form the same angle as the tangents to $k_2$ and $k_4$ at $A$.

There $100$ people seated at a round table $50$ women and $50$ men. Show that there are two people of opposite gender that stay between two people of opposite gender. (WWMM, MMWW, WMWM, MWMW)

An equilateral triangle with integer side length $n$ is subdivided into smaller equilateral triangles of side length $1$ by drawing lines parallel to its sides, as shown in the figure for $n = 4$. [asy] size(5cm); // Function to draw an equilateral triangle with subdivisions and mark vertices void drawTriangleWithDots(pair A, pair B, pair C, int n) { real step = 1.0 / n; // Draw horizontal lines for (int i = 0; i <= n; ++i) { pair start = A + i * step * (C - A); pair end = start + i * step * (B - C); draw(start -- end, gray(0.5)); } // Draw left-leaning diagonal lines for (int i = 0; i <= n; ++i) { pair start = A + i * step * (B - A); pair end = start + (n - i) * step * (C - A); draw(start -- end, gray(0.5)); } // Draw right-leaning diagonal lines for (int i = 0; i <= n; ++i) { pair start = B + i * step * (C - B); pair end = start + (n - i) * step * (A - B); draw(start -- end, gray(0.5)); } // Mark dots at all vertices for (int i = 0; i <= n; ++i) { for (int j = 0; j <= i; ++j) { pair vertex = A + i * step * (C - A) + j * step * (B - C); dot(vertex, black); } } // Draw the outer triangle draw(A -- B -- C -- cycle, black+linewidth(1)); } // Main triangle vertices pair A = (0, 0); pair B = (4, 0); pair C = (2, 3.464); // Height = sqrt(3)/2 * side length // Subdivisions int n = 4; // Draw the subdivided equilateral triangle with dots drawTriangleWithDots(A, B, C, n); [/asy] Consider the set $A$ consisting of all points that are vertices of any of these smaller triangles. A [i]subtriangle[/i] is defined as any equilateral triangle whose three vertices belong to the set $A$ and whose three sides lie along the lines of the initial subdivision. We wish to color all points in $A$ either red or blue such that no subtriangle has all three vertices of the same color. Let $C(n)$ denote the number of such valid colorings for each positive integer $n$. Calculate, in terms of $n$, the value of $C(n)$.

The point $P$ lies inside $\vartriangle ABC$ so that $\vartriangle BPC$ is isosceles, and angle $P$ is a right angle. Furthermore both $\vartriangle BAN$ and $\vartriangle CAM$ are isosceles with a right angle at $A$, and both are outside $\vartriangle ABC$. Show that $\vartriangle MNP$ is isosceles and right-angled. [img]https://1.bp.blogspot.com/-i9twOChu774/XzcBLP-RIXI/AAAAAAAAMXA/n5TJCOJypeMVW28-9GDG4st5C47yhvTCgCLcBGAsYHQ/s0/2005%2BMohr%2Bp3.png[/img]

How many positive three-digit integers have a remainder of 2 when divided by 6, a remainder of 5 when divided by 9, and a remainder of 7 when divided by 11? $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad \textbf{(E) }5$

Let $d_n$ be the last nonzero digit of the decimal representation of $n!$. Prove that $d_n$ is aperiodic; that is, there do not exist $T$ and $n_0$ such that for all $n \geq n_0, d_{n+T} = d_n.$

Segment $AB$ on the surface of the cube is the shortest polyline on the surface that connects $A$ and $B$. Triangle $ABC$ consisted of such segments $AB, BC,CA$. What may be the sum of angles of such triangle if none of the vertex is on the edge of the cube ?

As shown in the figure, $BQ$ is a diameter of the circumcircle of $ABC$, and $D$ is the midpoint of arc $BC$ (excluding point $A$) . The bisector of the exterior angle of $\angle BAC$ intersects and the extension of $BC$ at point $E$. The ray $EQ$ intersects $\odot (ABC)$ at point $P$. Point $S$ lies on $PQ$ so that $SA = SP$. Point $T$ lies on $BC$ such that $TB = TD$. Prove that $TS \perp SE$. [img]https://cdn.artofproblemsolving.com/attachments/c/4/01460565e70b32b29cddb65d92e041bea40b25.png[/img]

Determine the largest positive integer that is a divisor of all three of $A=2^{2010}\times3^{2010}, B=3^{2010}\times5^{2010},$ and $C=5^{2010}\times2^{2010}.$

Peter made a paper rectangle, put it on an identical rectangle and pasted both rectangles along their perimeters. Then he cut the upper rectangle along one of its diagonals and along the perpendiculars to this diagonal from two remaining vertices. After this he turned back the obtained triangles in such a way that they, along with the lower rectangle form a new rectangle. Let this new rectangle be given. Restore the original rectangle using compass and ruler.

Find a function $f: \mathbb N \to \mathbb N$ such that for all positive integers $n$, \[ f(f(n))\equal{}n^2.\]