Find the smallest positive constant $c$ satisfying: For any simple graph $G=G(V,E)$, if $|E|\geq c|V|$, then $G$ contains $2$ cycles with no common vertex, and one of them contains a chord. Note: The cycle of graph $G(V,E)$ is a set of distinct vertices ${v_1,v_2...,v_n}\subseteq V$, $v_iv_{i+1}\in E$ for all $1\leq i\leq n$ $(n\geq 3, v_{n+1}=v_1)$; a cycle containing a chord is the cycle ${v_1,v_2...,v_n}$, such that there exist $i,j, 1< i-j< n-1$, satisfying $v_iv_j\in E$.

Let $p$ be a prime, and $n > p$ be an integer. Prove that \[ \binom{n+p-1}{p} - \binom{n}{p} \] is divisible by $n$.

Let $ n$ be an even positive integer. Let $ A_1, A_2, \ldots, A_{n \plus{} 1}$ be sets having $ n$ elements each such that any two of them have exactly one element in common while every element of their union belongs to at least two of the given sets. For which $ n$ can one assign to every element of the union one of the numbers 0 and 1 in such a manner that each of the sets has exactly $ \frac {n}{2}$ zeros?

How many integer pairs $(a, b)$ with $1 < a, b \le 2015$ are there such that $\log_a b$ is an integer?

The perimeter of a square is equal in value to its area. Determine the length of one of its sides.

If $a,b,c$ are the sides of a triangle whose perimeter is equal to 2 then prove that: a) $abc+\frac{28}{27}\geq ab+bc+ac$; b) $abc+1<ab+bc+ac$ See also [url]http://www.mathlinks.ro/Forum/viewtopic.php?t=47939&view=next[/url] (problem 1) :)

Let $ x$, $ y$, $ z$ be real numbers satisfying $ x^2\plus{}y^2\plus{}z^2\plus{}9\equal{}4(x\plus{}y\plus{}z)$. Prove that \[ x^4\plus{}y^4\plus{}z^4\plus{}16(x^2\plus{}y^2\plus{}z^2) \ge 8(x^3\plus{}y^3\plus{}z^3)\plus{}27\] and determine when equality holds.

In the segment $A C$ a point $B$ is taken. Construct circles $T_1, T_2$ and $T_3$ of diameters $A B, BC$ and $AC$ respectively. A line that passes through $B$ cuts $T_3$ in the points $P$ and $Q$, and the circles $T_1$ and $T_2$ respectively at points $R$ and $S$. Prove that $PR = Q S$.

Show that if $k\leq \frac n2$ and $\mathcal F$ is a family $k\times k$ submatrices of an $n\times n$ matrix such that any two intersect then $$|\mathcal F|\leq \binom{n-1}{k-1}^2$$ [Gy. Katona]

The points $P$ and $Q$ lie on the sides $BC$ and $CD$ of the parallelogram $ABCD$ so that $BP = QD$. Show that the intersection point between the lines $BQ$ and $DP$ lies on the line bisecting $\angle BAD$.

What are the last $2$ digits of the number $2018^{2018}$ when written in base $7$?

$ S$ be a set of $ n$ points in the plane. No three points of $ S$ are collinear. Prove that there exists a set $ P$ containing $ 2n \minus{} 5$ points satisfying the following condition: In the interior of every triangle whose three vertices are elements of $ S$ lies a point that is an element of $ P.$

Let $ \xi_1,\xi_2,...$ be independent random variables such that $ E\xi_n=m>0$ and $ \textrm{Var}(\xi_n)=\sigma^2 < \infty \;(n=1,2,...)\ .$ Let $ \{a_n \}$ be a sequence of positive numbers such that $ a_n\rightarrow 0$ and $ \sum_{n=1}^{\infty} a_n= \infty$. Prove that \[ P \left( \lim_{n\rightarrow \infty} %Error. "diaplaymath" is a bad command. \sum_{k=1}^n a_k \xi_k =\infty \right)=1.\] [i]P. Revesz[/i]

