Determine whether there exist 2024 distinct positive integers satisfying the following: if we consider every possible ratio between two distinct numbers (we include both $a/b$ and $b/a$), we will obtain numbers with finite decimal expansions (after the decimal point) of mutually distinct non-zero lengths.

Supppose five points in a plane are situated so that no two of the straight lines joining them are parallel, perpendicular, or coincident. From each point perpendiculars are drawn to all the lines joining the other four points. Determine the maxium number of intersections that these perpendiculars can have.

Let $M$ be the incenter of the tangential quadrilateral $A_1A_2A_3A_4$. Let line $g_1$ through $A_1$ be perpendicular to $A_1M$; define $g_2,g_3$ and $g_4$ similarly. The lines $g_1,g_2,g_3$ and $g_4$ define another quadrilateral $B_1B_2B_3B_4$ having $B_1$ be the intersection of $g_1$ and $g_2$; similarly $B_2,B_3$ and $B_4$ are intersections of $g_2$ and $g_3$, $g_3$ and $g_4$, resp. $g_4$ and $g_1$. Prove that the diagonals of quadrilateral $B_1B_2B_3B_4$ intersect in point $M$. [asy] import graph; size(15cm); real lsf=0.5; pen dps=linewidth(0.7)+fontsize(10); defaultpen(dps); pen ds=black; real xmin=-9.773972777861085,xmax=12.231603726660566,ymin=-3.9255487671791487,ymax=7.37238601960895; pair M=(2.,2.), A_4=(-1.6391623316400197,1.2875505916864178), A_1=(3.068893183992864,-0.5728665455336459), A_2=(4.30385937824148,2.2922812065339455), A_3=(2.221541124684679,4.978916319940133), B_4=(-0.9482172571022687,-2.24176848577888), B_1=(4.5873184669543345,0.057960746374459436), B_2=(3.9796042717514277,4.848169684238838), B_3=(-2.4295496490492385,5.324816563638236); draw(circle(M,2.),linewidth(0.8)); draw(A_4--A_1,linewidth(0.8)); draw(A_1--A_2,linewidth(0.8)); draw(A_2--A_3,linewidth(0.8)); draw(A_3--A_4,linewidth(0.8)); draw(M--A_3,linewidth(0.8)+dotted); draw(M--A_2,linewidth(0.8)+dotted); draw(M--A_1,linewidth(0.8)+dotted); draw(M--A_4,linewidth(0.8)+dotted); draw((xmin,-0.07436970390935019*xmin+5.144131675605378)--(xmax,-0.07436970390935019*xmax+5.144131675605378),linewidth(0.8)); draw((xmin,-7.882338401302275*xmin+36.2167572574517)--(xmax,-7.882338401302275*xmax+36.2167572574517),linewidth(0.8)); draw((xmin,0.4154483588930812*xmin-1.847833182441644)--(xmax,0.4154483588930812*xmax-1.847833182441644),linewidth(0.8)); draw((xmin,-5.107958950031516*xmin-7.085223310768749)--(xmax,-5.107958950031516*xmax-7.085223310768749),linewidth(0.8)); dot(M,linewidth(3.pt)+ds); label("$M$",(2.0593440948136896,2.0872038897020024),NE*lsf); dot(A_4,linewidth(3.pt)+ds); label("$A_4$",(-2.6355449660387147,1.085078446888477),NE*lsf); dot(A_1,linewidth(3.pt)+ds); label("$A_1$",(3.1575637581709772,-1.2486383377457595),NE*lsf); dot(A_2,linewidth(3.pt)+ds); label("$A_2$",(4.502882845783654,2.30684782237346),NE*lsf); dot(A_3,linewidth(3.pt)+ds); label("$A_3$",(2.169166061149418,5.203402184478307),NE*lsf); label("$g_3$",(-9.691606303109287,5.354407388189934),NE*lsf); label("$g_2$",(3.0889250292111465,6.727181967386543),NE*lsf); label("$g_1$",(-4.763345563793459,-3.4725331560442676),NE*lsf); label("$g_4$",(-2.663000457622647,6.878187171098171),NE*lsf); dot(B_4,linewidth(3.pt)+ds); label("$B_4$",(-1.5647807942653595,-3.0332452907013523),NE*lsf); dot(B_1,linewidth(3.pt)+ds); label("$B_1$",(4.955898456918535,-0.6583452686912173),NE*lsf); dot(B_2,linewidth(3.pt)+ds); label("$B_2$",(4.104778217816637,5.0661247265586455),NE*lsf); dot(B_3,linewidth(3.pt)+ds); label("$B_3$",(-3.4454819677647146,5.656417795613188),NE*lsf); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); [/asy]

