In a blackboard there are $K$ circles in a row such that one of the numbers $1,...,K$ is assigned to each circle from the left to the right. Change of situation of a circle is to write in it or erase the number which is assigned to it.At the beginning no number is written in its own circle. For every positive divisor $d$ of $K$ ,$1\leq d\leq K$ we change the situation of the circles in which their assigned numbers are divisible by $d$,performing for each divisor $d$ $K$ changes of situation. Determine the value of $K$ for which the following holds;when this procedure is applied once for all positive divisors of $K$ ,then all numbers $1,2,3,...,K$ are written in the circles they were assigned in.

If $f(x)=\cos(x)-1+\frac{x^2}2$, then $\textbf{(A)}~f(x)\text{ is an increasing function on the real line}$ $\textbf{(B)}~f(x)\text{ is a decreasing function on the real line}$ $\textbf{(C)}~f(x)\text{ is increasing on }-\infty<x\le0\text{ and decreasing on }0\le x<\infty$ $\textbf{(D)}~f(x)\text{ is decreasing on }-\infty<x\le0\text{ and increasing on }0\le x<\infty$

In a set $X$ of n people, some know each other and others do not, where the relationship to know is symmetric; that is, if $ A$ knows $ B$. then $ B$ knows $ A$. On the other hand, given any$ 4$ people: $A, B, C$ and $D$: if $A$ knows $B$, $B$ knows $C$ and $C$ knows $D$, then it happens at least one of the following three: $A$ knows $C, B$ knows $D$ or $A$ knows $D$. Prove that $X$ can be partition into two sets $Y$ and $Z$ so that all elements of $Y$ know all those of $Z$ or no element in $Y$ knows any in $Z$.

let $ABCD$ be a cyclic quadrilateral with $E$,an interior point such that $AB=AD=AE=BC$. Let $DE$ meet the circumcircle of $BEC$ again at $F$. Suppose a common tangent to the circumcircle of $BEC$ and $DEC$ touch the circles at $F$ and $G$ respectively. Show that $GE$ is the external angle bisector of angle $BEF$

Let $n$ be the number of possible ways to place six orange balls, six black balls, and six white balls in a circle (two placements are considered equivalent if one can be rotated to fit the other). What is the remainder when $n$ is divided by $1000$?

Let $ABCD$ be a parallelogram with $AC=BC.$ A point $P$ is chosen on the extension of ray $AB$ past $B.$ The circumcircle of $ACD$ meets the segment $PD$ again at $Q.$ The circumcircle of triangle $APQ$ meets the segment $PC$ at $R.$ Prove that lines $CD,AQ,BR$ are concurrent.

Find all positive integers $n$ which satisfy the following tow conditions: (a) $n$ has at least four different positive divisors; (b) for any divisors $a$ and $b$ of $n$ satisfying $1<a<b<n$, the number $b-a$ divides $n$. [i](4th Middle European Mathematical Olympiad, Individual Competition, Problem 4)[/i]

Alex, Bob, and Chris are driving cars down a road at distinct constant rates. All people are driving a positive integer number of miles per hour. All of their cars are $15$ feet long. It takes Alex $1$ second longer to completely pass Chris than it takes Bob to completely pass Chris. The passing time is defined as the time where their cars overlap. Find the smallest possible sum of their speeds, in miles per hour. [i]Proposed by Sammy Charney[/i]

Let $M=\bigoplus_{i \in \mathbb{Z}} \mathbb{C}e_i$ be an infinite dimensional $\mathbb{C}$-vector space, and let $\text{End}(M)$ denote the $\mathbb{C}$-algebra of $\mathbb{C}$-linear endomorphisms of $M$. Let $A$ and $B$ be two commuting elements in $\text{End}(M)$ satisfying the following condition: there exist integers $m \le n<0<p \le q$ satisfying $\text{gd}(-m,p)=\text{gcd}(-n,q)=1$, and such that for every $j \in \mathbb{Z}$, one has \[Ae_j=\sum_{i=j+m}^{j+n} a_{i,j}e_i, \quad \text{with } a_{i,j} \in \mathbb{C}, a_{j+m,j}a_{j+n,j} \ne 0,\] \[Be_j=\sum_{i=j+p}^{j+q} b_{i,j}e_i, \quad \text{with } b_{i,j} \in \mathbb{C}, b_{j+p,j}b_{j+q,j} \ne 0.\] Let $R \subset \text{End}(M)$ be the $\mathbb{C}$-subalgebra generated by $A$ and $B$. Note that $R$ is commutative and $M$ can be regarded as an $R$-module. (a) Show that $R$ is an integral domain and is isomorphic to $R \cong \mathbb{C}[x,y]/f(x,y)$, where $f(x,y)$ is a non-zero polynomial such that $f(A,B)=0$. (b) Let $K$ be the fractional field of $R$. Show that $M \otimes_R K$ is a $1$-dimensional vector space over $K$.

Let $x, y$, and $z$ be integers with $z>1$. Show that \[(x+1)^{2}+(x+2)^{2}+\cdots+(x+99)^{2}\neq y^{z}.\]

