The incircle of a triangle $ABC$ touches the sides $BC,CA,AB$ at points $D,E,F$, respectively. Let $X$ be a point on the incircle, different from the points $D,E,F$. The lines $XD$ and $EF,XE$ and $FD,XF$ and $DE$ meet at points $J,K,L$, respectively. Let further $M,N,P$ be points on the sides $BC,CA,AB$, respectively, such that the lines $AM,BN,CP$ are concurrent. Prove that the lines $JM,KN$ and $LP$ are concurrent. [i]Dinu Serbanescu[/i]

Determine a quadric polynomial with intergral coefficients whose roots are $\cos 72^{\circ}$ and $\cos 144^{\circ}.$

Alice and Bob play a game in which they take turns removing stones from a heap that initially has $n$ stones. The number of stones removed at each turn must be one less than a prime number. The winner is the player who takes the last stone. Alice plays first. Prove that there are infinitely many such $n$ such that Bob has a winning strategy. (For example, if $n=17,$ then Alice might take $6$ leaving $11;$ then Bob might take $1$ leaving $10;$ then Alice can take the remaining stones to win.)

Given a fixed positive integer $a\geq 9$. Prove: There exist finitely many positive integers $n$, satisfying: (1)$\tau (n)=a$ (2)$n|\phi (n)+\sigma (n)$ Note: For positive integer $n$, $\tau (n)$ is the number of positive divisors of $n$, $\phi (n)$ is the number of positive integers $\leq n$ and relatively prime with $n$, $\sigma (n)$ is the sum of positive divisors of $n$.

In the quadrilateral $ABCD$, we have $AB = AD$ and $\angle B = \angle D = 90 ^ \circ $. The points $P$ and $Q $ lie on $BC$ and $CD$, respectively, so that $AQ$ is perpendicular on $DP$. Prove that $AP$ is perpendicular to $BQ$.

$[x,y]-[x,z]=y-z$ and $x \neq y \neq z \neq x$ Prove, that $x|y,x|z$

Nine chairs in a row are to be occupied by six students and Professors Alpha, Beta and Gamma. These three professors arrive before the six students and decide to choose their chairs so that each professor will be between two students. In how many ways can Professors Alpha, Beta and Gamma choose their chairs? $ \textbf{(A)}\ 12 \qquad\textbf{(B)}\ 36 \qquad\textbf{(C)}\ 60 \qquad\textbf{(D)}\ 84 \qquad\textbf{(E)}\ 630 $

For any integers $1\leq n\leq m\leq5$, how many hyperbolas does the equation $\rho=\frac{1}{1-\text{C}_m^n \cos\theta}$ represent? Note: $\text{C}_m^n=\frac{m!}{n!(m-n)!}$. $\text{(A)}15\qquad\text{(B)}10\qquad\text{(C)}7\qquad\text{(D)}6$

Mr. Schwartz has been hired to paint a row of 7 houses. Each house must be painted red, blue, or green. However, to make it aesthetically pleasing, he doesn't want any three consecutive houses to be the same color. Find the number of ways he can fulfill his task. [i]Proposed by Daniel Monroe[/i]

Show that for any $a,b,c$ positive reals, \[ (a+b)(a+c) \geq 2 \sqrt{abc(a+b+c)} \]

The square $0\le x\le 1$, $0\le y\le 1$ is drawn in the plane $Oxy$. A grasshopper sitting at a point $M$ with noninteger coordinates outside this square jumps to a new point which is symmetrical to $M$ with respect to the leftmost (from the grasshopper’s point of view) vertex of the square. Prove that no matter how many times the grasshopper jumps, it will never reach the distance more than $10 d$ from the center $C$ of the square, where $d$ is the distance between the initial position $M$ and the center $C$. (A Kanel)

Let $P$ be the set of positive integers that are prime numbers. Find the number of subsets of $P$ that have the property that the sum of their elements is $34$ such as $\{3, 31\}$.

Determine the smallest integer of the form $\frac{ \overline{AB}}{B}$ .where $A$ and $B$ are three-digit positive integers and $\overline{AB}$ denotes the six-digit number that is form by writing the numbers $A$ and $B$ consecutively.

Let $a,b,c,d$ be positive integers satisfying \[\frac{ab}{a+b}+\frac{cd}{c+d}=\frac{(a+b)(c+d)}{a+b+c+d}.\] Determine all possible values of $a+b+c+d$.

Find the remainder when \[9 \times 99 \times 999 \times \cdots \times \underbrace{99\cdots9}_{\text{999 9's}}\] is divided by $ 1000$.

Let $P$ be the set of prime numbers. Consider a subset $M$ of $P$ with at least three elements. We assume that, for each non empty and finite subset $A$ of $M$, with $A \neq M$, the prime divisors of the integer $( \prod_{p \in A} ) - 1$ belong to $M$. Prove that $M = P$.

Let $x,y$ be distinct real numbers such that $\frac{x^n-y^n}{x-y}$ is an integer for $4$ consecutive positive integer $n$. Prove that $\frac{x^n-y^n}{x-y}$ is an integer for all positive integers $n$.

An entry in a grid is called a [i]saddle [/i] point if it is the largest number in its row and the smallest number in its column. Suppose that each cell in a $ 3 \times 3$ grid is filled with a real number, each chosen independently and uniformly at random from the interval $[0, 1]$. Compute the probability that this grid has at least one saddle point.

A positive integer $n$ is called[i] bad [/i]if it cannot be expressed as the product of two distinct positive integers greater than $1$. Find the number of bad positive integers less than $100. $ [i]Proposed by Michael Ren[/i]

Find all integers $k$, such that there exists an integer sequence ${\{a_n\}}$ satisfies two conditions below (1) For all positive integers $n$,$a_{n+1}={a_n}^3+ka_n+1$ (2) $|a_n| \leq M$ holds for some real $M$

Four coins are picked out of a piggy bank that contains a collection of pennies, nickels, dimes, and quarters. Which of the following could [i]not[/i] be the total value of the four coins, in cents? $ \textbf{(A)}\ 15 \qquad \textbf{(B)}\ 25 \qquad \textbf{(C)}\ 35 \qquad \textbf{(D)}\ 45 \qquad \textbf{(E)}\ 55$

Alphonse and Beryl play a game starting with a blank blackboard. Alphonse goes first and the two players alternate turns. On Alphonse's first turn, he writes the integer $10^{2011}$ on the blackboard. On each subsequent turn, each player can do exactly one of the following two things: [b](i)[/b] replace any number $x$ that is currently on the blackboard with two integers a and b greater than $1$ such that $x = ab,$ or [b](ii)[/b] erase one or two copies of a number $y$ that appears at least twice on the blackboard. Thus, there may be many numbers on the board at any time. The first player who cannot do either of these things loses. Determine which player has a winning strategy and explain the strategy.

Let $S = \{1, 22, 333, \dots , 999999999\}$. For how many pairs of integers $(a, b)$ where $a, b \in S$ and $a < b$ is it the case that $a$ divides $b$?

The side lengths $a,b,c$ of a triangle $ABC$ are positive integers. Let:\\ \[T_{n}=(a+b+c)^{2n}-(a-b+c)^{2n}-(a+b-c)^{2n}+(a-b-c)^{2n}\] for any positive integer $n$. If $\frac{T_{2}}{2T_{1}}=2023$ and $a>b>c$ , determine all possible perimeters of the triangle $ABC$.

Determine all polynomials P(x) with real coefficients such that [(x + 1)P(x − 1) − (x − 1)P(x)] is a constant polynomial.