On football toornament there were $4$ teams participating. Every team played exactly one match with every other team. For the win, winner gets $3$ points, while if draw both teams get $1$ point. If at the end of tournament every team had different number of points and first place team had $6$ points, find the points of other teams

Find all real numbers $x, y$ such that: $y+3\sqrt{x+2}=\frac{23}2+y^2-\sqrt{49-16x}$

A month with 31 days has the same number of Mondays and Wednesdays. How many of the seven days of the week could be the first day of this month? $ \textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 6$

Let $A,\ B$ and $C$ be given points on a circumference $K$ such that the triangle $\triangle{ABC}$ is acute. Let $P$ be a point in the interior of $K$. $X,\ Y$ and $Z$ be the other intersection of $AP, BP$ and $CP$ with the circumference. Determine the position of $P$ such that $\triangle{XYZ}$ is equilateral.

Let $(m,n)$ be pair of positive integers. Julia has carefully planted $m$ rows of $n$ dandelions in an $m \times n$ array in her back garden. Now, Jana un Viviane decides to play a game with a lawnmower they just found. Taking alternating turns and starting with Jana, they can now mow down all the dandelions in a straight horizontal or vertical line (and they must mow down at least one dandelion ). The winner is the player who mows down the final dandelion. Determine all pairs of $(m,n)$ for which Jana has a winning strategy.

Prove that there are infinitely many positive integers $m$ for which there exists consecutive odd positive integers $p_m<q_m$ such that $p_m^2+p_mq_m+q_m^2$ and $p_m^2+m\cdot p_mq_m+q_m^2$ are both perfect squares. If $m_1, m_2$ are two positive integers satisfying this condition, then we have $p_{m_1}\neq p_{m_2}$

Let $ABCD$ be a quadrilateral. The diagonals $AC$ and $BD$ are perpendicular at point $O$. The perpendiculars from $O$ on the sides of the quadrilateral meet $AB, BC, CD, DA$ at $M, N, P, Q$, respectively, and meet again $CD, DA, AB, BC$ at $M', N', P', Q'$, respectively. Prove that points $M, N, P, Q, M', N', P', Q'$ are concyclic. Cosmin Pohoata

A prime number $p$ is a [b]moderate[/b] number if for every $2$ positive integers $k > 1$ and $m$, there exists k positive integers $n_1, n_2, ..., n_k $ such that \[ n_1^2+n_2^2+ ... +n_k^2=p^{k+m} \] If $q$ is the smallest [b]moderate[/b] number, then determine the smallest prime $r$ which is not moderate and $q < r$.

For prime number $p$, prove that there are integers $a$, $b$, $c$, $d$ such that for every integer $n$, the expression $n^4+1-\left( n^2+an+b \right) \left(n^2+cn+d \right)$ is a multiple of $p$.

One of Euler's conjectures was disproved in then 1960s by three American mathematicians when they showed there was a positive integer $ n$ such that \[133^5 \plus{} 110^5 \plus{} 84^5 \plus{} 27^5 \equal{} n^5.\] Find the value of $ n$.