An empty $2020 \times 2020 \times 2020$ cube is given, and a $2020 \times 2020$ grid of square unit cells is drawn on each of its six faces. A [i]beam[/i] is a $1 \times 1 \times 2020$ rectangular prism. Several beams are placed inside the cube subject to the following conditions: [list=] [*]The two $1 \times 1$ faces of each beam coincide with unit cells lying on opposite faces of the cube. (Hence, there are $3 \cdot {2020}^2$ possible positions for a beam.) [*]No two beams have intersecting interiors. [*]The interiors of each of the four $1 \times 2020$ faces of each beam touch either a face of the cube or the interior of the face of another beam. [/list] What is the smallest positive number of beams that can be placed to satisfy these conditions? [i]Proposed by Alex Zhai[/i]

$\textbf{Juan's Old Stamping Grounds}$ Juan organizes the stamps in his collection by country and by the decade in which they were issued. The prices he paid for them at a stamp shop were: Brazil and France, 6 cents each, Peru 4 cents each, and Spain 5 cents each. (Brazil and Peru are South American countries and France and Spain are in Europe.) [asy] /* AMC8 2002 #8, 9, 10 Problem */ size(3inch, 1.5inch); for ( int y = 0; y <= 5; ++y ) { draw((0,y)--(18,y)); } draw((0,0)--(0,5)); draw((6,0)--(6,5)); draw((9,0)--(9,5)); draw((12,0)--(12,5)); draw((15,0)--(15,5)); draw((18,0)--(18,5)); draw(scale(0.8)*"50s", (7.5,4.5)); draw(scale(0.8)*"4", (7.5,3.5)); draw(scale(0.8)*"8", (7.5,2.5)); draw(scale(0.8)*"6", (7.5,1.5)); draw(scale(0.8)*"3", (7.5,0.5)); draw(scale(0.8)*"60s", (10.5,4.5)); draw(scale(0.8)*"7", (10.5,3.5)); draw(scale(0.8)*"4", (10.5,2.5)); draw(scale(0.8)*"4", (10.5,1.5)); draw(scale(0.8)*"9", (10.5,0.5)); draw(scale(0.8)*"70s", (13.5,4.5)); draw(scale(0.8)*"12", (13.5,3.5)); draw(scale(0.8)*"12", (13.5,2.5)); draw(scale(0.8)*"6", (13.5,1.5)); draw(scale(0.8)*"13", (13.5,0.5)); draw(scale(0.8)*"80s", (16.5,4.5)); draw(scale(0.8)*"8", (16.5,3.5)); draw(scale(0.8)*"15", (16.5,2.5)); draw(scale(0.8)*"10", (16.5,1.5)); draw(scale(0.8)*"9", (16.5,0.5)); label(scale(0.8)*"Country", (3,4.5)); label(scale(0.8)*"Brazil", (3,3.5)); label(scale(0.8)*"France", (3,2.5)); label(scale(0.8)*"Peru", (3,1.5)); label(scale(0.8)*"Spain", (3,0.5)); label(scale(0.9)*"Juan's Stamp Collection", (9,0), S); label(scale(0.9)*"Number of Stamps by Decade", (9,5), N); [/asy] How many of his European stamps were issued in the '80s? $\text{(A)}\ 9 \qquad \text{(B)}\ 15 \qquad \text{(C)}\ 18 \qquad \text{(D)}\ 24 \qquad \text{(E)}\ 42$

Let $f$ be a polynomial with integer coefficients. Define $$a_1 = f(0)~,~a_2 = f(a_1) = f(f(0))~,$$ and $~a_n = f(a_{n-1})$ for $n \geqslant 3$. If there exists a natural number $k \geqslant 3$ such that $a_k = 0$, then prove that either $a_1=0$ or $a_2=0$.

Given an arbitrary prime $p>2011$. Prove that there exist positive integers $a, b, c$ not all divisible by $p$ such that for all positive integers $n$ that $p\mid n^4- 2n^2+ 9$, we have $p\mid 24an^2 + 5bn + 2011c$.

Let $ x,y,z$ natural numbers so that $ xyz \equal{} 78$ and $ x^2 \plus{} y^2 \plus{} z^2 \equal{} 206.$ What is $ x\plus{}y\plus{}z$? A. 18 B. 20 C. 30 D. 42 E. None of these

Let $A$ and $B$ be positions of two ships $M$ and $N$, respectively, at the moment when $N$ saw $M$ moving with constant speed $v$ following the line $Ax$. In search of help, $N$ moves with speed $kv$ ($k < 1$) along the line $By$ in order to meet $M$ as soon as possible. Denote by $C$ the point of meeting of the two ships, and set \[AB = d, \angle BAC = \alpha, 0 \leq \alpha < \frac{\pi}{2}.\] Determine the angle $\angle ABC = \beta$ and time $t$ that $N$ needs in order to meet $M$.

Viktor and Natalia bought $2020$ buckets of ice-cream and want to organize a degustation schedule with $2020$ rounds such that: - In every round, both of them try $1$ ice-cream, and those $2$ ice-creams tried in a single round are different from each other. - At the end of the $2020$ rounds, both of them have tried each ice-cream exactly once. We will call a degustation schedule fair if the number of ice-creams that were tried by Viktor before Natalia is equal to the number of ice creams tried by Natalia before Viktor. Prove that the number of fair schedules is strictly larger than $2020!(2^{1010} + (1010!)^2)$. [i]Proposed by Viktor Simjanoski, Macedonia [/i]

Find all positive rational numbers $r\not=1$ such that $r^{\frac{1}{r-1}}$ is rational.

Let $ABC$ be a triangle. Prove that there exists a point $D$ on the side $AB$ of the triangle $ABC$, such that $CD$ is the geometric mean of $AD$ and $DB$, iff the triangle $ABC$ satisfies the inequality $\sin A\sin B\le\sin^2\frac{C}{2}$. [hide="Comment"][i]Alternative formulation, from IMO ShortList 1974, Finland 2:[/i] We consider a triangle $ABC$. Prove that: $\sin(A) \sin(B) \leq \sin^2 \left( \frac{C}{2} \right)$ is a necessary and sufficient condition for the existence of a point $D$ on the segment $AB$ so that $CD$ is the geometrical mean of $AD$ and $BD$.[/hide]

Triangle $ABC$ is equilateral with $AB=1$. Points $E$ and $G$ are on $\overline{AC}$ and points $D$ and $F$ are on $\overline{AB}$ such that both $\overline{DE}$ and $\overline{FG}$ are parallel to $\overline{BC}$. Furthermore, triangle $ADE$ and trapezoids $DFGE$ and $FBCG$ all have the same perimeter. What is $DE+FG$? [asy] size(180); pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); real s=1/2,m=5/6,l=1; pair A=origin,B=(l,0),C=rotate(60)*l,D=(s,0),E=rotate(60)*s,F=m,G=rotate(60)*m; draw(A--B--C--cycle^^D--E^^F--G); dot(A^^B^^C^^D^^E^^F^^G); label("$A$",A,SW); label("$B$",B,SE); label("$C$",C,N); label("$D$",D,S); label("$E$",E,NW); label("$F$",F,S); label("$G$",G,NW); [/asy] $\textbf{(A) }1\qquad \textbf{(B) }\dfrac{3}{2}\qquad \textbf{(C) }\dfrac{21}{13}\qquad \textbf{(D) }\dfrac{13}{8}\qquad \textbf{(E) }\dfrac{5}{3}\qquad$

Let $A$ be the greatest possible value of a product of positive integers that sums to $2014$. Compute the sum of all bases and exponents in the prime factorization of $A$. For example, if $A=7\cdot 11^5$, the answer would be $7+11+5=23$.

Determine the number of ordered pairs of positive integers $(m,n)$ with $1\leq m\leq 100$ and $1\leq n\leq 100$ such that \[ \gcd(m+1,n+1) = 10\gcd(m,n). \]