Compute \[\cot\left(\sum_{n=1}^{23}\cot^{-1}\left(1+\sum_{k=1}^n2k\right)\right).\]

assume that X is a set of n number.and $0\leq k\leq n$.the maximum number of permutation which acting on $X$ st every two of them have at least k component in common,is $a_{n,k}$.and the maximum nuber of permutation st every two of them have at most k component in common,is $b_{n,k}$. a)proeve that :$a_{n,k}\cdot b_{n,k-1}\leq n!$ b)assume that p is prime number,determine the exact value of $a_{p,2}$.

Non-zero real numbers $a, b$ and $c$ are given such that $ab+bc+ac=0$. Prove that numbers $a+b+c$ and $\dfrac{1}{a+b}+\dfrac{1}{b+c}+\dfrac{1}{a+c}$ are either both positive or both negative. [i]Proposed by Mykhailo Shtandenko[/i]

Compute the number of positive integers $n$ satisfying the inequalities \[ 2^{n-1} < 5^{n-3} < 3^n. \][i]Proposed by Isabella Grabski[/i]

Let $k_1$ and $k_2$ be two circles with centers $O_1$ and $O_2$ and equal radius $r$ such that $O_1O_2 = r$. Let $A$ and $B$ be two points lying on the circle $k_1$ and being symmetric to each other with respect to the line $O_1O_2$. Let $P$ be an arbitrary point on $k_2$. Prove that \[PA^2 + PB^2 \geq 2r^2.\]

Let $M_n$ be the set of permutations $\sigma\in S_n$ for which there exists $\tau\in S_n$ such that the numbers \[\sigma (1)+\tau(1),\, \sigma(2)+\tau(2),\ldots,\sigma(n)+\tau(n),\] are consecutive. Show that \((M_n\neq \emptyset\Leftrightarrow n\text{ is odd})\) and in this case for each $\sigma_1,\sigma_2\in M_n$ the following equality holds: \[\sum_{k=1}^n k\sigma_1(k)=\sum_{k=1}^n k\sigma_2(k).\] [i]Dan Schwarz[/i]

Let $ABCD$ be a Rhombus and let $w$ be it's incircle. Let $M$ be the midpoint of $AB$ the point $K$ is on $w$ and inside $ABCD$ such that $MK$ is tangent to $w$. Prove that $CDKM$ is cyclic.

Determine whether exists positive integer $n$ such that the number $A=8^n+47$ is prime.

Does there exist a function $f : \mathbb{N} \rightarrow \mathbb{N}$ such that for every $n \ge 2$, \[f (f (n - 1)) = f (n + 1) - f (n)?\]

There are $6$ pieces of cheese of different weights. For any two pieces we can identify the heavier piece. Given that it is possible to divide them into two groups of equal weights with three pieces in each. Give the explicit way to find these groups by performing two weightings on a regular balance.

Determine all sequences $(x_1,x_2,\ldots,x_{2011})$ of positive integers, such that for every positive integer $n$ there exists an integer $a$ with \[\sum^{2011}_{j=1} j x^n_j = a^{n+1} + 1\] [i]Proposed by Warut Suksompong, Thailand[/i]

In space, a point $O$ and a finite set of vectors $ \overrightarrow{v_1},\ldots,\overrightarrow{v_n} $ are given . We consider the set of points $ P $ for which the vector $ \overrightarrow{OP} $can be represented as a sum $ a_1 \overrightarrow{v_1} + \ldots + a_n\overrightarrow{v_n} $with coefficients satisfying the inequalities $ 0 \leq a_i \leq 1 $ $( i = 1, 2, \ldots, n $). Decide whether this set can be a tetrahedron.

Points $P$ and $Q$ are taken sides $AB$ and $AC$ of a triangle $ABC$ respectively such that $\hat{APC}=\hat{AQB}=45^{0}$. The line through $P$ perpendicular to $AB$ intersects $BQ$ at $S$, and the line through $Q$ perpendicular to $AC$ intersects $CP$ at $R$. Let $D$ be the foot of the altitude of triangle $ABC$ from $A$. Prove that $SR\parallel BC$ and $PS,AD,QR$ are concurrent.

An evil witch is making a potion to poison the people of PUMAClandia. In order for the potion to work, the number of poison dart frogs cannot exceed $5$, the number of wolves’ teeth must be an even number, and the number of dragon scales has to be a multiple of $6$. She can also put in any number of tiger nails. Given that the stew has exactly $2021$ ingredients, in how many ways can she add ingredients for her potion to work?

Given are the sequences \[ (..., a_{-2}, a_{-1}, a_0, a_1, a_2, ...); (..., b_{-2}, b_{-1}, b_0, b_1, b_2, ...); (..., c_{-2}, c_{-1}, c_0, c_1, c_2, ...)\] of positive real numbers. For each integer $n$ the following inequalities hold: \[a_n \geq \frac{1}{2} (b_{n+1} + c_{n-1})\] \[b_n \geq \frac{1}{2} (c_{n+1} + a_{n-1})\] \[c_n \geq \frac{1}{2} (a_{n+1} + b_{n-1})\] Determine $a_{2005}$, $b_{2005}$, $c_{2005}$, if $a_0 = 26, b_0 = 6, c_0 = 2004$.

An international society has its members from six different countries. The list of members contain $1978$ names, numbered $1, 2, \dots, 1978$. Prove that there is at least one member whose number is the sum of the numbers of two members from his own country, or twice as large as the number of one member from his own country.

