Some friends formed $6$ football teams, and decided to hold a tournament where each team faces each other exactly once in a match. In each match, whoever wins gets $3$ points, whoever loses gets no points, and if the two teams draw, each gets $1$ point. At the end of the tournament, it was found that the teams' scores were $10$, $9$, $6$, $6$, $4$ and $2$ points. Regarding this tournament, answer the following items, justifying your answer in each one. (a) How many matches ended in a draw in the tournament? (b) Determine, for each of the $6$ teams, the number of wins, draws and losses. (c) If we consider only the matches played between the team that scored $9$ points against the two teams that scored $6$ points, and the one played between the two teams that scored $6$ points, explain why among these three matches, there are at least $2$ draws.

In acute-angled triangle $ABC,$ $E,F$ are on the side $BC,$ such that $\angle BAE=\angle CAF,$ and let $M,N$ be the projections of $F$ onto $AB,AC,$ respectively. The line $AE$ intersects $ \odot (ABC) $ at $D$(different from point $A$). Prove that $S_{AMDN}=S_{\triangle ABC}.$

In the triangle $[ABC], D$ is the midpoint of $[AB]$ and $E$ is the trisection point of $[BC]$ closer to $C$. If $\angle ADC= \angle BAE$ , find the measue of $\angle BAC$ .

Prove that there are no perfect squares in the array below: \[\begin{array}{cccc}11&111&1111&...\\22&222&2222&...\\33&333&3333&...\\44&444&4444&...\\55&555&5555&... \\66&666&6666&...\\77&777&7777&...\\88&888&8888&...\\99&999&9999&...\end{array}\]

Let's say a positive integer $ n$ is [i]atresvido[/i] if the set of its divisors (including 1 and $ n$) can be split in in 3 subsets such that the sum of the elements of each is the same. Determine the least number of divisors an atresvido number can have.

Let $ ABCD $ be a convex quadrilateral. Let angle bisectors of $ \angle B $ and $ \angle C $ intersect at $ E $. Let $ AB $ intersect $ CD $ at $ F $. Prove that if $ AB+CD=BC $, then $A,D,E,F$ is cyclic.

As shown in the figure below, $ABCD$ is a trapezoid, $AB \parallel CD$. The sides $DA$, $AB$, $BC$ are tangent to $\odot O_1$ and $AB$ touches $\odot O_1$ at $P$. The sides $BC$, $CD$, $DA$ are tangent to $\odot O_2$, and $CD$ touches $\odot O_2$ at $Q$. Prove that the lines $AC$, $BD$, $PQ$ meet at the same point. [asy] size(200); defaultpen(linewidth(0.8)+fontsize(10pt)); pair A=origin,B=(1,-7),C=(30,-15),D=(26,6); pair bisA=bisectorpoint(B,A,D),bisB=bisectorpoint(A,B,C),bisC=bisectorpoint(B,C,D),bisD=bisectorpoint(C,D,A); path bA=A--(bisA+100*(bisA-A)),bB=B--(bisB+100*(bisB-B)),bC=C--(bisC+100*(bisC-C)),bD=D--(bisD+100*(bisD-D)); pair O1=intersectionpoint(bA,bB),O2=intersectionpoint(bC,bD); dot(O1^^O2,linewidth(2)); pair h1=foot(O1,A,B),h2=foot(O2,C,D); real r1=abs(O1-h1),r2=abs(O2-h2); draw(circle(O1,r1)^^circle(O2,r2)); draw(A--B--C--D--cycle); draw(A--C^^B--D^^h1--h2); label("$A$",A,NW); label("$B$",B,SW); label("$C$",C,dir(350)); label("$D$",D,dir(350)); label("$P$",h1,dir(200)); label("$Q$",h2,dir(350)); label("$O_1$",O1,dir(150)); label("$O_2$",O2,dir(300)); [/asy]

