Find all non-negative integers $m,n,p,q$ such that \[ p^mq^n = (p+q)^2 +1 . \]

We call an $n\times n$ matrix [i]well groomed[/i] if it only contains elements $0$ and $1$, and it does not contain the submatrix $\begin{pmatrix} 1& 0\\ 0 & 1 \end{pmatrix}.$ Show that there exists a constant $c>0$ such that every well groomed, $n\times n$ matrix contains a submatrix of size at least $cn\times cn$ such that all of the elements of the submatrix are equal. (A well groomed matrix may contain the submatrix $\begin{pmatrix} 0& 1\\ 1 & 0 \end{pmatrix}.$ )

There are some segments on the plane such that no two of them intersect each other (even at the ending points). We say segment $AB$ [b]breaks[/b] segment $CD$ if the extension of $AB$ cuts $CD$ at some point between $C$ and $D$. [asy] /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */ import graph; size(4cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -5.267474904743955, xmax = 11.572179069738377, ymin = -10.642621257034536, ymax = 4.543526642434019; /* image dimensions */ /* draw figures */ draw((-4,-2)--(1.08,-2.03), linewidth(2)); draw(shift((-2.1866176795507295,-2.0107089507113147))*scale(0.21166666666666667)*(expi(pi/4)--expi(5*pi/4)^^expi(3*pi/4)--expi(7*pi/4))); /* special point */ draw((-0.16981767035094117,3.225314210196242)--(-2.1866176795507295,-2.0107089507113147), linewidth(2) + linetype("4 4")); draw((-0.16981767035094117,3.225314210196242)--(-0.8194002739586808,1.538865607509914), linewidth(2)); label("$A$",(-1.2684397405642523,3.860690076971137),SE*labelscalefactor,fontsize(16)); label("$B$",(-1.9211395070170559,2.002590777612728),SE*labelscalefactor,fontsize(16)); label("$C$",(-4.971261820527631,-1.6571211388676117),SE*labelscalefactor,fontsize(16)); label("$D$",(1.08925640451367566,-1.6571211388676117),SE*labelscalefactor,fontsize(16)); /* dots and labels */ dot((-4,-2),dotstyle); dot((1.08,-2.03),dotstyle); dot((-0.16981767035094117,3.225314210196242),dotstyle); dot((-0.8194002739586808,1.538865607509914),dotstyle); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy] $a)$ Is it possible that each segment when extended from both ends, breaks exactly one other segment from each way? [asy] /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */ import graph; size(4cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -6.8, xmax = 8.68, ymin = -10.32, ymax = 3.64; /* image dimensions */ /* draw figures */ draw((-2.56,1.24)--(-0.36,1.4), linewidth(2)); draw((-3.32,-2.68)--(-1.24,-3.08), linewidth(2)); draw(shift((-2.551651190956802,-2.8277593863544612))*scale(0.17638888888888887)*(expi(pi/4)--expi(5*pi/4)^^expi(3*pi/4)--expi(7*pi/4))); /* special point */ draw(shift((-0.8889576602618603,1.3615303519809556))*scale(0.17638888888888887)*(expi(pi/4)--expi(5*pi/4)^^expi(3*pi/4)--expi(7*pi/4))); /* special point */ draw((-2.551651190956802,-2.8277593863544612)--(-0.8889576602618603,1.3615303519809556), linewidth(2) + linetype("4 4")); draw((-1.4097008194020806,0.049476186483185636)--(-1.8514772275312024,-1.0636149148218605), linewidth(2)); /* dots and labels */ dot((-2.56,1.24),dotstyle); dot((-0.36,1.4),dotstyle); dot((-3.32,-2.68),dotstyle); dot((-1.24,-3.08),dotstyle); dot((-1.4097008194020806,0.049476186483185636),dotstyle); dot((-1.8514772275312024,-1.0636149148218605),dotstyle); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy] $b)$ A segment is called [b]surrounded[/b] if from both sides of it, there is exactly one segment that breaks it.\\ ([i]e.g.[/i] segment $AB$ in the figure.) Is it possible to have all segments to be surrounded? [asy] /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */ import graph; size(7cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -10.70976151557872, xmax = 18.64292748469251, ymin = -16.354300717041443, ymax = 9.136192362141452; /* image dimensions */ /* draw figures */ draw((1.0313140845297686,0.748205038977829)--(-1.3,-4), linewidth(2.8)); draw((-5.780195085389632,-2.13088646583346)--(-2.549994860479401,-2.13088646583346), linewidth(2.8)); draw((4.121070821400425,-3.816208322308361)--(1.78,-1.88), linewidth(2.8)); draw(shift((-0.38228674372374466,-2.13088646583346))*scale(0.21166666666666667)*(expi(pi/4)--expi(5*pi/4)^^expi(3*pi/4)--expi(7*pi/4))); /* special point */ draw((-2.549994860479401,-2.13088646583346)--(-0.38228674372374466,-2.13088646583346), linewidth(2.8) + linetype("4 4")); draw(shift((0.32979226045261084,-0.6805897691262632))*scale(0.21166666666666667)*(expi(pi/4)--expi(5*pi/4)^^expi(3*pi/4)--expi(7*pi/4))); /* special point */ draw((4.121070821400425,-3.816208322308361)--(0.32979226045261084,-0.6805897691262632), linewidth(2.8) + linetype("4 4")); draw((-3.6313140845297687,-8.74820503897783)--(3.600422205681574,5.980726991931396), linewidth(2.8) + linetype("2 2")); label("$A$",(-0.397698406272906,1.754593418658662),SE*labelscalefactor,fontsize(16)); label("$B$",(-2.6377720405041316,-3.266261278756151),SE*labelscalefactor,fontsize(16)); /* dots and labels */ dot((1.0313140845297686,0.748205038977829),linewidth(6pt) + dotstyle); dot((-1.3,-4),linewidth(6pt) + dotstyle); dot((-5.780195085389632,-2.13088646583346),linewidth(6pt) + dotstyle); dot((-2.549994860479401,-2.13088646583346),linewidth(6pt) + dotstyle); dot((4.121070821400425,-3.816208322308361),linewidth(6pt) + dotstyle); dot((1.78,-1.88),linewidth(6pt) + dotstyle); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy] [i]Proposed by Morteza Saghafian[/i]