A collection $F$ of distinct (not necessarily non-empty) subsets of $X = \{1,2,\ldots,300\}$ is [i]lovely[/i] if for any three (not necessarily distinct) sets $A$, $B$ and $C$ in $F$ at most three out of the following eight sets are non-empty \begin{align*}A \cap B \cap C, \ \ \ \overline{A} \cap B \cap C, \ \ \ A \cap \overline{B} \cap C, \ \ \ A \cap B \cap \overline{C}, \\ \overline{A} \cap \overline{B} \cap C, \ \ \ \overline{A} \cap B \cap \overline {C}, \ \ \ A \cap \overline{B} \cap \overline{C}, \ \ \ \overline{A} \cap \overline{B} \cap \overline{C} \end{align*} where $\overline{S}$ denotes the set of all elements of $X$ which are not in $S$. What is the greatest possible number of sets in a lovely collection?

Let ${n}$ and $k$ be positive integers. There are given ${n}$ circles in the plane. Every two of them intersect at two distinct points, and all points of intersection they determine are pairwise distinct (i. e. no three circles have a common point). No three circles have a point in common. Each intersection point must be colored with one of $n$ distinct colors so that each color is used at least once and exactly $k$ distinct colors occur on each circle. Find all values of $n\geq 2$ and $k$ for which such a coloring is possible. [i]Proposed by Horst Sewerin, Germany[/i]

Let $ABC$ be an acute triangle with $AC> AB$. be $\Gamma$ the circumcircle circumscribed to the triangle $ABC$ and $D$ the midpoint of the smallest arc $BC$ of this circle. Let $E$ and $F$ points of the segments $AB$ and $AC$ respectively such that $AE = AF$. Let $P \neq A$ be the second intersection point of the circumcircle circumscribed to $AEF$ with $\Gamma$. Let $G$ and $H$ be the intersections of lines $PE$ and $PF$ with $\Gamma$ other than $P$, respectively. Let $J$ and $K$ be the intersection points of lines $DG$ and $DH$ with lines $AB$ and $AC$ respectively. Show that the $JK$ line passes through the midpoint of $BC$

Consider triangle $P_1P_2P_3$ and a point $p$ within the triangle. Lines $P_1P, P_2P, P_3P$ intersect the opposite sides in points $Q_1, Q_2, Q_3$ respectively. Prove that, of the numbers \[ \dfrac{P_1P}{PQ_1}, \dfrac{P_2P}{PQ_2}, \dfrac{P_3P}{PQ_3} \] at least one is $\leq 2$ and at least one is $\geq 2$

On every side of a square $ABCD$, we consider three points different (to each other). a) Find the number of line segments defined with endpoints those points , that do not lie on sides of the square. b) If there are no three of the previous line segments passing through the same point, find how many of the intersection points of those segmens line in the interior of the square.

Given a positive integer $n$, does there exist a planar polygon and a point in its plane such that every line through that point meets the boundary of the polygon at exactly $2n$ points?

Let there be a scalene triangle $ABC$, and its incircle hits $BC, CA, AB$ at $D, E, F$. The perpendicular bisector of $BC$ meets the circumcircle of $ABC$ at $P, Q$, where $P$ is on the same side with $A$ with respect to $BC$. Let the line parallel to $AQ$ and passing through $D$ meet $EF$ at $R$. Prove that the intersection between $EF$ and $PQ$ lies on the circumcircle of $BCR$.

Given the focus $F$ and the directrix $D$ of a parabola $P$ and a line $L$, describe a euclidean construction for the point or points of intersection of $P$ and $L.$ Be sure to identify the case for which there are no points of intersection.

Which regular polygon can be obtained (and how) by cutting a cube with a plane ?

Let $K$ denote the set $\{a, b, c, d, e\}$. $F$ is a collection of $16$ different subsets of $K$, and it is known that any three members of $F$ have at least one element in common. Show that all $16$ members of $F$ have exactly one element in common.

Points $A$, $B$, $C$, and $D$ lie on a line in that order, and points $E$ and $F$ are located outside the line such that $EA=EB$, $FC=FD$ and $EF \parallel AD$. Let the circumcircles of triangles $ABF$ and $CDE$ intersect at points $P$ and $Q$, and the circumcircles of triangles $ACF$ and $BDE$ intersect at points $M$ and $N$. Prove that the lines $PQ$ and $MN$ pass through the midpoint of segment $EF$. [i] Proposed by Giorgi Arabidze, Georgia[/i]

Consider a circle with center $O$ and radius $R,$ and let $A$ and $B$ be two points in the plane of this circle. [b]a.)[/b] Draw a chord $CD$ of the circle such that $CD$ is parallel to $AB,$ and the point of the intersection $P$ of the lines $AC$ and $BD$ lies on the circle. [b]b.)[/b] Show that generally, one gets two possible points $P$ ($P_{1}$ and $P_{2}$) satisfying the condition of the above problem, and compute the distance between these two points, if the lengths $OA=a,$ $OB=b$ and $AB=d$ are given.