For positive integers $n, k$ with $1 \le k \le n$, define $$L(n, k) = Lcm \,(n, n - 1, n -2, ..., n - k + 1)$$ Let $f(n)$ be the largest value of $k$ such that $L(n, 1) < L(n, 2) < ... < L(n, k)$. Prove that $f(n) < 3\sqrt{n}$ and $f(n) > k$ if $n > k! + k$.

Prove that $n$ ($\ge 4$) points of the plane are vertices of a convex $n$-gon if and only if any $4$ of them are vertices of a convex quadrilateral.

[u]Round 1 [/u] [b]p1.[/b] In the convex quadrilateral $ABCD$ with diagonals $AC$ and $BD$, you know that angle $BAC$ is congruent to angle $CBD$, and that angle $ACD$ is congruent to angle $ADB$. Show that angle $ABC$ is congruent to angle $ADC$. [img]https://cdn.artofproblemsolving.com/attachments/5/d/41cd120813d5541dc73c5d4a6c86cc82747fcc.png[/img] [b]p2.[/b] In how many different ways can you place $12$ chips in the squares of a $4 \times 4$ chessboard so that (a) there is at most one chip in each square, and (b) every row and every column contains exactly three chips. [b]p3.[/b] Students from Hufflepuff and Ravenclaw were split into pairs consisting of one student from each house. The pairs of students were sent to Honeydukes to get candy for Father's Day. For each pair of students, either the Hufflepuff student brought back twice as many pieces of candy as the Ravenclaw student or the Ravenclaw student brought back twice as many pieces of candy as the Hufflepuff student. When they returned, Professor Trelawney determined that the students had brought back a total of $1000$ pieces of candy. Could she have possibly been right? Why or why not? Assume that candy only comes in whole pieces (cannot be divided into parts). [b]p4.[/b] While you are on a hike across Deception Pass, you encounter an evil troll, who will not let you across the bridge until you solve the following puzzle. There are six stones, two colored red, two colored yellow, and two colored green. Aside from their colors, all six stones look and feel exactly the same. Unfortunately, in each colored pair, one stone is slightly heavier than the other. Each of the lighter stones has the same weight, and each of the heavier stones has the same weight. Using a balance scale to make TWO measurements, decide which stone of each color is the lighter one. [b]p5.[/b] Alex, Bob and Chad are playing a table tennis tournament. During each game, two boys are playing each other and one is resting. In the next game the boy who lost a game goes to rest, and the boy who was resting plays the winner. By the end of tournament, Alex played a total of $10$ games, Bob played $15$ games, and Chad played $17$ games. Who lost the second game? [u]Round 2 [/u] [b]p6.[/b] Consider a set of finitely many points on the plane such that if we choose any three points $A,B,C$ from the set, then the area of the triangle $ABC$ is less than $1$. Show that all of these points can be covered by a triangle whose area is less than $4$. [b]p7.[/b] A palindrome is a number that is the same when read forward and backward. For example, $1771$ and $23903030932$ are palindromes. Can the number obtained by writing the numbers from $1$ to $n$ in order be a palindrome for some $n > 1$ ? (For example, if $n = 11$, the number obtained is $1234567891011$, which is not a palindrome.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given an acute triangle $ABC, H$ is the foot of the altitude drawn from the point $A$ on the line $BC, P$ and $K \ne H$ are arbitrary points on the segments $AH$ and$ BC$ respectively. Segments $AC$ and $BP$ intersect at point $B_1$, lines $AB$ and $CP$ at point $C_1$. Let $X$ and $Y$ be the projections of point $H$ on the lines $KB_1$ and $KC_1$, respectively. Prove that points $A, P, X$ and $Y$ lie on one circle.

Given $a_1\ge 1$ and $a_{k+1}\ge a_k+1$ for all $k\ge 1,2,\dots,n$, show that $a_1^3+a_2^3+\dots+a_n^3\ge (a_1+a_2+\dots+a_n)^2$

Find all positive integers $k$ for which the equation: $$ \text{lcm}(m,n)-\text{gcd}(m,n)=k(m-n)$$ has no solution in integers positive $(m,n)$ with $m\neq n$.

A magic $3 \times 5$ board can toggle its cells between black and white. Define a \textit{pattern} to be an assignment of black or white to each of the board's $15$ cells (so there are $2^{15}$ patterns total). Every day after Day 1, at the beginning of the day, the board gets bored with its black-white pattern and makes a new one. However, the board always wants to be unique and will die if any two of its patterns are less than $3$ cells different from each other. Furthermore, the board dies if it becomes all white. If the board begins with all cells black on Day $1$, compute the maximum number of days it can stay alive.

Let $m,n\geq 2$. One needs to cover the table $m \times n$ using only the following tiles: Tile 1 - A square $2 \times 2$. Tile 2 - A L-shaped tile with five cells, in other words, the square $3 \times 3$ [b]without[/b] the upper right square $2 \times 2$. Each tile 1 covers exactly $4$ cells and each tile 2 covers exactly $5$ cells. Rotation is allowed. Determine all pairs $(m,n)$, such that the covering is possible.

An integer $a$ is called friendly if the equation $(m^2+n)(n^2+m)=a(m-n)^3$ has a solution over the positive integers. [b]a)[/b] Prove that there are at least $500$ friendly integers in the set $\{ 1,2,\ldots ,2012\}$. [b]b)[/b] Decide whether $a=2$ is friendly.

