If $p(x)$ is a polynomial with integer coeffcients, let $q(x) = \frac{p(x)}{x(1-x)}$ . If $q(x) = q\left(\frac{1}{1-x}\right)$ for every $x \ne 0$, and $p(2) = -7, p(3) = -11$, find $p(10)$.

Let ABC be a triangle and $M$ be an interior point. Prove that \[ \min\{MA,MB,MC\}+MA+MB+MC<AB+AC+BC.\]

The excircle $\omega_B$ of triangle $ABC$ opposite $B$ touches side $AC$, rays $BA$ and $BC$ at $B_1, C_1$ and $A_1$, respectively. Point $D$ lies on major arc $A_1C_1$ of $\omega_B$. Rays $DA_1$ and $C_1B_1$ meet at $E$. Lines $AB_1$ and $BE$ meet at $F$. Prove that line $FD$ is tangent to $\omega_B$ (at $D$).

[b]2.[/b] Show that a ring $R$ has a unit element if and only if any $R$-module $G$ can be written as a direct sum of $RG$ and of the trivial submodule of $G$. (An $R$-module is a linear space with $R$ as its scalar domain. $RG$ denotes the submodule generated by the elements of the form $rg$($r \in R, g \in G$). The trivial submodule of $G$ consists of the elements $g$ of $G$ for which $rg=0$ holds for every $r \in R$.) [b](A. 20)[/b]

Let $p> 3$ be a prime number and let $q = \frac{4^p-1}{3}$. Show that $q$ is a composite integer as well is a divisor of $2^{q-1}- 1$.

There are $64$ booths around a circular table and on each one there is a chip. The chips and the corresponding booths are numbered $1$ to $64$ in this order. At the center of the table there are $1996$ light bulbs which are all turned off. Every minute the chips move simultaneously in a circular way (following the numbering sense) as follows: chip $1$ moves one booth, chip $2$ moves two booths, etc., so that more than one chip can be in the same booth. At any minute, for each chip sharing a booth with chip $1$ a bulb is lit. Where is chip $1$ on the first minute in which all bulbs are lit?

Let $A= \{a_1,a_2, \cdots, a_n \}$ and $B=\{b_1,b_2 \cdots, b_n \}$ be two positive integer sets and $|A \cap B|=1$. $C= \{ \text{all the 2-element subsets of A} \} \cup \{ \text{all the 2-element subsets of B} \}$. Function $f: A \cup B \to \{ 0, 1, 2, \cdots 2 C_n^2 \}$ is injective. For any $\{x,y\} \in C$, denote $|f(x)-f(y)|$ as the $\textsl{mark}$ of $\{x,y\}$. If $n \geq 6$, prove that at least two elements in $C$ have the same $\textsl{mark}$.

Let two natural number $n > 1$ and $m$ be given. Find the least positive integer $k$ which has the following property: Among $k$ arbitrary integers $a_1, a_2, \ldots, a_k$ satisfying the condition $a_i - a_j$ ( $1 \leq i < j \leq k$) is not divided by $n$, there exist two numbers $a_p, a_s$ ($p \neq s$) such that $m + a_p - a_s$ is divided by $n$.

Let $A_1, A_2, ... , A_k$ be the subsets of $\left\{1,2,3,...,n\right\}$ such that for all $1\leq i,j\leq k$:$A_i\cap A_j \neq \varnothing$. Prove that there are $n$ distinct positive integers $x_1,x_2,...,x_n$ such that for each $1\leq j\leq k$: $$lcm_{i \in A_j}\left\{x_i\right\}>lcm_{i \notin A_j}\left\{x_i\right\}$$ [i]Proposed by Morteza Saghafian, Mahyar Sefidgaran[/i]

Mr. Fat and Ms. Taf play a game. Mr. Fat chooses a sequence of positive integers $ k_1, k_2, \ldots , k_n$. Ms. Taf must guess this sequence of integers. She is allowed to give Mr. Fat a red card and a blue card, each with an integer written on it. Mr. Fat replaces the number on the red card with $ k_1$ times the number on the red card plus the number on the blue card, and replaces the number on the blue card with the number originally on the red card. He repeats this process with number $ k_2$. (That is, he replaces the number on the red card with $ k_2$ times the number now on the red card plus the number now on the blue card, and replaces the number on the blue card with the number that was just placed on the red card.) He then repeats this process with each of the numbers $ k_3, \ldots k_n$, in this order. After has has gone through the sequence of integers, Mr. Fat then gives the cards back to Ms. Taf. How many times must Ms. Taf submit the red and blue cards in order to be able to determine the sequence of integers $ k_1, k_2, \ldots k_n$?

A regular tetrahedron with unit edge length is given. Prove that: (a) There exist four points on the surface $S$ of the tetrahedron, such that the distance from any point of the surface to one of these four points does not exceed $1/2$; (b) There do not exist three points with this property. The distance between two points on surface $S$ is defined as the length of the shortest polygonal line going over $S$ and connecting the two points.

Prove that the distance between the midpoint of side $BC$ of triangle $ABC$ and the midpoint of the arc $ABC$ of its circumscribed circle is not less than $AB / 2$

In a quadrilateral \(ABCD\), it is known that \(\angle ABC = \angle ADC = 90^{\circ}\). On the ray \(AB\) beyond point \(B\), a point \(K\) is chosen such that \(\angle AKD = \angle ADB\). Point \(L\) is the projection of point \(K\) onto the line \(AD\), and point \(N\) is the projection of point \(D\) onto the line \(CL\). Find the degree measure of \(\angle ANK\). [i]Proposed by Mykhailo Shtandenko[/i]

Prove that a circle centered at point $(\sqrt{2},\sqrt{3})$ in the cartesian plane passes through at most one point with integer coordinates. I tried to prove that any circle with center at $(0,0)$ has at most one point with coordinates $(a-\sqrt{2},b-\sqrt{3})$;$a,b \in \mathbb{Z}$. So that when we translate the center to $(\sqrt{2},\sqrt{3})$ we have what we wanted to show.

Solve in $ \mathbb R$ the equation $ \sqrt{1\minus{}x}\equal{}2x^2\minus{}1\plus{}2x\sqrt{1\minus{}x^2}$.

Let $n$ be a positive integer and let $a_1, a_2, \ldots, a_n$ be positive reals. Show that $$\sum_{i=1}^{n} \frac{1}{2^i}(\frac{2}{1+a_i})^{2^i} \geq \frac{2}{1+a_1a_2\ldots a_n}-\frac{1}{2^n}.$$