Suppose that $a, b, c, k$ are natural numbers with $a, b, c \ge 3$ which fulfill the equation $abc = k^2 + 1$. Show that at least one between $a - 1, b - 1, c -1$ is composite number.

Find all primes $p \geq 3$ with the following property: for any prime $q<p$, the number \[ p - \Big\lfloor \frac{p}{q} \Big\rfloor q \] is squarefree (i.e. is not divisible by the square of a prime).

The ratio of boys to girls in Mr. Brown's math class is $ 2: 3$. If there are $ 30$ students in the class, how many more girls than boys are in the class? \[ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 10 \]

A graph has $ 30$ vertices, $ 105$ edges and $ 4822$ unordered edge pairs whose endpoints are disjoint. Find the maximal possible difference of degrees of two vertices in this graph.

Let $ABC$ be a triangle. The inside bisector of the angle $\angle BAC$ cuts $[BC]$ in $L$ and the circle $(C)$ circumsbribed to the triangle $ABC$ in $D$. The perpendicular to $(AC)$ going through $D$ cuts $[AC]$ in $M$ and the circle $(C)$ in $K$. Find the value of $\frac{AM}{MC}$ knowing that $\frac{BL}{LC}=\frac{1}{2}$.

Roy is starting a baking company and decides that he will sell cupcakes. He sells $n$ cupcakes for $(n + 20)(n + 15)$ cents. A man walks in and buys $\$10.50$ worth of cupcakes. Roy bakes cupcakes at a rate of $10$ cupcakes an hour. How many minutes will it take Roy to complete the order?

Find the number of integers between $1$ and $200$ inclusive whose distinct prime divisors sum to $16$. (For example, the sum of the distinct prime divisors of $12$ is $2 + 3 = 5$.) In this section, the word [i]divisor [/i]is used to refer to a [i]positive divisor[/i] of an integer.

Let $B\not= A$ be a point on the tangent to circle $S_1$ through the point $A$ on the circle. A point $C$ outside the circle is chosen so that segment $AC$ intersects the circle in two distinct points. Let $S_2$ be the circle tangent to $AC$ at $C$ and to $S_1$ at some point $D$, where $D$ and $B$ are on the opposite sides of the line $AC$. Let $O$ be the circumcentre of triangle $BCD$. Show that $O$ lies on the circumcircle of triangle $ABC$.

Billy's basketball team scored the following points over the course of the first 11 games of the season: \[42, 47, 53, 53, 58, 58, 58, 61, 64, 65, 73\] If his team scores 40 in the 12th game, which of the following statistics will show an increase? $ \textbf{(A) } \text{range} \qquad \textbf{(B) } \text{median} \qquad \textbf{(C) } \text{mean} \qquad \textbf{(D) } \text{mode} \qquad \textbf{(E) } \text{mid-range} $

For a triangle $\vartriangle ABC$, determine whether or not there exists a point $P$ on the interior of $\vartriangle ABC$ in such a way that every straight line through $P$ divides the triangle $\vartriangle ABC$ in two polygons of equal area.

suppose that $\mathcal F\subseteq p(X)$ and $|X|=n$. we know that for every $A_i,A_j\in \mathcal F$ that $A_i\supseteq A_j$ we have $3\le |A_i|-|A_j|$. prove that: $|\mathcal F|\le \lfloor\frac{2^n}{3}+\frac{1}{2}\dbinom{n}{\lfloor\frac{n}{2}\rfloor}\rfloor$ (20 points)

Let $d \geq 2$ be a positive integer. Define the sequence $a_1,a_2,\dots$ by $$a_1=1 \ \text{and} \ a_{n+1}=a_n^d+1 \ \text{for all }n\geq 1.$$ Determine all pairs of positive integers $(p, q)$ such that $a_p$ divides $a_q$.

Let M = 7!.8!.9!.10!.11!.12!. How many factors of M are perfect squares ?

