Determine all values of $n$ for which there is a set $S$ with $n$ points, with no 3 collinear, with the following property: it is possible to paint all points of $S$ in such a way that all angles determined by three points in $S$, all of the same color or of three different colors, aren't obtuse. The number of colors available is unlimited.

Let be $ABCD$ a rectangle with $|AB|=a\ge b=|BC|$. Find points $P,Q$ on the line $BD$ such that $|AP|=|PQ|=|QC|$. Discuss the solvability with respect to the lengths $a,b$.

Given a cyclic quadrilateral $ABCD$ so that $AB = AD$ and $AB + BC <CD$. Prove that the angle $ABC$ is more than $120$ degrees.

Let $ABC$ be a triangle . Let point $X$ be in the triangle and $AX$ intersects $BC$ in $Y$ . Draw the perpendiculars $YP,YQ,YR,YS$ to lines $CA,CX,BX,BA$ respectively. Find the necessary and sufficient condition for $X$ such that $PQRS$ be cyclic .

There are some counters in some cells of $100\times 100$ board. Call a cell [i]nice[/i] if there are an even number of counters in adjacent cells. Can exactly one cell be [i]nice[/i]? [i]K. Knop[/i]

A rectangle is partitioned into finitely many small rectangles. We call a point a cross point if it belongs to four different small rectangles. We call a segment on the obtained diagram maximal if there is no other segment containing it. Show that the number of maximal segments plus the number of cross points is $3$ more than the number of small rectangles.

Circles $A, B,$ and $C$ each have radius 1. Circles $A$ and $B$ share one point of tangency. Circle $C$ has a point of tangency with the midpoint of $\overline{AB}$. What is the area inside Circle $C$ but outside circle $A$ and circle $B$ ? [asy] pathpen = linewidth(.7); pointpen = black; pair A=(-1,0), B=-A, C=(0,1); fill(arc(C,1,0,180)--arc(A,1,90,0)--arc(B,1,180,90)--cycle, gray(0.5)); D(CR(D("A",A,SW),1)); D(CR(D("B",B,SE),1)); D(CR(D("C",C,N),1));[/asy] ${ \textbf{(A)}\ 3 - \frac{\pi}{2} \qquad \textbf{(B)}\ \frac{\pi}{2} \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ \frac{3\pi}{4} \qquad \textbf{(E)}\ 1+\frac{\pi}{2}} $

Let $ABCD$ be a rectangle with $5AD <2 AB$ . On the side $AB$ consider the points $S$ and $T$ such that $AS = ST = TB$. Let $M, N$ and $P$ be the projections of points $A, S$ and $T$ on lines $DS, DT$ and $DB$ respectively .Prove that the points $M, N$, and $P$ are collinear if and only if $15 AD^2 = 2 AB^2$.

Rectangle $ABCD$ has sides $\overline {AB}$ of length 4 and $\overline {CB}$ of length 3. Divide $\overline {AB}$ into 168 congruent segments with points $A=P_0, P_1, \ldots, P_{168}=B$, and divide $\overline {CB}$ into 168 congruent segments with points $C=Q_0, Q_1, \ldots, Q_{168}=B$. For $1 \le k \le 167$, draw the segments $\overline {P_kQ_k}$. Repeat this construction on the sides $\overline {AD}$ and $\overline {CD}$, and then draw the diagonal $\overline {AC}$. Find the sum of the lengths of the 335 parallel segments drawn.

Square $ABCD$ has side length $13$, and points $E$ and $F$ are exterior to the square such that $BE=DF=5$ and $AE=CF=12$. Find $EF^{2}$. [asy] size(200); defaultpen(fontsize(10)); real x=22.61986495; pair A=(0,26), B=(26,26), C=(26,0), D=origin, E=A+24*dir(x), F=C+24*dir(180+x); draw(B--C--F--D--C^^D--A--E--B--A, linewidth(0.7)); dot(A^^B^^C^^D^^E^^F); pair point=(13,13); label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); label("$E$", E, dir(point--E)); label("$F$", F, dir(point--F));[/asy]

In the adjoining figure, two circles of radii 6 and 8 are drawn with their centers 12 units apart. At $P$, one of the points of intersection, a line is drawn in such a way that the chords $QP$ and $PR$ have equal length. Find the square of the length of $QP$. [asy]unitsize(2.5mm); defaultpen(linewidth(.8pt)+fontsize(12pt)); dotfactor=3; pair O1=(0,0), O2=(12,0); path C1=Circle(O1,8), C2=Circle(O2,6); pair P=intersectionpoints(C1,C2)[0]; path C3=Circle(P,sqrt(130)); pair Q=intersectionpoints(C3,C1)[0]; pair R=intersectionpoints(C3,C2)[1]; draw(C1); draw(C2); //draw(O2--O1); //dot(O1); //dot(O2); draw(Q--R); label("$Q$",Q,N); label("$P$",P,dir(80)); label("$R$",R,E); //label("12",waypoint(O1--O2,0.4),S);[/asy]