Let $n$ be a positive integer and $N=n^{2021}$. There are $2021$ concentric circles centered at $O$, and $N$ equally-spaced rays are emitted from point $O$. Among the $2021N$ intersections of the circles and the rays, some are painted red while the others remain unpainted. It is known that, no matter how one intersection point from each circle is chosen, there is an angle $\theta$ such that after a rotation of $\theta$ with respect to $O$, all chosen points are moved to red points. Prove that the minimum number of red points is $2021n^{2020}$. [I]Proposed by usjl.[/i]

Find the value of $x$ where the graph of $$y=\log_3(\sqrt{x^2+729}+x)-2\log_3(\sqrt{x^2+729}-x)$$ crosses the $x$-axis.

In triangle $ABC$ with $AB=8$ and $AC=10$, the incenter $I$ is reflected across side $AB$ to point $X$ and across side $AC$ to point $Y$. Given that segment $XY$ bisects $AI$, compute $BC^2$. (The incenter is the center of the inscribed circle of triangle .)

Given positive integers $k, m, n$ such that $1 \leq k \leq m \leq n$. Evaluate \[\sum^{n}_{i=0} \frac{(-1)^i}{n+k+i} \cdot \frac{(m+n+i)!}{i!(n-i)!(m+i)!}.\]

Consider those functions $ f$ that satisfy $ f(x \plus{} 4) \plus{} f(x \minus{} 4) \equal{} f(x)$ for all real $ x$. Any such function is periodic, and there is a least common positive period $ p$ for all of them. Find $ p$. $ \textbf{(A)}\ 8\qquad \textbf{(B)}\ 12\qquad \textbf{(C)}\ 16\qquad \textbf{(D)}\ 24\qquad \textbf{(E)}\ 32$

Solve the given system in prime numbers \begin{align*} x^2+yu = (x+u)^v \end{align*} \begin{align*} x^2+yz=u^4 \end{align*}

Let $a>0,b>0,c>0$ and $a+b+c=1$. Show the inequality $$\frac{a^4+b^4}{a^2+b^2}+\frac{b^3+c^3}{b+c} + \frac{2a^2+b^2+2c^2}{2} \geq \frac{1}{2}$$

Given a finite set $B$ of points in space, any two distances between the points of this set are different. Each point of the set $B$ is connected by a line segment to the closest point of the set $B$. This way we will get a set of sections, one of which (any chosen one) we paint red, all the remaining sections we paint green. Prove that there are two points of the set $B$ that cannot be connected by a line composed of green segments.

Real numbers are chosen at random from the interval $[0,1].$ If after choosing the $n$-th number the sum of the numbers so chosen first exceeds $1$, show that the expected value for $n$ is $e$.

Find all rational solutions to: \begin{eqnarray*} t^2 - w^2 + z^2 &=& 2xy \\ t^2 - y^2 + w^2 &=& 2xz \\ t^2 - w^2 + x^2 &=& 2yz . \end{eqnarray*}

Let $ABCD$ be a circumscribed quadrilateral and let $X$ be the intersection point of its diagonals $AC$ and $BD$. Let $I_1, I_2, I_3, I_4$ be the incenters of $\triangle DXC$, $\triangle BXC$, $\triangle AXB$, and $\triangle DXA$, respectively. The circumcircle of $\triangle CI_1I_2$ intersects the sides $CB$ and $CD$ at points $P$ and $Q$, respectively. The circumcircle of $\triangle AI_3I_4$ intersects the sides $AB$ and $AD$ at points $M$ and $N$, respectively. Prove that $AM+CQ=AN+CP$

We call an even positive integer $n$ [i]nice[/i] if the set $\{1, 2, \dots, n\}$ can be partitioned into $\frac{n}{2}$ two-element subsets, such that the sum of the elements in each subset is a power of $3$. For example, $6$ is nice, because the set $\{1, 2, 3, 4, 5, 6\}$ can be partitioned into subsets $\{1, 2\}$, $\{3, 6\}$, $\{4, 5\}$. Find the number of nice positive integers which are smaller than $3^{2022}$.