Juan rolls a fair regular octahedral die marked with the numbers $ 1$ through $ 8$. Then Amal rolls a fair six-sided die. What is the probability that the product of the two rolls is a multiple of $ 3$? $ \textbf{(A)}\ \frac{1}{12} \qquad \textbf{(B)}\ \frac{1}{3} \qquad \textbf{(C)}\ \frac{1}{2} \qquad \textbf{(D)}\ \frac{7}{12} \qquad \textbf{(E)}\ \frac{2}{3}$

There are $n$ distinct points on a circumference. Choose one of the points. Connect this point and the $m$th point from the chosen point counterclockwise with a segment. Connect this $m$th point and the $m$th point from this $m$th point counterclockwise with a segment. Repeat such steps until no new segment is constructed. From the intersections of the segments, let the number of the intersections - which are in the circle - be $I$. Answer the following questions ($m$ and $n$ are positive integers that are relatively prime and they satisfy $6 \leq 2m < n$). 1) When the $n$ points take different positions, express the maximum value of $I$ in terms of $m$ and $n$. 2) Prove that $I \geq n$. Prove that there is a case, which is $I=n$, when $m=3$ and $n$ is arbitrary even number that satisfies the condition.

In year $2525$ the QED has $3n + 1$ members, of which $n$ are identical robots and $2n + 1$ (uncloned and therefore distinguishable) people. For the $263^{th}$ board election in Wurzburg there will be exactly $n$ members. Find out how many distinguishable compositions are conceivable for this.

Find $\sum_{k=1}^{3n} \frac{1}{\int_0^1 x(1-x)^k\ dx}$. [i]2011 Hosei University entrance exam/Design and Enginerring[/i]

Let $ ABCD$ be a convex quadrilateral. We have that $ \angle BAC\equal{}3\angle CAD$, $ AB\equal{}CD$, $ \angle ACD\equal{}\angle CBD$. Find angle $ \angle ACD$

Let $n \ge 2$ be a fixed positive integer. An integer will be called "$n$-free" if it is not a multiple of an $n$-th power of a prime. Let $M$ be an infinite set of rational numbers, such that the product of every $n$ elements of $M$ is an $n$-free integer. Prove that $M$ contains only integers.

$a, b, c, d$ are integers such that $ad + bc$ divides each of $a, b, c$ and $d$. Prove that $ad + bc =\pm 1$

At a circular track, $2n$ cyclists started from some point at the same time in the same direction with different constant speeds. If any two cyclists are at some point at the same time again, we say that they meet. No three or more of them have met at the same time. Prove that by the time every two cyclists have met at least once, each cyclist has had at least $n^2$ meetings.

Which process is exothermic? $ \textbf{(A)}\hspace{.05in}\text{condensation} \qquad\textbf{(B)}\hspace{.05in}\text{fusion} \qquad\textbf{(C)}\hspace{.05in}\text{sublimation} \qquad\textbf{(D)}\hspace{.05in}\text{vaporization} \qquad $

The letters $R, M$, and $O$ represent whole numbers. If $R \times M \times O = 240$, $R \times O + M =46$ and $R + M \times O = 64$, what is the value of $R + M + O$?

Let $P(x)$ be a nonzero polynomial such that $(x-1)P(x+1)=(x+2)P(x)$ for every real $x$, and $\left(P(2)\right)^2 = P(3)$. Then $P(\tfrac72)=\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Let's call the "Soros product" of two different numbers, $a$ and $b$, the number $a + b + ab$. Is it possible, based on numbers $1$ and $4$, after repeated application of this operation to the already obtained products, to obtain: a) the number $1999$? b) the number $2000$?

Let $a$, $b$, $c$ be positive real numbers such that $abc=1$. Prove that \[\frac a{a^{2}+2}+\frac b{b^{2}+2}+\frac c{c^{2}+2}\leq 1 \]

Let $n$ denote the product of the first $2013$ primes. Find the sum of all primes $p$ with $20 \le p \le 150$ such that (i) $\frac{p+1}{2}$ is even but is not a power of $2$, and (ii) there exist pairwise distinct positive integers $a,b,c$ for which \[ a^n(a-b)(a-c) + b^n(b-c)(b-a) + c^n(c-a)(c-b) \] is divisible by $p$ but not $p^2$. [i]Proposed by Evan Chen[/i]

For all integers $x,y,z$, let \[S(x,y,z) = (xy - xz, yz-yx, zx - zy).\] Prove that for all integers $a$, $b$ and $c$ with $abc>1$, and for every integer $n\geq n_0$, there exists integers $n_0$ and $k$ with $0<k\leq abc$ such that \[S^{n+k}(a,b,c) \equiv S^n(a,b,c) \pmod {abc}.\] ($S^1 = S$ and for every integer $m\geq 1$, $S^{m+1} = S \circ S^m.$ $(u_1, u_2, u_3) \equiv (v_1, v_2, v_3) \pmod M \Longleftrightarrow u_i \equiv v_i \pmod M (i=1,2,3).$)