There are $1999$ people participating in an exhibition. Among any $50$ people there are two who don't know each other. Prove that there are $41$ people, each of whom knows at most $1958$ people.

Let $a,b$ be two integers. Prove that a) $13 \mid 2a+3b$ if and only if $13 \mid 2b-3a$; b) If $13 \mid a^2+b^2$ then $13 \mid (2a+3b)(2b+3a)$. [i]Mircea Fianu[/i]

A large square region is paved with $n^2$ gray square tiles, each measuring $s$ inches on a side. A border $d$ inches wide surrounds each tile. The figure below shows the case for $n = 3$. When $n = 24$, the $576$ gray tiles cover $64\%$ of the area of the large square region. What is the ratio $\frac{d}{s}$ for this larger value of $n$? [asy] draw((0,0)--(13,0)--(13,13)--(0,13)--cycle); filldraw((1,1)--(4,1)--(4,4)--(1,4)--cycle, mediumgray); filldraw((1,5)--(4,5)--(4,8)--(1,8)--cycle, mediumgray); filldraw((1,9)--(4,9)--(4,12)--(1,12)--cycle, mediumgray); filldraw((5,1)--(8,1)--(8,4)--(5,4)--cycle, mediumgray); filldraw((5,5)--(8,5)--(8,8)--(5,8)--cycle, mediumgray); filldraw((5,9)--(8,9)--(8,12)--(5,12)--cycle, mediumgray); filldraw((9,1)--(12,1)--(12,4)--(9,4)--cycle, mediumgray); filldraw((9,5)--(12,5)--(12,8)--(9,8)--cycle, mediumgray); filldraw((9,9)--(12,9)--(12,12)--(9,12)--cycle, mediumgray); [/asy] $\textbf{(A) }\frac6{25} \qquad \textbf{(B) }\frac14 \qquad \textbf{(C) }\frac9{25} \qquad \textbf{(D) }\frac7{16} \qquad \textbf{(E) }\frac9{16}$

Let $ABCD$ be a regular tetrahedron with side length $1$. Let $X$ be the point in the triangle $BCD$ such that $[XBC]=2[XBD]=4[XCD]$, where $[\overline{\omega}]$ denotes the area of figure $\overline{\omega}$. Let $Y$ lie on segment $AX$ such that $2AY=YX$. Let $M$ be the midpoint of $BD$. Let $Z$ be a point on segment $AM$ such that the lines $YZ$ and $BC$ intersect at some point. Find $\frac{AZ}{ZM}$.

Find the number of ordered triples of integers $(a,b,c)$, each between $1$ and $64$, such that \[ a^2 + b^2 \equiv c^2\pmod{64}. \]

In an isosceles triangle $ABC$ with $AB = AC$ and $\angle A = 30^o$, points $L$ and $M$ lie on the sides $AB$ and $AC$, respectively such that $AL = CM$. Point $K$ lies on $AB$ such that $\angle AMK = 45^o$. If $\angle LMC = 75^o$, prove that $KM +ML = BC$. [i]Proposed by Mahdi Etesamifard - Iran[/i]

Given any four distinct positive real numbers, show that one can choose three numbers $A,B,C$ from among them, such that all three quadratic equations \begin{eqnarray*} Bx^2 + x + C &=& 0\\ Cx^2 + x + A &=& 0 \\ Ax^2 + x +B &=& 0 \end{eqnarray*} have only real roots, or all three equations have only imaginary roots.

The incircle of a triangle $ABC$ touches the side $AB$ and $AC$ at respectively at $X$ and $Y$. Let $K$ be the midpoint of the arc $\widehat{AB}$ on the circumcircle of $ABC$. Assume that $XY$ bisects the segment $AK$. What are the possible measures of angle $BAC$?

Find all quadruples of positive integers $(p, q, a, b)$, where $p$ and $q$ are prime numbers and $a > 1$, such that $$p^a = 1 + 5q^b.$$

Lisa writes a positive whole number in the decimal system on the blackboard and now makes in each turn the following: The last digit is deleted from the number on the board and then the remaining shorter number (or 0 if the number was one digit) becomes four times the number deleted number added. The number on the board is now replaced by the result of this calculation. Lisa repeats this until she gets a number for the first time was on the board. (a) Show that the sequence of moves always ends. (b) If Lisa begins with the number $53^{2022} - 1$, what is the last number on the board? Example: If Lisa starts with the number $2022$, she gets $202 + 4\cdot 2 = 210$ in the first move and overall the result $$2022 \to 210 \to 21 \to 6 \to 24 \to 18 \to 33 \to 15 \to 21$$. Since Lisa gets $21$ for the second time, the turn order ends. [i](Stephan Pfannerer)[/i]

Given a convex pentagon $ABCDE$, points $A_1, B_1, C_1, D_1, E_1$ are such that $$AA_1 \perp BE, BB_1 \perp AC, CC_1 \perp BD, DD_1 \perp CE, EE_1 \perp DA.$$ In addition, $AE_1 = AB_1, BC_1 = BA_1, CB_1 = CD_1$ and $DC_1 = DE_1$. Prove that $ED_1 = EA_1$