On a line are given $n>3$ points. Find the number of colorings of these points in red and blue, such that in any set of consequent points the difference between the numbers of red and blue points does not exceed $2$.

Let $P$ be a point outside a circle centered at $O$. From $P$, tangent lines are drawn to the circle, touching the circle at points $A$ and $B$. Ray $\overrightarrow{BO}$ is drawn intersecting the circle again at $C$ and intersecting ray $\overrightarrow{PA}$ at $Q$. If $3QA = 2AP$, what is the value of $\sin \angle CAQ$?

Prove that the number $\underbrace{111\ldots 11}_{1997}\underbrace{22\ldots 22}_{1998}5$ (which has 1997 of 1-s and 1998 of 2-s) is a perfect square.

Determine all quadruples $(a, b, c, d)$ of real numbers satisfying the equation \[256a^3b^3c^3d^3 = (a^6+b^2+c^2+d^2)(a^2+b^6+c^2+d^2)(a^2+b^2+c^6+d^2)(a^2+b^2+c^2+d^6).\]

For all $x \geq 2$, $y \geq 2$ real numbers, prove that $$x(\frac{4x}{y-1}+\frac{1}{2y+x})+y(\frac{y}{6x-9}+\frac{1}{2x+y}) > \frac{26}{3}$$

On a piece of paper, we write down all positive integers $n$ such that all proper divisors of $n$ are less than $18$. We know that the sum of all numbers on the paper having exactly one proper divisor is $666$. What is the sum of all numbers on the paper having exactly two proper divisors? We say that $k$ is a [i]proper divisor [/i]of the positive integer $n$ if $k | n$ and $1 < k < n$.

Find all pairs $(a,b)$ of positive integers such that $a^2\mid b^3+1$ and $b^2\mid a^3+1$. [i]Linus Tang[/i]

Let $ a_1,a_2,...,a_n$ is permutaion of $ 1,2,...,n$. For this permutaion call the pair $ (a_i,a_j)$ [i]wrong pair [/i]if $ i<j$ and $ a_i >a_j$.Let [i]number of inversion [/i] is number of [i]wrong pair [/i] of permutation $ a_1,a_2,a_3,..,a_n$. Let $ n \ge 2$ is positive integer. Find the number of permutation of $ 1,2,..,n$ such that its [i]number of inversion [/i]is divisible by $ n$.

For a positive real number $ [x] $ be its integer part. For example, $[2.711] = 2, [7] = 7, [6.9] = 6$. $z$ is the maximum real number such that [$\frac{5}{z}$] + [$\frac{6}{z}$] = 7. Find the value of$ 20z$.

Let $ m$ and $ n$ be positive integers such that $ 1 \le m < n$. In their decimal representations, the last three digits of $ 1978^m$ are equal, respectively, to the last three digits of $ 1978^n$. Find $ m$ and $ n$ such that $ m \plus{} n$ has its least value.

For any positive integer $n{}$ define $a_n=\{n/s(n)\}$ where $s(\cdot)$ denotes the sum of the digits and $\{\cdot\}$ denotes the fractional part.[list=a] [*]Prove that there exist infinitely many positive integers $n$ such that $a_n=1/2.$ [*]Determine the smallest positive integer $n$ such that $a_n=1/6.$ [/list] [i]Marius Burtea[/i]

