Inside the parallelogram $ABCD$ are the circles $\gamma_1$ and $\gamma_2$, which are externally tangent at the point $K$. The circle $\gamma_1$ touches the sides $AD$ and $AB$ of the parallelogram, and the circle $\gamma_2$ touches the sides $CD$ and $CB$. Prove that the point $K$ lies on the diagonal $AC$ of the paralelogram.

Let $k$ and $n$ be positive integers, with $k \le n$. A certain class has n students, and among any $k$ of them there is always one that is friends with the other $k- 1$. Find all values of $k$ and $n$ for which there must necessarily be a student who is friends with everyone else in the class.

Alice refuses to sit next to either Bob or Carla. Derek refuses to sit next to Eric. How many ways are there for the five of them to sit in a row of $5$ chairs under these conditions? $\textbf{(A)}\ 12\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 28\qquad\textbf{(D)}\ 32\qquad\textbf{(E)}\ 40$

The natural number $n>1$ is called “heavy”, if it is coprime with the sum of its divisors. What’s the maximal number of consecutive “heavy” numbers?

Five people are sitting at a round table. Let $f \ge 0$ be the number of people sitting next to at least one female and $m \ge 0$ be the number of people sitting next to at least one male. The number of possible ordered pairs $(f,m)$ is $ \textbf{(A)}\ 7 \qquad\textbf{(B)}\ 8 \qquad\textbf{(C)}\ 9 \qquad\textbf{(D)}\ 10 \qquad\textbf{(E)}\ 11 $

The representation of real number $a$ as a decimal infinite fraction contain all $10$ digits. For a positive integer $n$ let $v_n$ be the number of all segments of length $n$ that occur. Prove that, if $v_n \leq n + 8$ for some positive integer $n$, then the number $a$ is rational.

Let $x, y, z$ be positive real numbers. Prove that $$4(x^2+y^2+z^2)\geq3(xy+yz+zx).$$

Let $T$ be a finite set of positive integers greater than 1. A subset $S$ of $T$ is called [i]good[/i] if for every $t \in T$ there exists some $s \in S$ with $\gcd(s, t) > 1$. Prove that the number of good subsets of $T$ is odd.

Let $a_1,a_2,\cdots ,a_n$ be $n$ positive numbers such that $\sum \limits_{i=1}^n\sqrt{a_i}=\sqrt{n}$. Then$$\prod \limits_{i=1}^{n-1}\left(1+\frac{1}{a_i}\right)^{a_{i+1}}\left(1+\frac{1}{a_n}\right)^{a_1}\geq 1+\frac{n}{\sum \limits_{i=1}^na_i}$$

Given is a set $A$ of $n$ elements and positive integers $k, m$ such that $4 \leq k <n$ and $m \leq \min \{k-3, \frac {n} {2}\}$. Let $A_1, A_2, \ldots, A_l$ be subsets of $A$, all with size $k$, such that $|A_i \cap A_j| \leq m$ for all $i \neq j$. Prove that there exists a subset $B$ of $A$ with at least $\sqrt[m+1]{n}+m$ elements which doesn't contain entirely any of the subsets $A_1, A_2, \ldots, A_l$.

Define the function $f_1$ on the positive integers by setting $f_1(1)=1$ and if $n=p_1^{e_1}p_2^{e_2}...p_k^{e_k}$ is the prime factorization of $n>1$, then \[f_1(n)=(p_1+1)^{e_1-1}(p_2+1)^{e_2-1}\cdots (p_k+1)^{e_k-1}.\] For every $m \ge 2$, let $f_m(n)=f_1(f_{m-1}(n))$. For how many $N$ in the range $1 \le N \le 400$ is the sequence $(f_1(N), f_2(N), f_3(N),...)$ unbounded? [b]Note:[/b] a sequence of positive numbers is unbounded if for every integer $B$, there is a member of the sequence greater than $B$. $ \textbf{(A)}\ 15 \qquad\textbf{(B)}\ 16 \qquad\textbf{(C)}\ 17 \qquad\textbf{(D)}\ 18\qquad\textbf{(E)}\ 19 $

We call the sequence $d_1,....,d_n$ of natural numbers, not necessarily distinct, [b]covering[/b] if there exists arithmetic progressions like $c_1+kd_1$,....,$c_n+kd_n$ such that every natural number has come in at least one of them. We call this sequence [b]short[/b] if we can not delete any of the $d_1,....,d_n$ such that the resulting sequence be still covering. [b]a)[/b] Suppose that $d_1,....,d_n$ is a short covering sequence and suppose that we've covered all the natural numbers with arithmetic progressions $a_1+kd_1,.....,a_n+kd_n$, and suppose that $p$ is a prime number that $p$ divides $d_1,....,d_k$ but it does not divide $d_{k+1},....,d_n$. Prove that the remainders of $a_1,....,a_k$ modulo $p$ contains all the numbers $0,1,.....,p-1$. [b]b)[/b] Write anything you can about covering sequences and short covering sequences in the case that each of $d_1,....,d_n$ has only one prime divisor. [i]proposed by Ali Khezeli[/i]