Let \( \varphi \) be the Euler's totient function. 1. For any given integer \( a > 1 \), does there exist \( l \in \mathbb{N}_+ \) such that for any \( k \in \mathbb{N}_+ \), \( l \mid k \) and \( a^2 \nmid l \), \( \frac{\varphi(k)}{\varphi(l)} \) is a non-negative power of \( a \)? 2. For integer \( x > a \), are there integers \( k_1 \) and \( k_2 \) satisfying: \[ \varphi(k_i) \in \left ( \frac{x}{a} ,x \right ], i = 1,2; \quad \varphi(k_1) \neq \varphi(k_2). \] And these two different \( k_i \) correspond to the same \( l_1 \) and \( l_2 \) as described in (1), yet \( \varphi(l_1) = \varphi(l_2) \). 3. Define \( \#E \) as the number of elements in set \( E \). For integer \( x > a \), let \( V(x) = \#\{v \in \mathbb{N}_+ \mid v = \varphi(k) \leq x\} \) and \( W(x) = \#\{w \in \mathbb{N}_+ \mid w = \varphi(l) \leq x, a^2 \mid l\} \). Compare \( V\left( \frac{x}{a} \right) \) with \( W(x) \).

In a $m\times n$ chessboard ($m,n\ge 2$), some dominoes are placed (without overlap) with each domino covering exactly two adjacent cells. Show that if no more dominoes can be added to the grid, then at least $2/3$ of the chessboard is covered by dominoes. [i]Proposed by DVDthe1st, mzy and jjax[/i]

We call a sequence of $m$ consecutive integers a [i]friendly[/i] sequence if its first term is divisible by $1$, the second by $2$, ..., the $(m-1)^{th}$ by $m-1$, and in addition, the last term is divisible by $m^2$ Does a friendly sequence exist for (a) $m=20$ and (b) $m=11$?

For $ k>0$, let $ I_k\equal{}10\ldots 064$, where there are $ k$ zeros between the $ 1$ and the $ 6$. Let $ N(k)$ be the number of factors of $ 2$ in the prime factorization of $ I_k$. What is the maximum value of $ N(k)$? $ \textbf{(A)}\ 6\qquad \textbf{(B)}\ 7\qquad \textbf{(C)}\ 8\qquad \textbf{(D)}\ 9\qquad \textbf{(E)}\ 10$

Two positive integers are coprime if their greatest common divisor is $1$. Let $C$ be the set of all divisors of the number $8775$ that are greater than $ 1$. A set of $k$ consecutive positive integers satisfies that each of them is coprime with some element of $C$. Determine the largest possible value of $K$.

Let $A$ be a $5\times10$ matrix with real entries, and let $A^{\text T}$ denote its transpose. Suppose every $5\times1$ matrix with real entries can be written in the form $A\mathbf u$ where $\mathbf u$ is a $10\times1$ matrix with real entries. Prove that every $5\times1$ matrix with real entries can be written in the form $AA^{\text T}\mathbf v$ where $\mathbf v$ is a $5\times1$ matrix with real entries.

Find the number of polynomials $P(x)$ of degree $6$ whose coefficients are in the set $\{1,2,\ldots,1999\}$ and which are divisible by $x^3+x^2+x+1$.

Pete claims that he can draw $3$ segments of length $1$ and a circle of radius less than $\sqrt3 / 3$ on a piece of paper, such that all segments would lie inside the circle and there would be no line that intersects each of $3 $ segments. Is Pete right?

The increasing geometric sequence $x_{0},x_{1},x_{2},\ldots$ consists entirely of integral powers of $3.$ Given that \[\sum_{n=0}^{7}\log_{3}(x_{n}) = 308\qquad\text{and}\qquad 56 \leq \log_{3}\left ( \sum_{n=0}^{7}x_{n}\right ) \leq 57,\] find $\log_{3}(x_{14}).$

The streets of a town are arranged in three directions , dividing the town into blocks which are equilateral triangles of equal area. Traffic , when reaching an intersection, may only go straight ahead, or turn left or right through $120^0$ , as shown in the diagram. [img]https://cdn.artofproblemsolving.com/attachments/3/6/a100a5c39bf15116582bc0bceb76fcbae28af9.png[/img] No turns are permitted except the ones at intersections . One car departs for a certain nearby intersection and when it reaches it a second car starts moving toward it. From then on both cars continue travelling at the same speed (but do not necessarily take the same turns). Is it possible that there will be a time when they will encounter each other somewhere? ( N . N . Konstantinov , Moscow )

Prove that for any positive integer $n$ there is an equiangular hexagon whose sidelengths are $n + 1, n + 2 ,..., n + 6$ in some order.

A square is inscribed into an acute-angled triangle: two vertices of this square lie on the same side of the triangle and two remaining vertices lies on two remaining sides. Two similar squares are constructed for the remaining sides. Prove that three segments congruent to the sides of these squares can be the sides of an acute-angled triangle.

Let $ A_0\equal{}(0,0)$. Distinct points $ A_1,A_2,\ldots$ lie on the $ x$-axis, and distinct points $ B_1,B_2,\ldots$ lie on the graph of $ y\equal{}\sqrt{x}$. For every positive integer $ n$, $ A_{n\minus{}1}B_nA_n$ is an equilateral triangle. What is the least $ n$ for which the length $ A_0A_n\ge100$? $ \textbf{(A)}\ 13\qquad \textbf{(B)}\ 15\qquad \textbf{(C)}\ 17\qquad \textbf{(D)}\ 19\qquad \textbf{(E)}\ 21$

There are $n$ points in the page such that no three of them are collinear.Prove that number of triangles that vertices of them are chosen from these $n$ points and area of them is 1,is not greater than $\frac23(n^2-n)$.