There is a balance without weights and there are two piles of stones of unknown masses, 10 stones in each pile. One is allowed an unlimited number of weighing iterations, but only 9 stones at most fit on any plate of the balance. Is it always possible to determine which stone pile is heavier or establish that they are equal? Sergey Dorichenko

Consider the set $S$ of integers $k$ which are products of four distinct primes. Such an integer $k=p_1p_2p_3p_4$ has $16$ positive divisors $1=d_1<d_2<\ldots <d_{15}<d_{16}=k$. Find all elements of $S$ less than $2002$ such that $d_9-d_8=22$.

Prove that for any positive $ x_1,x_2,\ldots,x_n,y_1,y_2,\ldots,y_n$ the inequality \[ \sum_{i\equal{}1}^n\frac1{x_iy_i}\ge\frac{4n^2}{\sum_{i\equal{}1}^n(x_i\plus{}y_i)^2} \] holds.

Let $ ABC$ be a triangle with $ \angle A \equal{} 45^\circ$. Let $ P$ be a point on side $ BC$ with $ PB \equal{} 3$ and $ PC \equal{} 5$. Let $ O$ be the circumcenter of $ ABC$. Determine the length $ OP$.

A shipping company charges $.30l+.40w+.50h$ dollars to process a right rectangular prism-shaped box with dimensions $l,w,h$ in inches. The customers themselves are allowed to label the three dimensions of their box with $l,w,h$ for the purpose of calculating the processing fee. A customer finds that there are two different ways to label the dimensions of their box $B$ to get a fee of $\$8.10$, and two different ways to label $B$ to get a fee of $\$8.70$. None of the faces of $B$ are squares. Find the surface area of $B$, in square inches. [i]Proposed by Justin Hsieh[/i]

Two segment $AB,CD$ of the same length are given in plane such that lines $AB,CD$ are not parallel. Consider a point $S$ with the following property: the image of segment $AB$ under point reflection with respect to $S$ is identical to the mirror-image of segment $CD$ with respect to some axis. Find the locus of all such points $S.$

Let $n$ be a positive integer. A [i]Japanese triangle[/i] consists of $1 + 2 + \dots + n$ circles arranged in an equilateral triangular shape such that for each $i = 1$, $2$, $\dots$, $n$, the $i^{th}$ row contains exactly $i$ circles, exactly one of which is coloured red. A [i]ninja path[/i] in a Japanese triangle is a sequence of $n$ circles obtained by starting in the top row, then repeatedly going from a circle to one of the two circles immediately below it and finishing in the bottom row. Here is an example of a Japanese triangle with $n = 6$, along with a ninja path in that triangle containing two red circles. [asy] // credit to vEnhance for the diagram (which was better than my original asy): size(4cm); pair X = dir(240); pair Y = dir(0); path c = scale(0.5)*unitcircle; int[] t = {0,0,2,2,3,0}; for (int i=0; i<=5; ++i) { for (int j=0; j<=i; ++j) { filldraw(shift(i*X+j*Y)*c, (t[i]==j) ? lightred : white); draw(shift(i*X+j*Y)*c); } } draw((0,0)--(X+Y)--(2*X+Y)--(3*X+2*Y)--(4*X+2*Y)--(5*X+2*Y),linewidth(1.5)); path q = (3,-3sqrt(3))--(-3,-3sqrt(3)); draw(q,Arrows(TeXHead, 1)); label("$n = 6$", q, S); label("$n = 6$", q, S); [/asy] In terms of $n$, find the greatest $k$ such that in each Japanese triangle there is a ninja path containing at least $k$ red circles.

Is it possible to paint all natural numbers in $6$ colors, for each one color to be used and the sum of any five numbers of different color to be painted in the sixth color?

suppose that $p$ is a prime number. find that smallest $n$ such that there exists a non-abelian group $G$ with $|G|=p^n$. SL is an acronym for Special Lesson. this year our special lesson was Groups and Symmetries. the exam time was 5 hours.

Aunt Anna is $42$ years old. Caitlin is $5$ years younger than Brianna, and Brianna is half as old as Aunt Anna. How old is Caitlin? $\textbf{(A)}\ 15 \qquad \textbf{(B)}\ 16\qquad \textbf{(C)}\ 17\qquad \textbf{(D)}\ 21\qquad \textbf{(E)}\ 37$

Let $ABC$ be an acute triangle with incentre $I$ and $AB \neq AC$. Let lines $BI$ and $CI$ intersect the circumcircle of $ABC$ at $P \neq B$ and $Q \neq C$, respectively. Consider points $R$ and $S$ such that $AQRB$ and $ACSP$ are parallelograms (with $AQ \parallel RB, AB \parallel QR, AC \parallel SP$, and $AP \parallel CS$). Let $T$ be the point of intersection of lines $RB$ and $SC$. Prove that points $R, S, T$, and $I$ are concyclic.