Mark $4 \cdot k$ points in a circle and number them arbitrarily with numbers from $1$ to $4 \cdot k$. The chords cannot share common endpoints, also, the endpoints of these chords should be among the $4 \cdot k$ points. [b]i.[/b] Prove that $2 \cdot k$ pairwisely non-intersecting chords can be drawn for each of whom its endpoints differ in at most $3 \cdot k - 1$. [b]ii.[/b] Prove that the $3 \cdot k - 1$ cannot be improved.

Given is an acute triangle $ABC$ $\left(AB<AC<BC\right)$,inscribed in circle $c(O,R)$.The perpendicular bisector of the angle bisector $AD$ $\left(D\in BC\right)$ intersects $c$ at $K,L$ ($K$ lies on the small arc $\overarc{AB}$).The circle $c_1(K,KA)$ intersects $c$ at $T$ and the circle $c_2(L,LA)$ intersects $c$ at $S$.Prove that $\angle{BAT}=\angle{CAS}$. [hide=Diagram][asy]import graph; size(10cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -6.94236331697463, xmax = 15.849400903703716, ymin = -5.002235438802758, ymax = 7.893104843949444; /* image dimensions */ pen aqaqaq = rgb(0.6274509803921569,0.6274509803921569,0.6274509803921569); pen uququq = rgb(0.25098039215686274,0.25098039215686274,0.25098039215686274); pen qqqqtt = rgb(0.,0.,0.2); draw((1.8318261909633622,3.572783369254345)--(0.,0.)--(6.,0.)--cycle, aqaqaq); draw(arc((1.8318261909633622,3.572783369254345),0.6426249310341638,-117.14497824050169,-101.88970202103212)--(1.8318261909633622,3.572783369254345)--cycle, qqqqtt); draw(arc((1.8318261909633622,3.572783369254345),0.6426249310341638,-55.85706977865775,-40.60179355918817)--(1.8318261909633622,3.572783369254345)--cycle, qqqqtt); /* draw figures */ draw((1.8318261909633622,3.572783369254345)--(0.,0.), uququq); draw((0.,0.)--(6.,0.), uququq); draw((6.,0.)--(1.8318261909633622,3.572783369254345), uququq); draw(circle((3.,0.7178452373968209), 3.0846882800136055)); draw((2.5345020274407277,0.)--(1.8318261909633622,3.572783369254345)); draw(circle((-0.01850947366601585,1.3533783539547308), 2.889550258039566)); draw(circle((5.553011501106743,2.4491551634556963), 3.887127532933951)); draw((-0.01850947366601585,1.3533783539547308)--(5.553011501106743,2.4491551634556963), linetype("2 2")); draw((1.8318261909633622,3.572783369254345)--(0.7798408954511686,-1.423695174396108)); draw((1.8318261909633622,3.572783369254345)--(5.22015910454883,-1.4236951743961088)); /* dots and labels */ dot((1.8318261909633622,3.572783369254345),linewidth(3.pt) + dotstyle); label("$A$", (1.5831274347452782,3.951671933606579), NE * labelscalefactor); dot((0.,0.),linewidth(3.pt) + dotstyle); label("$B$", (-0.6,0.05), NE * labelscalefactor); dot((6.,0.),linewidth(3.pt) + dotstyle); label("$C$", (6.188606107156787,0.07450151636712989), NE * labelscalefactor); dot((2.5345020274407277,0.),linewidth(3.pt) + dotstyle); label("$D$", (2.3,-0.7), NE * labelscalefactor); dot((-0.01850947366601585,1.3533783539547308),linewidth(3.pt) + dotstyle); label("$K$", (-0.3447473583572136,1.6382221818835927), NE * labelscalefactor); dot((5.553011501106743,2.4491551634556963),linewidth(3.pt) + dotstyle); label("$L$", (5.631664500260511,2.580738747400365), NE * labelscalefactor); dot((0.7798408954511686,-1.423695174396108),linewidth(3.pt) + dotstyle); label("$T$", (0.5977692071595602,-1.960477431907719), NE * labelscalefactor); dot((5.22015910454883,-1.4236951743961088),linewidth(3.pt) + dotstyle); label("$S$", (5.160406217502124,-1.8747941077698307), NE * labelscalefactor); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */[/asy][/hide]

Let $ABC$ be a triangle with $\angle BAC=60$. Let $B_1$ and $C_1$ be the feet of the bisectors from $B$ and $C$. Let $A_1$ be the symmetrical of $A$ according to line $B_1C_1$. Prove that $A_1, B, C$ are colinear.

Which of these numbers is the largest? $\textbf{(A)} \sqrt{\sqrt[3]{5\cdot 6}}\qquad \textbf{(B)} \sqrt{6\sqrt[3]{5}}\qquad \textbf{(C)} \sqrt{5\sqrt[3]{6}}\qquad \textbf{(D)} \sqrt[3]{5\sqrt{6}}\qquad \textbf{(E)} \sqrt[3]{6\sqrt{5}}$

Six teams participate in a hockey tournament. Each team plays exactly once against each other team. A team is awarded $3$ points for each game they win, $1$ point for each draw, and $0$ points for each game they lose. After the tournament, a ranking is made. There are no ties in the list. Moreover, it turns out that each team (except the very last team) has exactly $2$ points more than the team ranking one place lower. Prove that the team that finished fourth won exactly two games.

A deck of forty cards consists of four 1's, four 2's,..., and four 10's. A matching pair (two cards with the same number) is removed from the deck. Given that these cards are not returned to the deck, let $m/n$ be the probability that two randomly selected cards also form a pair, where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

Show that $\displaystyle{\sum_{i=1}^{n}(-1)^{n+i}\binom{n}{i}\binom{in}{n} = n^{n}}$.

Let $T$ be the intersection of the common internal tangents of circles $C_1$, $C_2$ with centers $O_1$, $O_2$ respectively. Let $P$ be one of the points of tangency on $C_1$ and let line $\ell$ bisect angle $O_1TP$ . Label the intersection of $\ell$ with $C_1$ that is farthest from $T$, $R$, and label the intersection of $\ell$ with $C_2$ that is closest to $T$, $S$. If $C_1$ has radius $4$, $C_2$ has radius $6$, and $O_1O_2= 20$ , calculate $(TR)(TS) $. [img]https://cdn.artofproblemsolving.com/attachments/3/c/284f17bb0dd73eab93132e41f27ecc121f496d.png[/img]

Show that the inequality \[\sum_{i=1}^n \sum_{j=1}^n \sqrt{|x_i-x_j|}\leqslant \sum_{i=1}^n \sum_{j=1}^n \sqrt{|x_i+x_j|}\]holds for all real numbers $x_1,\ldots x_n.$

Consider all nine-digit numbers, consisting of non-repeating digits from $1$ to $9$ in an arbitrary order. A pair of such numbers is called “conditional” if their sum is equal to $987654321$. (a) Prove that there exist at least two conditional pairs (noting that ($a,b$) and ($b,a$) is considered to be one pair). (b) Prove that the number of conditional pairs is odd. (G Galperin, Moscow)

There are $2n + 1$ tickets, each with a unique positive integer as the ticket number. It is known that the sum of all ticket numbers is more than $2330$, but the sum of any $n$ ticket numbers is at most $1165$. What is the maximum value of $n$?

We are given a convex quadrilateral $ABCD$ whose angles are not right. Assume there are points $P, Q, R, S$ on its sides $AB, BC, CD, DA$, respectively, such that $PS \parallel BD$, $SQ \perp BC$, $PR \perp CD$. Furthermore, assume that the lines $PR, SQ$, and $AC$ are concurrent. Prove thatthe points $P, Q, R, S$ are concyclic.

Let $\vartriangle A_0B_0C_0$ be an equilateral triangle with area $1$, and let $A_1$, $B_1$, $C_1$ be the midpoints of $\overline{A_0B_0}$, $\overline{B_0C_0}$, and $\overline{C_0A_0}$, respectively. Furthermore, set $A_2$, $B_2$, $C_2$ as the midpoints of segments $\overline{A_0A_1}$, $\overline{B_0B_1}$, and $\overline{C_0C_1}$ respectively. For $n \ge 1$, $A_{2n+1}$ is recursively defined as the midpoint of $A_{2n}A_{2n-1}$, and $A_{2n+2}$ is recursively defined as the midpoint of $\overline{A_{2n+1}A_{2n-1}}$. Recursively define $B_n$ and $C_n$ the same way. Compute the value of $\lim_{n \to \infty }[A_nB_nC_n]$, where $[A_nB_nC_n]$ denotes the area of triangle $\vartriangle A_nB_nC_n$.

Estimate the value of $$\sum^{2023}_{n=1} \left(1+ \frac{1}{n} \right)^n$$ to $3$ decimal places.

Two thousand points are given on a circle. Label one of the points 1. From this point, count 2 points in the clockwise direction and label this point 2. From the point labeled 2, count 3 points in the clockwise direction and label this point 3. (See figure.) Continue this process until the labels $1, 2, 3, \dots, 1993$ are all used. Some of the points on the circle will have more than one label and some points will not have a label. What is the smallest integer that labels the same point as 1993? [asy] int x=101, y=3*floor(x/4); draw(Arc(origin, 1, 360*(y-3)/x, 360*(y+4)/x)); int i; for(i=y-2; i<y+4; i=i+1) { dot(dir(360*i/x)); } label("3", dir(360*(y-2)/x), dir(360*(y-2)/x)); label("2", dir(360*(y+1)/x), dir(360*(y+1)/x)); label("1", dir(360*(y+3)/x), dir(360*(y+3)/x));[/asy]

Let $a, b, c$ be real numbers satisfying the condition $18ab + 9ca + 29bc = 1$. Find the minimum value of the expression $T = 42a^2 + 34b^2 + 43c^2$.

A [i]power[/i] is a positive integer of the form $a^k$, where $a$ and $k$ are positive integers with $k\geq 2$. Let $S$ be the set of positive integers which cannot be expressed as sum of two powers (for example, $4,\ 7,\ 15$ and $27$ are elements of $S$). Determine whether the set $S$ has a finite or infinite number of elements.

PUMaCDonalds, a newly-opened fast food restaurant, has 5 menu items. If the first 4 customers each choose one menu item at random, the probability that the 4th customer orders a previously unordered item is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

A village is constructed in the form of a square, consisting of $9$ blocks , each of side length $\ell$, in a $3 \times 3$ formation . Each block is bounded by a bitumen road . If we commence at a corner of the village, what is the smallest distance we must travel along bitumen roads , if we are to pass along each section of bitumen road at least once and finish at the same corner? (Muscovite folklore)

In the $9$-gon $ABCDEFGHI$, all sides have equal lengths and all angles are equal. Prove that $|AB| + |AC| = |AE|$. [img]https://cdn.artofproblemsolving.com/attachments/6/2/8c82e8a87bf8a557baaf6ac72b3d18d2ba3965.png[/img]

One sunny day, Ling decided to take a hike in the mountains. She left her house at $8 \, \textsc{am}$, drove at a constant speed of $45$ miles per hour, and arrived at the hiking trail at $10 \, \textsc{am}$. After hiking for $3$ hours, Ling drove home at a constant speed of $60$ miles per hour. Which of the following graphs best illustrates the distance between Ling’s car and her house over the course of her trip? [asy] unitsize(12); usepackage("mathptmx"); defaultpen(fontsize(8)+linewidth(.7)); int mod12(int i) {if (i<13) {return i;} else {return i-12;}} void drawgraph(pair sh,string lab) { for (int i=0;i<11;++i) { for (int j=0;j<6;++j) { draw(shift(sh+(i,j))*unitsquare,mediumgray); } } draw(shift(sh)*((-1,0)--(11,0)),EndArrow(angle=20,size=8)); draw(shift(sh)*((0,-1)--(0,6)),EndArrow(angle=20,size=8)); for (int i=1;i<10;++i) { draw(shift(sh)*((i,-.2)--(i,.2))); } label("8\tiny{\textsc{am}}",sh+(1,-.2),S); for (int i=2;i<9;++i) { label(string(mod12(i+7)),sh+(i,-.2),S); } label("4\tiny{\textsc{pm}}",sh+(9,-.2),S); for (int i=1;i<6;++i) { label(string(30*i),sh+(0,i),2*W); } draw(rotate(90)*"Distance (miles)",sh+(-2.1,3),fontsize(10)); label("$\textbf{("+lab+")}$",sh+(-2.1,6.8),fontsize(10)); } drawgraph((0,0),"A"); drawgraph((15,0),"B"); drawgraph((0,-10),"C"); drawgraph((15,-10),"D"); drawgraph((0,-20),"E"); dotfactor=6; draw((1,0)--(3,3)--(6,3)--(8,0),linewidth(.9)); dot((1,0)^^(3,3)^^(6,3)^^(8,0)); pair sh = (15,0); draw(shift(sh)*((1,0)--(3,1.5)--(6,1.5)--(8,0)),linewidth(.9)); dot(sh+(1,0)^^sh+(3,1.5)^^sh+(6,1.5)^^sh+(8,0)); pair sh = (0,-10); draw(shift(sh)*((1,0)--(3,1.5)--(6,1.5)--(7.5,0)),linewidth(.9)); dot(sh+(1,0)^^sh+(3,1.5)^^sh+(6,1.5)^^sh+(7.5,0)); pair sh = (15,-10); draw(shift(sh)*((1,0)--(3,4)--(6,4)--(9.3,0)),linewidth(.9)); dot(sh+(1,0)^^sh+(3,4)^^sh+(6,4)^^sh+(9.3,0)); pair sh = (0,-20); draw(shift(sh)*((1,0)--(3,3)--(6,3)--(7.5,0)),linewidth(.9)); dot(sh+(1,0)^^sh+(3,3)^^sh+(6,3)^^sh+(7.5,0)); [/asy]

Determine all functions $f: \mathbb{Q} \to \mathbb{Q}$ such that $$f(2xy + \frac{1}{2}) + f(x-y) = 4f(x)f(y) + \frac{1}{2}$$ for all $x,y \in \mathbb{Q}$.

Let $ABC$ be the triangle with $\angle ABC = 76^o$ and $\angle ACB = 72^o$. Points $P$ and $Q$ lie on the sides $(AB)$ and $(AC)$, respectively, such that $\angle ABQ = 22^o$ and $\angle ACP = 44^o$. Find the measure of angle $\angle APQ$.

Let $S=\{1,2,...,100\}$ . Find number of functions $f: S\to S$ satisfying the following conditions a)$f(1)=1$ b)$f$ is bijective c)$f(n)=f(g(n))f(h(n))\forall n\in S$, where $g(n),h(n)$ are positive integer numbers such that $g(n)\leq h(n),n=g(n)h(n)$ that minimize $h(n)-g(n)$.

Show that for every positive integer $n$ the number $7^n-1$ is not divisible by $6^n-1$.