Given two concentric circles and a pair of parallel lines. Find the locus of the fourth vertices of all rectangles with three vertices on the concentric circles, two vertices on one circle and the third on the other and with sides parallel to the given lines.

On a rectangular piece of paper there are (a) several marked points all on one straight line, (b) three marked points (not necessarily on a straight line). We are allowed to fold the paper several times along a straight line not containing marked points and then puncture the folded paper with a needle. Show that this can be done so that after the paper has been unfolded all the marked points are punctured and there are no extra holes. (A Shapovalov)

When the unit squares at the four corners are removed from a three by three squares, the resulting shape is called a cross. What is the maximum number of non-overlapping crosses placed within the boundary of a $ 10\times 11$ chessboard? (Each cross covers exactly five unit squares on the board.)

Point $P$ lies in the interior of rectangle $ABCD$ such that $AP + CP = 27$, $BP - DP = 17$, and $\angle DAP \cong \angle DCP$. Compute the area of rectangle $ABCD$. [i]Proposed by Aaron Lin[/i]

Consider the shape formed from taking equilateral triangle $ABC$ with side length $6$ and tracing out the arc $BC$ with center $A$. Set the shape down on line $l$ so that segment $AB$ is perpendicular to $l$, and $B$ touches $l$. Beginning from arc $BC$ touching $l$, we roll $ABC$ along $l$ until both points $A$ and $C$ are on the line. The area traced out by the roll can be written in the form $n\pi$, where $n$ is an integer. Find $n$.

You have a paper pentagon, $ABCDE$, such that $AB = BC = 3$ cm, $CD = DE= 5$ cm, $EA = 4$ cm, $\angle ABC = 100^o$ ,$ \angle CDE = 80^o$. You have to divide the pentagon into four triangles, by three straight cuts, so that with the four triangles assemble a rectangle, without gaps or overlays. (The triangles can be rotated and / or turned around.)

A square has been divided into $2022$ rectangles with no two of them having a common interior point. What is the maximal number of distinct lines that can be determined by the sides of these rectangles?

A rectangular pool table has a hole at each of three of its corners. The lengths of sides of the table are the real numbers $a$ and $b$. A billiard ball is shot from the fourth corner along its angle bisector. The ball falls in one of the holes. What should the relation between $a$ and $b$ be for this to happen?

Let $ABC$ be a triangle with incenter $I$, and suppose the incircle is tangent to $CA$ and $AB$ at $E$ and $F$. Denote by $G$ and $H$ the reflections of $E$ and $F$ over $I$. Let $Q$ be the intersection of $BC$ with $GH$, and let $M$ be the midpoint of $BC$. Prove that $IQ$ and $IM$ are perpendicular.

Two equal rectangles of area $10$ are arranged as follows. Find the area of the gray rectangle. [img]https://cdn.artofproblemsolving.com/attachments/7/1/112b07530a2ef42e5b2cf83a2cb9fb11dfc9e6.png[/img]

a) Prove that it is impossible to divide a rectangle into five squares of distinct sizes. b) Prove that it is impossible to divide a rectangle into six squares of distinct sizes.

All $ 2n\ge 2 $ squares of a $ 2\times n $ rectangle are colored with three colors. We say that a color has a [i]cut[/i] if there is some column (from all $ n $) that has both squares colored with it. Determine: [b]a)[/b] the number of colorings that have no cuts. [b]b)[/b] the number of colorings that have a single cut.

An $8\times 8$ chessboard is to be tiled (i.e., completely covered without overlapping) with pieces of the following shapes: [asy] unitsize(.6cm); draw(unitsquare,linewidth(1)); draw(shift(1,0)*unitsquare,linewidth(1)); draw(shift(2,0)*unitsquare,linewidth(1)); label("\footnotesize $1\times 3$ rectangle",(1.5,0),S); draw(shift(8,1)*unitsquare,linewidth(1)); draw(shift(9,1)*unitsquare,linewidth(1)); draw(shift(10,1)*unitsquare,linewidth(1)); draw(shift(9,0)*unitsquare,linewidth(1)); label("\footnotesize T-shaped tetromino",(9.5,0),S); [/asy] The $1\times 3$ rectangle covers exactly three squares of the chessboard, and the T-shaped tetromino covers exactly four squares of the chessboard. [list](a) What is the maximum number of pieces that can be used? (b) How many ways are there to tile the chessboard using this maximum number of pieces?[/list]

The ratio of the length to the width of a rectangle is $4:3$. If the rectangle has diagonal of length $d$, then the area may be expressed as $kd^2$ for some constant $k$. What is $k$? $\textbf{(A) }\dfrac27\qquad\textbf{(B) }\dfrac37\qquad\textbf{(C) }\dfrac{12}{25}\qquad\textbf{(D) }\dfrac{16}{25}\qquad\textbf{(E) }\dfrac34$