The $n$ players of a hockey team gather to select their team captain. Initially, they stand in a circle, and each person votes for the person on their left. The players will update their votes via a series of rounds. In one round, each player $a$ updates their vote, one at a time, according to the following procedure: At the time of the update, if $a$ is voting for $b,$ and $b$ is voting for $c,$ then $a$ updates their vote to $c.$ (Note that $a, b,$ and $c$ need not be distinct; if $b=c$ then $a$'s vote does not change for this update.) Every player updates their vote exactly once in each round, in an order determined by the players (possibly different across different rounds). They repeat this updating procedure for $n$ rounds. Prove that at this time, all $n$ players will unanimously vote for the same person.

What is the product of all the roots of the equation \[\sqrt{5|x|+8} = \sqrt{x^2-16}. \] $ \textbf{(A)}\ -64 \qquad \textbf{(B)}\ -24 \qquad \textbf{(C)}\ -9 \qquad \textbf{(D)}\ 24 \qquad \textbf{(E)}\ 576 $

Prove that $(0,1)$, $(0, -1)$,$( -1,1)$ and $(-1,-1)$ are the only integer solutions of $$x^2 + x +1 = y^2.$$

A line parallel to the side $BC$ of a triangle $ABC$ meets the sides $AB$ and $AC$ at points $P$ and $Q$, respectively. A point $M$ is chosen inside the triangle $APQ$. The segments $MB$ and $MC$ meet the segment $PQ$ at points $E$ and $F$, respectively. Let $N$ be the second intersection point of the circumcircles of the triangles $PMF$ and $QME$. Prove that the points $A,M,N$ are collinear.

Let $\triangle ABC$ be a right triangle with hypotenuse $AC$. A square is inscribed in the triangle such that points $D,E$ are on $AC$, $F$ is on $BC$, and $G$ is on $AB$. Given that $AG=2$ and $CF=5$, what is the area of $\triangle BFG$?

Given that $a,b$, and $c$ are positive real numbers such that $ab + bc + ca \geq 1$, prove that \[ \frac{1}{a^2} + \frac{1}{b^2} + \frac{1}{c^2} \geq \frac{\sqrt{3}}{abc} .\]

Given a regular polygon with $n$ sides. It is known that there are $1200$ ways to choose three of the vertices of the polygon such that they form the vertices of a [b]right triangle[/b]. What is the value of $n$?

Let $A$ be a fixed point on a circle, $B$ and$ C$ be arbitrary points on the circle different from $A$ and at different distances. The bisector of the angle $\angle BAC$ intersects the chord $BC$ and the circle at points $K$ and $P$, $D$ is the projection of $A$ onto the straight line $BC$. A circle passing through points $K$, $P$ and $D$ intersects the straight line $AD$ for the second time at point $M$. Find the locus of points $M$.

In a school there are 2008 students. Students are members of certain committees. A committee has at most 1004 members and every two students join a common committee. (a) Determine the smallest possible number of committees in the school. (b) If it is further required that the union of any two committees consists of at most 1800 students, will your answer in (a) still hold?

We have a number of towns, with bus routes between some of them (each bus route goes from a town to another town without any stops). It is known that you can get from any town to any other by bus (possibly changing buses several times). Mr. Ivanov bought one ticket for each of the bus routes (a ticket allows single travel in either direction, but not returning on the same route). Mr. Petrov bought n tickets for each of the bus routes. Both Ivanov and Petrov started at town A. Ivanov used up all his tickets without buying any new ones and finished his travel at town B. Petrov, after using some of his tickets, got stuck at town X: he can not leave it without buying a new ticket. Prove that X is either A or B.

Let $ABCD$ be a tetrahedron such that $AD \perp BD$, $BD \perp CD$, $CD \perp AD$ and $AD=10$, $BD=15$, $CD=20$. Let $E$ and $F$ be points such that $E$ lies on $BC$, $DE \perp BC$, and $ADEF$ is a rectangle. If $S$ is the solid consisting of all points inside $ABCD$ but outside $FBCD$, compute the volume of $S$. [i]2015 CCA Math Bonanza Individual Round #13[/i]

Positive integer divisors $a$ and $b$ of $n$ are called [i]complementary[/i] if $ab=n$. Given that $N$ has a pair of complementary divisors that differ by $20$ and a pair of complementary divisors that differ by $23$, find the sum of the digits of $N$. $\textbf{(A) } 11 \qquad \textbf{(B) } 13 \qquad \textbf{(C) } 15 \qquad \textbf{(D) } 17 \qquad \textbf{(E) } 19$

Hapi, the god of the annual flooding of the Nile is preparing for this year’s flooding. The shape of the channel of the Nile can be described by the function $y = \frac{-1000}{ x^2+100}$ where the $x$ and $y$ coordinates are in metres. The depth of the river is $5$ metres now. Hapi plans to increase the water level by $3$ metres. How many metres wide will the river be after the flooding? The depth of the river is always measured at its deepest point. [img]https://cdn.artofproblemsolving.com/attachments/8/3/4e1d277e5cacf64bf82c110d521747592b928e.png[/img]

Prove that for any odd prime number $ p,$ the number of positive integer $ n$ satisfying $ p|n! \plus{} 1$ is less than or equal to $ cp^\frac{2}{3}.$ where $ c$ is a constant independent of $ p.$

In a $100$ by $100$ grid, there is a spider and $100$ bugs. Each time, the spider can walk up, down, left or right, and the spider aims to visit all the squares with bugs to eat them all. The spider begins from the top-left corner. Show that no matter where the bugs are, the spider can always eat them all within $2000$ steps.