There are $ n$ football teams in a round-robin competition where every 2 teams meet once. The winner of each match receives 3 points while the loser receives 0 points. In the case of a draw, both teams receive 1 point each. Let $ k$ be as follows: $ 2 \leq k \leq n \minus{} 1$. At least how many points must a certain team get in the competition so as to ensure that there are at most $ k \minus{} 1$ teams whose scores are not less than that particular team's score?

Three distinct positive integers are chosen at random from $\{1,2,3...,12\}$. The probability that no two elements of the set have an absolute difference less than or equal to $2$ can be written as $\frac{a}{b}$ where $a$ and $b$ are relatively prime positive integers. Find $a +b$.

For any positive integer $n$, $S_{n}$ be the set of all permutations of $\{1,2,3,\dots,n\}$. For each permutation $\pi \in S_n$, let $f(\pi)$ be the number of ordered pairs $(j,k)$ for which $\pi(j)>\pi(k)$ and $1\leq j<k \leq n$. Further define $g(\pi)$ to be the number of positive integers $k \leq n$ such that $\pi(k)\equiv k \pm 1 \pmod{n}$. Compute \[ \sum_{\pi \in S_{999}} (-1)^{f(\pi)+g(\pi)}. \]

The figure below shows a polygon $ABCDEFGH$, consisting of rectangles and right triangles. When cut out and folded on the dotted lines, the polygon forms a triangular prism. Suppose that $AH = EF = 8$ and $GH = 14$. What is the volume of the prism? [asy] // djmathman diagram unitsize(1cm); defaultpen(linewidth(0.7)+fontsize(11)); real r = 2, s = 2.5, theta = 14; pair G = (0,0), F = (r,0), C = (r,s), B = (0,s), M = (C+F)/2, I = M + s/2 * dir(-theta); pair N = (B+G)/2, J = N + s/2 * dir(180+theta); pair E = F + r * dir(- 45 - theta/2), D = I+E-F; pair H = J + r * dir(135 + theta/2), A = B+H-J; draw(A--B--C--I--D--E--F--G--J--H--cycle^^rightanglemark(F,I,C)^^rightanglemark(G,J,B)); draw(J--B--G^^C--F--I,linetype ("4 4")); dot("$A$",A,N); dot("$B$",B,1.2*N); dot("$C$",C,N); dot("$D$",D,dir(0)); dot("$E$",E,S); dot("$F$",F,1.5*S); dot("$G$",G,S); dot("$H$",H,W); dot("$I$",I,NE); dot("$J$",J,1.5*S); [/asy] $\textbf{(A)} ~112\qquad\textbf{(B)} ~128\qquad\textbf{(C)} ~192\qquad\textbf{(D)} ~240\qquad\textbf{(E)} ~288\qquad$

Quadrilateral $ABCD$ with perpendicular diagonals is inscribed in a circle with centre $O$. The tangents to this circle at $A$ and $C$ together with line $BD$ form the triangle $\Delta$. Prove that the circumcircles of $BOD$ and $\Delta$ are tangent. [hide=Additional information for Junior League]Show that this point lies belongs to $\omega$, the circumcircle of $OAC$[/hide] [i]Proposed by A. Kuznetsov[/i]

Cards numbered 1 to 9 are arranged at random in a row. In a move, one may choose any block of consecutive cards whose numbers are in ascending or descending order, and switch the block around. For example, 9 1 $\underline{6\ 5\ 3}$ $2\ 7\ 4\ 8$ may be changed to $9 1$ $\underline{3\ 5\ 6}$ $2\ 7\ 4\ 8$. Prove that in at most 12 moves, one can arrange the 9 cards so that their numbers are in ascending or descending order.

One hundred balls labelled $1$ to $100$ are to be put into two identical boxes so that each box contains at least one ball and the greatest common divisor of the product of the labels of all the balls in one box and the product of the labels of all the balls in the other box is $1$. Determine the number of ways that this can be done.

Find all composite odd positive integers, all divisors of which can be divided into pairs so that the sum of the numbers in each pair is a power of two, and each divisor belongs to exactly one such pair. [i]Proposed by Anton Trygub[/i]

The Math Team designed a logo shaped like a multiplication symbol, shown below on a grid of 1-inch squares. What is the area of the logo in square inches? [asy] usepackage("mathptmx"); defaultpen(linewidth(0.5)); size(5cm); defaultpen(fontsize(14pt)); label("$\textbf{Math}$", (2.1,3.7)--(3.9,3.7)); label("$\textbf{Team}$", (2.1,3)--(3.9,3)); filldraw((1,2)--(2,1)--(3,2)--(4,1)--(5,2)--(4,3)--(5,4)--(4,5)--(3,4)--(2,5)--(1,4)--(2,3)--(1,2)--cycle, mediumgray*0.5 + lightgray*0.5); draw((0,0)--(6,0), gray); draw((0,1)--(6,1), gray); draw((0,2)--(6,2), gray); draw((0,3)--(6,3), gray); draw((0,4)--(6,4), gray); draw((0,5)--(6,5), gray); draw((0,6)--(6,6), gray); draw((0,0)--(0,6), gray); draw((1,0)--(1,6), gray); draw((2,0)--(2,6), gray); draw((3,0)--(3,6), gray); draw((4,0)--(4,6), gray); draw((5,0)--(5,6), gray); draw((6,0)--(6,6), gray); [/asy] $\textbf{(A) } 10 \qquad \textbf{(B) } 12 \qquad \textbf{(C) } 13 \qquad \textbf{(D) } 14 \qquad \textbf{(E) } 15$

