We consider sports tournaments with $n \ge 4$ participating teams and where every pair of teams plays against one another at most one time. We call such a tournament [i]balanced [/i] if any four participating teams play exactly three matches between themselves. So, not all teams play against one another. Determine the largest value of $n$ for which a balanced tournament with $n$ teams exists.

It has to be proven: If at least two of the real numbers $a, b, c$ are different from zero, then the inequality holds $$\frac{a^2}{b^2 + c^2} + \frac{b^2}{c^2 + a^2} + \frac{c^2}{a^2 + b^2} \ge \frac32$$ Under what conditions does equality occur?

Given the line $y = \dfrac{3}{4}x + 6$ and a line $L$ parallel to the given line and $4$ units from it. A possible equation for $L$ is: $\textbf{(A)}\ y = \dfrac{3}{4}x + 1 \qquad \textbf{(B)}\ y = \dfrac{3}{4}x\qquad \textbf{(C)}\ y = \dfrac{3}{4}x -\dfrac{2}{3} \qquad$ $ \textbf{(D)}\ y = \dfrac{3}{4}x -1 \qquad \textbf{(E)}\ y = \dfrac{3}{4}x + 2$

Three squares are constructed on the sides of the triangle to the outside. What should be the angles of the triangle so that the six vertices of these squares, other than the vertices of the triangle, lie on the same circle?

In $\vartriangle ABC$, the external angle bisector of $\angle BAC$ intersects line $BC$ at $D$. $E$ is a point on ray $\overrightarrow{AC}$ such that $\angle BDE = 2\angle ADB$. If $AB = 10$, $AC = 12$, and $CE = 33$, compute $\frac{DB}{DE}$ .

You are presented with a mystery function $f:\mathbb N^2\to\mathbb N$ which is known to satisfy \[f(x+1,y)>f(x,y)\quad\text{and}\quad f(x,y+1)>f(x,y)\] for all $(x,y)\in\mathbb N^2$. I will tell you the value of $f(x,y)$ for \$1. What's the minimum cost, in dollars, that it takes to compute the $19$th smallest element of $\{f(x,y)\mid(x,y)\in\mathbb N^2\}$? Here, $\mathbb N=\{1,2,3,\dots\}$ denotes the set of positive integers.

find all $f : \mathbb{C} \to \mathbb{C}$ st: $$f(f(x)+yf(y))=x+|y|^2$$ for all $x,y \in \mathbb{C}$

1.Let $ABC$ be a triangle, $D$ the foot of the altitude from $A$ and $M$ the midpoint of the side $BC$. Let $S$ be a point on the closed segment $DM$ and let $P, Q$ the projections of $S$ on the lines $AB$ and $AC$ respectively. Prove that the length of the segment $PQ$ does not exceed one quarter the perimeter of the triangle $ABC$.

A rational number written in base eight is $\underline{a} \underline{b} . \underline{c} \underline{d}$, where all digits are nonzero. The same number in base twelve is $\underline{b} \underline{b} . \underline{b} \underline{a}$. Find the base-ten number $\underline{a} \underline{b} \underline{c}$.

In an acute traingle $ABC$ with $AB< BC$ let $BH_b$ be its altitude, and let $O$ be the circumcenter. A line through $H_b$ parallel to $CO$ meets $BO$ at $X$. Prove that $X$ and the midpoints of $AB$ and $AC$ are collinear.

A group of $67$ students pass their examination consisting of $6$ questions, labeled with the numbers $1$ to $6$. A correct answer to question $n$ is quoted $n$ points and for an incorrect answer to the same question a student loses $n$ point. a) Find the least possible positive difference between any $2$ final scores b) Show that at least $4$ participants have the same final score c) Show that at least $2$ students gave identical answer to all six questions.

Find all prime numbers whose sixth power does not give remainder $1$ when dividing by $504$

In a convex quadrilateral $ABCD$ with $\angle ABC = \angle ADC = 135^\circ$, points $M$ and $N$ are taken on the rays $AB$ and $AD$ respectively such that $\angle MCD = \angle NCB = 90^\circ$. The circumcircles of triangles $AMN$ and $ABD$ intersect at $A$ and $K$. Prove that $AK \perp KC.$

In a triangle $ABC$, let $H$ be the point of intersection of altitudes, $I$ the center of incircle, $O$ the center of circumcircle, $K$ the point where the incircle touches $BC$. Given that $IO$ is parallel to $BC$, prove that $AO$ is parallel to $HK$.

Let $p$ and $q$ be prime numbers such that $p^2+pq+q^2$ is perfect square. Prove that $p^2-pq+q^2$ is prime

Yamin and Tamim are playing a game with subsets of $\{1, 2, \ldots, n\}$ where $n \geq 3$. [list] [*] Tamim starts the game with the empty set. [*] On Yamin's turn, he adds a proper non-empty subset of $\{1, 2, \ldots, n\}$ to his collection $F$ of blocked sets. [*] On Tamim's turn, he adds or removes a positive integer less than or equal to $n$ to or from their set but Tamim can never add or remove an element so that his set becomes one of the blocked sets in $F$. [/list] Tamim wins if he can make his set to be $\{1, 2, \ldots, n\}$. Yamin wins if he can stop Tamim from doing so. Yamin goes first and they alternate making their moves. Does Tamim have a winning strategy? [i]Proposed by Ahmed Ittihad Hasib[/i]