Let $n$ be a natural number. A tiling of a $2n \times 2n$ board is a placing of $2n^2$ dominos (of size $2 \times 1$ or $1 \times 2$) such that each of them covers exactly two squares of the board and they cover all the board.Consider now two [i]sepearate tilings[/i] of a $2n \times 2n$ board: one with red dominos and the other with blue dominos. We say two squares are red neighbours if they are covered by the same red domino in the red tiling; similarly define blue neighbours. Suppose we can assign a non-zero integer to each of the squares such that the number on any square equals the difference between the numbers on it's red and blue neighbours i.e the number on it's red neigbhbour minus the number on its blue neighbour. Show that $n$ is divisible by $3$ [i] Proposed by Tejaswi Navilarekallu [/i]

Let $x_1,x_2,\ldots,x_n$ be real numbers satisfying $x_1^2+x_2^2+\ldots+x_n^2=1$. Prove that for every integer $k\ge2$ there are integers $a_1,a_2,\ldots,a_n$, not all zero, such that $|a_i|\le k-1$ for all $i$, and $|a_1x_1+a_2x_2+\ldots+a_nx_n|\le{(k-1)\sqrt n\over k^n-1}$. [i](IMO Problem 3)[/i] [i]Proposed by Germany, FR[/i]

If the base of a rectangle is increased by $ 10\%$ and the area is unchanged, then the altitude is decreased by: $ \textbf{(A)}\ 9\% \qquad\textbf{(B)}\ 10\% \qquad\textbf{(C)}\ 11\% \qquad\textbf{(D)}\ 11\frac {1}{9}\% \qquad\textbf{(E)}\ 9\frac {1}{11}\%$

Convex pentagon $ABCDE$ has the property that $\angle ADB = 20^o$, $\angle BEC = 16^o$, $\angle CAD = 3^o$,and $\angle DBE = 12^o$. What is the measure of $\angle ECA$?

Let $n$ be a positive integer. From the set $A=\{1,2,3,...,n\}$ an element is eliminated. What's the smallest possible cardinal of $A$ and the eliminated element, since the arithmetic mean of left elements in $A$ is $\frac{439}{13}$.

Given $n$ nonintersecting segments in the plane. Not a pair of those belong to the same straight line. We want to add several segments, connecting the ends of given ones, to obtain one nonselfintersecting broken line. Is it always possible?

Let there be a triangle $\triangle ABC$ with $BC=a$, $CA=b$, $AB=c$. Let $T$ be a point not inside $\triangle ABC$ and on the same side of $A$ with respect to $BC$, such that $BT-CT=c-b$. Let $n=BT$ and $m=CT$. Find the point $P$ that minimizes $f(P)=-a \cdot AP + m \cdot BP + n \cdot CP$.

Compare the number of distinct prime divisors of $200^2 \cdot 201^2 \cdot ... \cdot 900^2$ and $(200^2 -1)(201^2 -1)\cdot ... \cdot (900^2 -1) .$

Given a convex pentagon $ ABCDE. $ Let $ A_1 $ be the intersection of $ BD $ with $ CE $ and define $ B_1, C_1, D_1, E_1 $ similarly, $ A_2 $ be the second intersection of $ \odot (ABD_1),\odot (AEC_1) $ and define $ B_2, C_2, D_2, E_2 $ similarly. Prove that $ AA_2, BB_2, CC_2, DD_2, EE_2 $ are concurrent. [i]Proposed by Telv Cohl[/i]

Find all odd prime $p$ such that $1+k(p-1)$ is prime for all integer $k$ where $1 \le k \le \dfrac{p-1}{2}$.

$(POL 2)$ Given two segments $AB$ and $CD$ not in the same plane, find the locus of points $M$ such that $MA^2 +MB^2 = MC^2 +MD^2.$

Number $a$ is such that $\forall a_1, a_2, a_3, a_4 \in \mathbb{R}$, there are integers $k_1, k_2, k_3, k_4$ such that $\sum_{1 \leq i < j \leq 4} ((a_i - k_i) - (a_j - k_j))^2 \leq a$. Find the minimum of $a$.