[u]Round 5[/u] [b]5.1.[/b] A triangle has lengths such that one side is $12$ less than the sum of the other two sides, the semi-perimeter of the triangle is $21$, and the largest and smallest sides have a difference of $2$. Find the area of this triangle. [b]5.2.[/b] A rhombus has side length $85$ and diagonals of integer lengths. What is the sum of all possible areas of the rhombus? [b]5.3.[/b] A drink from YAKSHAY’S SHAKE SHOP is served in a container that consists of a cup, shaped like an upside-down truncated cone, and a semi-spherical lid. The ratio of the radius of the bottom of the cup to the radius of the lid is $\frac23$ , the volume of the combined cup and lid is $296\pi$, and the height of the cup is half of the height of the entire drink container. What is the volume of the liquid in the cup if it is filled up to half of the height of the entire drink container? [u]Round 6[/u] [i]Each answer in the next set of three problems is required to solve a different problem within the same set. There is one correct solution to all three problems; however, you will receive points for any correct answer regardless whether other answers are correct.[/i] [b]6.1.[/b] Let the answer to problem $2$ be $b$. There are b people in a room, each of which is either a truth-teller or a liar. Person $1$ claims “Person $2$ is a liar,” Person $2$ claims “Person $3$ is a liar,” and so on until Person $b$ claims “Person $1$ is a liar.” How many people are truth-tellers? [b]6.2.[/b] Let the answer to problem $3$ be $c$. What is twice the area of a triangle with coordinates $(0, 0)$, $(c, 3)$ and $(7, c)$ ? [b]6.3.[/b] Let the answer to problem $ 1$ be $a$. Compute the smaller zero to the polynomial $x^2 - ax + 189$ which has $2$ integer roots. [u]Round 7[/u] [b]7.1. [/b]Sir Isaac Neeton is sitting under a kiwi tree when a kiwi falls on his head. He then discovers Neeton’s First Law of Kiwi Motion, which states: [i]Every minute, either $\left\lfloor \frac{1000}{d} \right\rfloor$ or $\left\lceil \frac{1000}{d} \right\rceil$ kiwis fall on Neeton’s head, where d is Neeton’s distance from the tree in centimeters.[/i] Over the next minute, $n$ kiwis fall on Neeton’s head. Let $S$ be the set of all possible values of Neeton’s distance from the tree. Let m and M be numbers such that $m < x < M$ for all elements $x$ in $S$. If the least possible value of $M - m$ is $\frac{2000}{16899}$ centimeters, what is the value of $n$? Note that $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$, and $\lceil x \rceil$ is the least integer greater than or equal to $x$. [b]7.2.[/b] Nithin is playing chess. If one queen is randomly placed on an $ 8 \times 8$ chessboard, what is the expected number of squares that will be attacked including the square that the queen is placed on? (A square is under attack if the queen can legally move there in one move, and a queen can legally move any number of squares diagonally, horizontally or vertically.) [b]7.3.[/b] Nithin is writing binary strings, where each character is either a $0$ or a $1$. How many binary strings of length $12$ can he write down such that $0000$ and $1111$ do not appear? [u]Round 8[/u] [b]8.[/b] What is the period of the fraction $1/2018$? (The period of a fraction is the length of the repeated portion of its decimal representation.) Your answer will be scored according to the following formula, where $X$ is the correct answer and $I$ is your input. $$max \left\{ 0, \left\lceil min \left\{13 - \frac{|I-X|}{0.1 |I|}, 13 - \frac{|I-X|}{0.1 |I-2X|} \right\} \right\rceil \right\}$$ PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2765571p24215461]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Through the points with integer coordinates in the right-angled coordinate system $Oxyz$ are constructed planes, parallel to the coordinate planes and in this way the space is divided to unit cubes. Find all triples ($a, b, c$) consisting of natural numbers ($a \le b \le c$) for which the cubes formed can be coloured in $abc$ colors in such a way that every palellepiped with dimensions $a \times  b \times c$, having vertices with integer coordinates and sides parallel to the coordinate axis doesn't contain unit cubes in the same color.

Each face of a $7 \times 7 \times 7$ cube is divided into unit squares. What is the maximum number of squares that can be chosen so that no two chosen squares have a common point? [i]A. Chukhnov[/i]

If two altitudes of a triangle have length $12$ and $4$, what integral lengths can the third altitude attain?

Determine the highest possible value of: $$S = a_1a_2a_3 + a_4a_5a_6 +... + a_{2017}a_{2018}a_{2019} + a_{2020}$$ where $(a_1, a_2, a_3,..., a_{2020})$ is a permutation of $(1,2,3,..., 2020)$. Clarification: In $S$, each term, except the last one, is the multiplication of three numbers.

Let be three real numbers $ a,b,c\in [0,1] $ satisfying the condition $ ab+bc+ca=1. $ Prove that $$ a^2+b^2+c^2\le 2, $$ and determine the cases in which equality is attained.

Find all positive integers $m$ and $n$ satisfying $2^n+n=m!$.

Let $ABC$ be a triangle with $AB \neq AC$. The incircle of $ABC$ touches the sides $BC$, $CA$, $AB$ at $X$, $Y$, $Z$ respectively. The line through $Z$ and $Y$ intersects $BC$ extended in $X^\prime$. The lines through $B$ that are parallel to $AX$ and $AC$ intersect $AX^\prime$ in $K$ and $L$ respectively. Prove that $AK = KL$.

Every square of a $2020 \times 2020$ chess table is painted in red or white. For every two columns and two rows, at least two of the intersection squares satisfies that they are in the same column or row and they are painted in the same color. Find the least value of number of columns and rows that are completely painted in one color.