A simple graph is called "divisibility", if it's possible to put distinct numbers on its vertices such that there is an edge between two vertices if and only if number of one of its vertices is divisible by another one. A simple graph is called "permutationary", if it's possible to put numbers $1,2,...,n$ on its vertices and there is a permutation $ \pi $ such that there is an edge between vertices $i,j$ if and only if $i>j$ and $\pi(i)< \pi(j)$ (it's not directed!) Prove that a simple graph is permutationary if and only if its complement and itself are divisibility. [i]Proposed by Morteza Saghafian[/i] .

Given $N = 2^ap_1p_2...p_m$, $m \ge 1$, $a \in N$ with $p_1, p_2,..., p_m$ are different primes. It is known that $\sigma (N) = 3N $ where $\sigma (N)$ is the sum of all positive integers which are factors of $N$. Show that there exists a prime number $p$ such that $2^p- 1$ is also a prime, and $2^p - 1|N$.

Prove that the graph of the polynomial $P(x)$ is symmetric in respect to point $A(a,b)$ if and only if there exists a polynomial $Q(x)$ such that: $P(x) = b + (x-a)Q((x-a)^2)).$

The figure may be folded along the lines shown to form a number cube. Three number faces come together at each corner of the cube. What is the largest sum of three numbers whose faces come together at a corner? [asy] draw((0,0)--(0,1)--(1,1)--(1,2)--(2,2)--(2,1)--(4,1)--(4,0)--(2,0)--(2,-1)--(1,-1)--(1,0)--cycle); draw((1,0)--(1,1)--(2,1)--(2,0)--cycle); draw((3,1)--(3,0)); label("$1$",(1.5,1.25),N); label("$2$",(1.5,.25),N); label("$3$",(1.5,-.75),N); label("$4$",(2.5,.25),N); label("$5$",(3.5,.25),N); label("$6$",(.5,.25),N); [/asy] $\text{(A)}\ 11 \qquad \text{(B)}\ 12 \qquad \text{(C)}\ 13 \qquad \text{(D)}\ 14 \qquad \text{(E)}\ 15$

Solve the following equation for real values of $x$: \[ 2 \left( 5^x + 6^x - 3^x \right) = 7^x + 9^x. \]

A list of $11$ positive integers has a mean of $10$, a median of $9$, and a unique mode of $8$. What is the largest possible value of an integer in the list? ${ \textbf{(A)}\ 24\qquad\textbf{(B)}\ 30\qquad\textbf{(C)}\ 31\qquad\textbf{(D)}}\ 33\qquad\textbf{(E)}\ 35 $

Prove that the transformation product of the symmetry of center $(0, 0)$ with the symmetry of the axis, with the line of equation $x = y + 1$, can be expressed as a product of an axis symmetry the line $e$ by a translation of vector $\overrightarrow{v}$, with $e$ parallel to $\overrightarrow{v}$, . Determine a line $e$ and a vector $\overrightarrow{v}$, that meet the indicated conditions. have to be unique $e$ and $\overrightarrow{v}$,?

Let $n$ be a positive integer. Prove that $x^n -\frac{1}{x^{n}}$ is expressible as a polynomial in $x-\frac{1}{x}$ with real coefficients if and only if $n$ is odd.

A function $f$ is defined recursively by $f(1)=f(2)=1$ and $$f(n)=f(n-1)-f(n-2)+n$$ for all integers $n \geq 3$. What is $f(2018)$? $\textbf{(A)} \text{ 2016} \qquad \textbf{(B)} \text{ 2017} \qquad \textbf{(C)} \text{ 2018} \qquad \textbf{(D)} \text{ 2019} \qquad \textbf{(E)} \text{ 2020}$

Every cell of $8\times8$ chessboard contains either $1$ or $-1$. It is known that there are at least four rows such that the sum of numbers inside the cells of those rows is positive. At most how many columns are there such that the sum of numbers inside the cells of those columns is less than $-3$? $ \textbf{(A)}\ 6 \qquad \textbf{(B)}\ 5 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 2$

Given five circles of radii $1, 2, 3, 4,$ and $5$, what is the maximum number of points of intersections possible (every distinct point where two circles intersect counts).

Find the smallest positive integer $k$ such that, for any subset $A$ of $S=\{1,2,\ldots,2012\}$ with $|A|=k$, there exist three elements $x,y,z$ in $A$ such that $x=a+b$, $y=b+c$, $z=c+a$, where $a,b,c$ are in $S$ and are distinct integers. [i]Proposed by Huawei Zhu[/i]

Let $a,b,c$ be positive numbers with $\sqrt{a}+\sqrt{b}+\sqrt{c}= \frac{\sqrt{3}}{2}$ Prove that the system of equations \[\sqrt{y-a}+\sqrt{z-a}=1\] \[\sqrt{z-b}+\sqrt{x-b}=1\] \[\sqrt{x-c}+\sqrt{y-c}=1\] has exactly one solution $(x,y,z)$ in real numbers. It was proposed by Poland. Have fun! :lol:

It is known that the graph of the function $y = f(x)$ after a rotation of $45^o$ around a certain point turns into the graph of the function $y = x^3 + ax^2 + 19x + 97$. At what $a$ is this possible?

Given $n>4$ points in the plane, no three collinear. Prove that there are at least $\frac{(n-3)(n-4)}{2}$ convex quadrilaterals with vertices amongst the $n$ points.

[b]p1.[/b] An $8$-inch by $11$-inch sheet of paper is laid flat so that the top and bottom edges are $8$ inches long. The paper is then folded so that the top left corner touches the right edge. What is the minimum possible length of the fold? [b]p2.[/b] Triangle $ABC$ is equilateral, with $AB = 6$. There are points $D$, $E$ on segment AB (in the order $A$, $D$, $E$, $B$), points $F$, $G$ on segment $BC$ (in the order $B$, $F$, $G$, $C$), and points $H$, $I$ on segment $CA$ (in the order $C$, $H$, $I$, $A$) such that $DE = F G = HI = 2$. Considering all such configurations of $D$, $E$, $F$, $G$, $H$, $I$, let $A_1$ be the maximum possible area of (possibly degenerate) hexagon $DEF GHI$ and let $A_2$ be the minimum possible area. Find $A_1 - A_2$. [b]p3.[/b] Find $$\tan \frac{\pi}{7} \tan \frac{2\pi}{7} \tan \frac{3\pi}{7}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].