[b]Classical Probability Distribution for Quantum States?[/b] The goal of this problem is to try and mimic a Statistical Mechanics approach to Quantum Mechanics. In Classical Statistical Mechanics one has the usual Gibbs-Boltzmann Formula which gives the probability distribution in phase-space to be: \[ \rho(x_1,\dots,x_n,p_1,\dots,p_n) \sim \exp(-\beta H(x_1,\dots,x_n,p_1,\dots,p_n))\] where $H$ is the Hamiltonian of the system. [list=1] [*] Why can't we demand a similar probability distribution over phase-space in Quantum Mechanics? \\ If the wave function $\psi(x_1,\dots,x_n)$ is given, we construct the following expression: \begin{align*} \begin{split} & P(x_1,\dots,x_n,p_1,\dots,p_n) \\ & = \left(\frac{1}{\pi\hbar}\right)^n \int_{-\infty}^{\infty} \dots \int_{-\infty}^{\infty} dy_1\dots dy_n \psi^*(x_1+y_1,\dots,x_n+y_n) \\ & \times \psi(x_1-y_1,\dots,x_n-y_n) \exp\left(\frac{2i}{\hbar}(p_1y_1+\dots+p_ny_n)\right) \end{split} \end{align*}[/*] [*] Show that, \[ \int_{-\infty}^{\infty}\dots\int_{-\infty}^{\infty} dp_1\dots dp_n P(x_1,\dots,x_n,p_1,\dots,p_n) = \left|\psi(x_1,\dots,x_n)\right|^2\] which are the correct probabilities for the co-ordinates. [/*] [*] Show that, \[ \int_{-\infty}^{\infty}\dots\int_{-\infty}^{\infty} dx_1\dots dx_n \, P(x_1,\dots,x_n,p_1,\dots,p_n) = \left|\tilde{\psi}(p_1,\dots,p_n)\right|^2\] which are the correct probabilities for the momenta where, \[ \tilde{\psi}(p_1,\dots,p_n) = \int_{-\infty}^{\infty}\dots\int_{-\infty}^{\infty} dx_1\dots dx_n \psi(x_1,\dots,x_n) \exp\left(-\frac{i}{\hbar}(x_1p_1+\dots+x_np_n)\right)\] is the Fourier transform of the wave-function $\psi(x_1,\dots,x_n)$. [/*] [*] The function $P$ defined above therefore seems to be a good candidate for a probability distribution in Quantum Mechanics. Would this not contradict part (a)? Give reasons to support your answer. [/*] [/list]

Let $ABC$ be a triangle with $\angle BAC = 90^\circ$ and $AB > AC$. Let $D$ be the foot of the altitude from $A$ to $BC$, $M$ be the midpoint of $BC$ and $A'$ be the reflection of $A$ over $D$. Let the mediatrix of $DM$ intersect lines $AB$ and $A'C$ at $P$ and $Q$, respectively. Let $K$ be the intersection of lines $A'C$ and $AB$. Prove that $PQ$ is tangent to the circumcircle of triangle $QDK$.

Let $K, L, M$ be the feet of the altitudes drawn from the vertices $A, B, C$ of triangle $ABC$, respectively. Prove that $\overrightarrow{AK} + \overrightarrow{BL} + \overrightarrow{CM} = \overrightarrow{O}$ if and only if $ABC$ is equilateral.

$x$ and $y$ are positive real numbers where $x$ is $p$ percent of $y$, and $y$ is $4p$ percent of $x$. What is $p$?

Let $\vartriangle ABC$ be an equilateral triangle with side $1$. The points $P$, $Q$, $R$ are chosen on the sides of the segments $AB$, $BC$, $AC$ respectively in such a way that $$\frac{AP}{PB}=\frac{BQ}{QC}=\frac{CR}{RA}=\frac25.$$ Find the area of triangle $PQR$. [img]https://cdn.artofproblemsolving.com/attachments/8/4/6184d66bd3ae23db29a93eeef241c46ae0ad44.png[/img]

An equilateral triangle is given. A point lies on the incircle of this triangle. If the smallest two distances from the point to the sides of the triangle is $1$ and $4$, the sidelength of this equilateral triangle can be expressed as $\tfrac{a\sqrt b}c$ where $(a,c)=1$ and $b$ is not divisible by the square of an integer greater than $1$. Find $a+b+c$.