Define a sequence of functions recursively by $f_1(x) = |x-1|$ and $f_n(x)=f_{n-1}(|x-n|)$ for integers $n > 1$. Find the least value of $n$ such that the sum of the zeros of $f_n$ exceeds $500{,}000$.

The function $f: \mathbb{R}\rightarrow \mathbb{R}$ is such that $f(x+1)=2f(x)$ for $\forall$ $x\in \mathbb{R}$ and $f(x)=x(x-1)$ for $\forall$ $x\in (0,1]$. Find the greatest real number $m$, for which the inequality $f(x)\geq -\frac{8}{9}$ is true for $\forall$ $x\in (-\infty , m]$.

Find all triples $ (x,y,z)$ of positive real numbers which satisfy $ 2x^3 \equal{} 2y(x^2 \plus{} 1) \minus{} (z^2 \plus{} 1)$; $ 2y^4 \equal{} 3z(y^2 \plus{} 1) \minus{} 2(x^2 \plus{} 1)$; $ 2z^5 \equal{} 4x(z^2 \plus{} 1) \minus{} 3(y^2 \plus{} 1)$.

Every $24$ hours , the minute hand of an ordinary clock completes $24$ revolutions while the hour hand completes $2$. Every $24$ hours , the minute hand of an Italian clock completes $24$ revolutions while the hour hand completes only $1$ . The minute hand of each clock is longer than the hour hand, and "zero hour" is located at the top of the clock's face. How many positions of the two hands can occur on an Italian clock within a $24$-hour period that are possible on an ordinary one? (Folklore)

A store owner bought $1500$ pencils at $\$0.10$ each. If he sells them for $\$0.25$ each, how many of them must he sell to make a profit of exactly $\$100.00?$ $\text{(A)}\ 400 \qquad \text{(B)}\ 667 \qquad \text{(C)}\ 1000 \qquad \text{(D)}\ 1500 \qquad \text{(E)}\ 1900$

Given a tetrahedron $A_1A_2A_3A_4$ (not necessarily regulart). We shall call a point $N$ in space [i]Serve point[/i], if it's six projection points on the six edges of the tetrahedron lie on one plane. This plane we denote it by $a (N)$ and call the [i]Serve plane[/i] of the point $N$. By $B_{ij}$ denote, respectively, the midpoint of the edges $A_1A_j$, $1\le i <j \le 4$. For each point $M$, denote by $M_{ij}$ the points symmetric to $M$ with respect to $B_{ij},$ $1\le i <j \le 4$. Prove that if all points $M_{ij}$ are Serve points, then the point $M$ belongs to all Serve planes $a (M_{ij})$, $1\le i <j \le 4$.

The circles $\mathcal{Y}_0$ and $\mathcal{Y}_1$ lies outside each other. Let $O_0$ be the center of $\mathcal{Y}_0$ and $O_1$ be the center of $\mathcal{Y}_1$. From $O_0$, draw the rays which are tangents to $\mathcal{Y}_1$ and similarty from $O_1$, draw the rays which are tangents to $\mathcal{Y}_0$. Let the intersection points of rays and circle $\mathcal{Y}_i$ be $A_i$ and $B_i$. Show that the line segments $A_0B_0$ and $A_1B_1$ have equal lengths.

Higher Secondary P5 Let $x>1$ be an integer such that for any two positive integers $a$ and $b$, if $x$ divides $ab$ then $x$ either divides $a$ or divides $b$. Find with proof the number of positive integers that divide $x$.

A set of three nonnegative integers $\{x,y,z\}$ with $x < y < z$ is called [i]historic[/i] if $\{z-y,y-x\} = \{1776,2001\}$. Show that the set of all nonnegative integers can be written as the union of pairwise disjoint historic sets.

Let $ a$, $ b$, and $ c$ be non-negative real numbers and let $ x$, $ y$, and $ z$ be positive real numbers such that $ a\plus{}b\plus{}c\equal{}x\plus{}y\plus{}z$. Prove that \[ \dfrac{a^3}{x^2}\plus{}\dfrac{b^3}{y^2}\plus{}\dfrac{c^3}{z^2} \ge a\plus{}b\plus{}c.\] [i]Hery Susanto, Malang[/i]

Given a point $p$ and a line segment $l$, let $d(p,l)$ be the distance between them. Let $A$, $B$, and $C$ be points in the plane such that $AB=6$, $BC=8$, $AC=10$. What is the area of the region in the $(x,y)$-plane formed by the ordered pairs $(x,y)$ such that there exists a point $P$ inside triangle $ABC$ with $d(P,AB)+x=d(P,BC)+y=d(P,AC)?$

Let $n\ge 2$ is a given integer , $x_1,x_2,\ldots,x_n $ be real numbers such that $(1) x_1+x_2+\ldots+x_n=0 $, $(2) |x_i|\le 1$ $(i=1,2,\cdots,n)$. Find the maximum of Min$\{|x_1-x_2|,|x_2-x_3|,\cdots,|x_{n-1}-x_n|\}$.

Observe the set $S =\{(x, y) \in Z^2 : |x| \le 5$ and $-10 \le y\le 0\}$. Find the number of points $P$ in $S$ such that there exists a tangent line from $P$ to the parabola $y = x^2 + 1$ that can be written in the form $y = mx + b$, where $m$ and $b$ are integers.