Let $OX, OY, OZ$ be mutually orthogonal lines in space. Let $C$ be a fixed point on $OZ$ and $U,V$ variable points on $OX, OY,$ respectively. Find the locus of a point $P$ such that $PU, PV, PC$ are mutually orthogonal.

The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and \[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\] for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).

In two circles intersecting at points $A$ and $B$, parallel chords $A_1B_1$ and $A_2B_2$ are drawn. The lines $AA_1$ and $BB_2$ intersect at the point $X, AA_2$ and $BB_1$ intersect at the point $Y$. Prove that $XY // A_1B_1$.

Let $f_1,f_2,\cdots ,f_{10}$ be bijections on $\mathbb{Z}$ such that for each integer $n$, there is some composition $f_{\ell_1}\circ f_{\ell_2}\circ \cdots \circ f_{\ell_m}$ (allowing repetitions) which maps $0$ to $n$. Consider the set of $1024$ functions \[ \mathcal{F}=\{f_1^{\epsilon_1}\circ f_2^{\epsilon_2}\circ \cdots \circ f_{10}^{\epsilon_{10}}\} \] where $\epsilon _i=0$ or $1$ for $1\le i\le 10.\; (f_i^{0}$ is the identity function and $f_i^1=f_i)$. Show that if $A$ is a finite set of integers then at most $512$ of the functions in $\mathcal{F}$ map $A$ into itself.

Given a sequence of $19$ positive (not necessarily distinct) integers not greater than $93$, and a set of $93$ positive (not necessarily distinct) integers not greater than $19$. Show that we can find non-empty subsequences of the two sequences with equal sum.

Find all continuous functions $f : (0,+\infty) \to (0,+\infty)$ such that if $a, b, c$ are the lengths of the sides of any triangle then it is satisfied that $$\frac{f(a+b-c)+f(b+c-a)+f(c+a-b)}{3}=f\left(\sqrt{\frac{ab+bc+ca}{3}}\right)$$

Prove that $(2+\sqrt{3})^{2n}+(2-\sqrt{3})^{2n}$ is an even integer and that $(2+\sqrt{3})^{2n}-(2-\sqrt{3})^{2n}=w\sqrt{3}$ for some positive integer $w$, for all integers $n \geq 1$.

Let be nonnegative real numbers $ a,b,c, $ holding the inequality: $ \sum_{\text{cyc}} \frac{a}{b+c+1} \le 1. $ Prove that $ \sum_{\text{cyc}} \frac{1}{b+c+1} \ge 1. $

You have 5000 distinct finite sets. Their intersection is empty. However, the intersection of any two is nonempty. What is the smallest possible number of elements contained in their union?

Does there exist an infinite sequence of primes $p_1, p_2, p_3, \dots $ for which, \[p_{n+1}=2p_n+1\] for each $n$?

Determine the smallest value of $M$ for which for any choice of positive integer $n$ and positive real numbers $x_1<x_2<\ldots<x_n \le 2023$ the inequality $$\sum_{1\le i < j \le n , x_j-x_i \ge 1} 2^{i-j}\le M$$ holds.

Let $ABCD$ be a cyclic quadrilateral whose diagonals $AC$ and $BD$ meet at $E$. The extensions of the sides $AD$ and $BC$ beyond $A$ and $B$ meet at $F$. Let $G$ be the point such that $ECGD$ is a parallelogram, and let $H$ be the image of $E$ under reflection in $AD$. Prove that $D,H,F,G$ are concyclic.

$M$ is any point on the side $AB$ of the triangle $ABC$. $r,r_1,r_2$ are the radii of the circles inscribed in $ABC,AMC,BMC$. $q$ is the radius of the circle on the opposite side of $AB$ to $C$, touching the three sides of $AB$ and the extensions of $CA$ and $CB$. Similarly, $q_1$ and $q_2$. Prove that $r_1r_2q=rq_1q_2$.

Find all solutions of the system $\sqrt[3]{\frac{yz^4}{x^2}}+2wx=0 $ $\sqrt[3]{\frac{xz^4}{y}}+5wy=0 $ $\sqrt[3]{\frac{xy}{x}}+7wz^{-1/3}=0$ $x^{12}+\frac{125}{4}y^5+\frac{343}{2}z^4=16$ where $x, y, z \ge 0$ and $w \in R$ [hide=PS] I attached the system, in case I have any typos[/hide]

Let $x,y,z$ be positive reals such that $xyz=1$. Show that $$\frac{x^2+y^2+z}{x^2+2} + \frac{y^2+z^2+x}{y^2+2} + \frac{z^2+x^2+y}{z^2+2} \geq 3.$$ When does equality happen?

The diagonals of a convex quadrilateral divide it into four triangles. Prove that the nine point centers of these four triangles either lie on one straight line, or are the vertices of a parallelogram.