A natural number $n$ is said to have the property $P$, if whenever $n$ divides $a^{n}-1$ for some integer $a$, $n^2$ also necessarily divides $a^{n}-1$. [list=a] [*] Show that every prime number $n$ has the property $P$. [*] Show that there are infinitely many composite numbers $n$ that possess the property $P$. [/list]

For all pairwise distinct positive real numbers $a, b, c$ such that $abc = 1$, prove that $$\frac{\frac{1}{a}+\frac{1}{b}+\frac{1}{c}+1}{(a+b+c+1)^2}+\frac{3}{8}\sqrt[3]{\frac{(a^2-b^2)^3+(b^2-c^2)^3+(c^2-a^2)^3}{(a-b)^3+(b-c)^3+(c-a)^3}}\geq 1.$$

Each term of the sequence $5, 12, 19, 26, \cdots$ is $7$ more than the term that precedes it. What is the first term of the sequence that is greater than $2017$? $\text{(A) }2018\qquad\text{(B) }2019\qquad\text{(C) }2020\qquad\text{(D) }2021\qquad\text{(E) }2022$

Let $a,b,c$ be positive rational numbers such that $\sqrt a+\sqrt b=c$. Show that $\sqrt a$ and $\sqrt b$ are also rational.

In triangle $ABC$ on side $AC$ are points $K$, $L$ and $M$ such that $BK$ is an angle bisector of $\angle ABL$, $BL$ is an angle bisector of $\angle KBM$ and $BM$ is an angle bisector of $\angle LBC$, respectively. Prove that $4 \cdot LM <AC$ and $3\cdot \angle BAC - \angle ACB < 180^{\circ}$

Consider the function $ f(\theta) \equal{} \int_0^1 |\sqrt {1 \minus{} x^2} \minus{} \sin \theta|dx$ in the interval of $ 0\leq \theta \leq \frac {\pi}{2}$. (1) Find the maximum and minimum values of $ f(\theta)$. (2) Evaluate $ \int_0^{\frac {\pi}{2}} f(\theta)\ d\theta$.

Inside square $ABCD$ consider a point $M$. Prove that the points of intersection of the medians of triangles $ABM, BCM, CDM$ and $DAM$ form a square. (V Prasolov)

Let $ABCD$ be a convex quadrilateral with $\angle B= \angle D$. Prove that the midpoint of $BD$ lies on the common internal tangent to the incircles of triangles $ABC$ and $ACD$.

Let $P(x)$ be a quadratic polynomial satisfying the following conditions: [list] [*] $P(x)$ has leading coefficient $1$. [*] $P(x)$ has nonnegative integer roots that are at most $2022$. [*] the set of the roots of $P(x)$ is a subset of the set of the roots of $P(P(x))$. [/list] Let $S$ be the set of all such possible $P(x)$, and let $Q(x)$ be the polynomial obtained upon summing all the elements of $S$. Find the sum of the roots of $Q(x)$.

Define $$P(x) =(x-1^2)(x-2^2)\cdots(x-100^2).$$ How many integers $n$ are there such that $P(n)\leq 0$? $\textbf{(A) } 4900 \qquad \textbf{(B) } 4950\qquad \textbf{(C) } 5000\qquad \textbf{(D) } 5050 \qquad \textbf{(E) } 5100$

Find the smallest odd natural number $N$ such that $N^2$ is the sum of an odd number (greater than $1$) of squares of adjacent positive integers.

Two circles with radius $2$, $\omega_1$ and $\omega_2$, are centered at $O_1$ and $O_2$ respectively. The circles $\omega_1$ and $\omega_2$ are externally tangent to each other and internally tangent to a larger circle $\omega$ centered at $O$ at points $A$ and $B$, respectively. Let $M$ be the midpoint of minor arc $AB$. Let $P$ be the intersection of $\omega_1$ and $O_1M$, and let $Q$ be the intersection of $\omega_2$ and $O_2M$. Given that there is a point $R$ on $\omega$ such that $\triangle PQR$ is equilateral, the radius of $\omega$ can be written as $\frac{a+\sqrt{b}}{c}$ where $a$, $b$, and $c$ are positive integers and $a$ and $c$ are relatively prime. Find $a+b+c$.

We say that a set $S$ of integers is [i]rootiful[/i] if, for any positive integer $n$ and any $a_0, a_1, \cdots, a_n \in S$, all integer roots of the polynomial $a_0+a_1x+\cdots+a_nx^n$ are also in $S$. Find all rootiful sets of integers that contain all numbers of the form $2^a - 2^b$ for positive integers $a$ and $b$.

For which $k$ does the system $x^2 - y^2 = 0, (x-k)^2 + y^2 = 1$ have exactly: (i) two, (ii) three real solutions?

Determine the largest positive integer $k$ for which the following statement is true: given $k$ distinct subsets of the set $\{1, 2, 3, \dots , 2023\}$, each with $1011$ elements, it is possible partition the subsets into two collections so that any two subsets in one same collection have some element in common.

How many numbers among $1,2,\ldots,2012$ have a positive divisor that is a cube other than $1$? $\text{(A) }346\qquad\text{(B) }336\qquad\text{(C) }347\qquad\text{(D) }251\qquad\text{(E) }393$