Found problems: 467
Let a square $ABCD$ with sides of length $1$ be given. A point $X$ on $BC$ is at distance $d$ from $C$, and a point $Y$ on $CD$ is at distance $d$ from $C$. The extensions of: $AB$ and $DX$ meet at $P$, $AD$ and $BY$ meet at $Q, AX$ and $DC$ meet at $R$, and $AY$ and $BC$ meet at $S$. If points $P, Q, R$ and $S$ are collinear, determine $d$.
A square of side $2a$, lying always in the first quadrant of the $xy$-plane, moves so that two consecutive vertices
are always on the $x$- and $y$-axes respectively. Prove that a point within or on the boundary of the square will in general describe a portion of a conic. For what points of the square does this locus degenerate?
Determine all possible digits $z$ for which
$\underbrace{9...9}_{100}z\underbrace{0...0}_{100}9$ is a square number.
You have to divide a square paper into three parts, by two straight cuts, so that by locating these parts properly, without gaps or overlaps, an obtuse triangle is formed. Indicate how to cut the square and how to assemble the triangle with the three parts.
A square is divided into $5$ rectangles in such a way that its $4$ vertices belong to $4$ of the rectangles , whose areas are equal , and the fifth rectangle has no points in common with the side of the square (see diagram) . Prove that the fifth rectangle is a square.
[img]https://3.bp.blogspot.com/-TQc1v_NODek/XWHHgmONboI/AAAAAAAAKi4/XES55OJS5jY9QpNmoURp4y80EkanNzmMwCK4BGAYYCw/s1600/TOT%2B1985%2BSpring%2BJ4.png[/img]
In the following figure, the largest square is divided into two squares and three rectangles, as shown:
The area of each smaller square is equal to $a$ and the area of each small rectangle is equal to $b$. If $a+b=24$ and the root square of $a$ is a natural number, find all possible values for the area of the largest square.
[img]https://cdn.artofproblemsolving.com/attachments/f/a/0b424d9c293889b24d9f31b1531bed5081081f.png[/img]
Let $x, y, z$ be positive integers such that $xy=z^2+2$. Prove that there exist integers $a, b, c, d$ such that the following equalities are satisfied:
\begin{eqnarray*} x=a^2+2b^2\\
y=c^2+d^2\\
z=ac+2bd\\
\end{eqnarray*}
[i]Proposed by Isaac Jiménez[/i]
Let $ABCD$ be a unit square and let $E$ and $F$ be points inside $ABCD$ such that the line containing $\overline{EF}$ is parallel to $\overline{AB}$. Point $E$ is closer to $\overline{AD}$ than point $F$ is to $\overline{AD}$. The line containing $\overline{EF}$ also bisects the square into two rectangles of equal area. Suppose $[AEF B] = [DEFC] = 2[AED] = 2[BFC]$. The length of segment $\overline{EF}$ can be expressed as $m/n$ , where m and $n$ are relatively prime positive integers. Compute $m + n$.
A square-shaped pizza with side length $30$ cm is cut into pieces (not necessarily rectangular). All cuts are parallel to the sides, and the total length of the cuts is $240$ cm. Show that there is a piece whose area is at least $36$ cm$^2$
Let a unit square $\mathcal D$ be given in the plane. For any point $X$ in the plane denote $\mathcal D_X$ the image of $\mathcal D$ in rotation with respect to origin $X$ by $+90^\circ.$ Find the locus of all $X$ such that the area of union $\mathcal D\cup\mathcal D_X$ is at most 1.5.
A circle is inscribed in a triangle and a square is circumscribed around this circle so that no side of the square is parallel to any side of the triangle. Prove that less than half of the square’s perimeter lies outside the triangle.
Let $S$ denote a square of the side-length $7$, and let eight squares of the side-length $3$ be given. Show that $S$ can be covered by those eight small squares.
We say that a polygon $P$ is inscribed in another polygon $Q$ when all the vertices of $P$ belong to the perimeter of $Q$. We also say in this case that $Q$ is circumscribed to $P$. Given a triangle $T$, let $\ell$ be the largest side of a square inscribed in $T$ and $L$ is the shortest side of a square circumscribed to $T$ . Find the smallest possible value of the ratio $L/\ell$ .
There are four houses, located on the vertices of a square. You want to draw a road network, so that you can go from any house to any other. Prove that the network formed by the diagonals is not the shortest. Find a shorter network.
A square is divided into $25$ small squares. We draw diagonals of some of the small squares so that no two diagonals share a common point (not even a common endpoint). What is the largest possible number of diagonals that we can draw?
(I Rubanov)
A square is divided into $25$ unit squares by drawing lines parallel to the sides of the square. Some diagonals of unit squares are drawn from such that two diagonals do not share points. What is the maximum number diagonals that can be drawn with this property?
Let $ABCD$ be a square, and let $P$ be a point on the minor arc $CD$ of its circumcircle. The lines $PA, PB$ meet the diagonals $BD, AC$ at points $K, L$ respectively. The points $M, N$ are the projections of $K, L$ respectively to $CD$, and $Q$ is the common point of lines $KN$ and $ML$. Prove that $PQ$ bisects the segment $AB$.
Let $E, F$ be the midpoints of sides $BC, CD$ of square $ABCD$. Lines $AE$ and $BF$ meet at point $P$. Prove that $\angle PDA = \angle AED$.
In a square $ABCD$, $K$ is a point on the side $BC$ and the bisector of $\angle KAD$ cuts the side $CD$ at the point $M$. Prove that the length of segment $AK$ is equal to the sum of the lengths of segments $DM$ and $BK$.
(Folklore)
Prove that every rectangle circumscribed by a square is itself a square.
(A rectangle is circumscribed by a square if there is exactly one corner point of the square on each side of the rectangle.)
a) A certain locker room contains $n$ lockers numbered $1,2,\ldots,n$ and all are originally locked. An attendant performs a sequence of operations $T_1, T_2 ,\ldots, T_n$, whereby with the operation $T_k$ the state of those lockers whose number is divisible by $k$ is swapped. After all $n$ operations have been performed, it is observed that all lockers whose number is a perfect square (and only those lockers) are open. Prove this.
b) Investigate in a meaningful mathematical way a procedure or set of operations similar to those above which will produce the set of cubes, or the set of numbers of the form $2 m^2 $, or the set of numbers of the form $m^2 +1$, or some nontrivial similar set of your own selection.
Let $K$ and $K'$ be two squares in the same plane, their sides of equal length. Is it possible to decompose $K$ into a finite number of triangles $T_1, T_2, \ldots, T_p$ with mutually disjoint interiors and find translations $t_1, t_2, \ldots, t_p$ such that
\[K'=\bigcup_{i=1}^{p} t_i(T_i) \ ? \]
The quadrilateral $ABCD$ is a square of sidelength $1$, and the points $E, F, G, H$ are the midpoints of the sides. Determine the area of quadrilateral $PQRS$.
[img]https://1.bp.blogspot.com/--fMGH2lX6Go/XzcDqhgGKfI/AAAAAAAAMXo/x4NATcMDJ2MeUe-O0xBGKZ_B4l_QzROjACLcBGAsYHQ/s0/2000%2BMohr%2Bp1.png[/img]
Two squares, both with side length $1$, are arranged so that one has one vertex in the center of the other. Determine the area of the gray area.
[img]https://1.bp.blogspot.com/-xt3pe0rp1SI/XzcGLgEw1EI/AAAAAAAAMYM/vFKxvvVuLvAJ5FO_yX315X3Fg_iFaK2fACLcBGAsYHQ/s0/1997%2BMohr%2Bp2.png[/img]
A $10 \times 10$ table consists of $100$ unit cells. A [i]block[/i] is a $2 \times 2$ square consisting of $4$ unit cells of the table. A set $C$ of $n$ blocks covers the table (i.e. each cell of the table is covered by some block of $C$ ) but no $n -1$ blocks of $C$ cover the table. Find the largest possible value of $n$.