Find the largest $p_n$ such that $p_n+\sqrt{p_{n-1}+\sqrt{p_{n-2}+\sqrt{\ldots+\sqrt{p_1}}}}\leq 100$, where $p_n$ denotes the $n^{\text{th}}$ prime number.

Let $1 < x_1 < 2$ and, for $n = 1$, 2, $\dots$, define $x_{n + 1} = 1 + x_n - \frac{1}{2} x_n^2$. Prove that, for $n \ge 3$, $|x_n - \sqrt{2}| < 2^{-n}$.

Find all $6$ digit natural numbers, which consist of only the digits $1,2,$ and $3$, in which $3$ occurs exactly twice and the number is divisible by $9$.

Given six irrational numbers, will it be possible to choose three such that the sum of any two of these three is irrational?

Find the number of second-degree polynomials $ f(x)$ with integer coefficients and integer zeros for which $ f(0)\equal{}2010$.

Let $f(x)=|2\{x\} -1|$ where $\{x\}$ denotes the fractional part of $x$. The number $n$ is the smallest positive integer such that the equation $$nf(xf(x)) = x$$ has at least $2012$ real solutions $x$. What is $n$? $\textbf{Note:}$ the fractional part of $x$ is a real number $y= \{x\}$, such that $ 0 \le y < 1$ and $x-y$ is an integer. $ \textbf{(A)}\ 30\qquad\textbf{(B)}\ 31\qquad\textbf{(C)}\ 32\qquad\textbf{(D)}\ 62\qquad\textbf{(E)}\ 64 $

The [I]minkowski sausage[/I] is constructed as follows. $M_0$ is the line segment from $(0,0)$ to $(1,0).$ $M_{I+1}$ is constructed by replacing each segment in $M_i$ with eight segments, each of length $1/4_{I+1}$ (see figure below, where we have provided $M_0$ through $M_3$). Let $M_{\infty}$ denote the limiting shape of $M_0, M_1, \ldots.$ The area of the smallest convex polygon which encloses $M_{\infty}$ can be written as $\tfrac{a}{b}$ for relatively prime positive integers $a$ and $b.$ Find $a+b.$ [center] [img]https://cdn.artofproblemsolving.com/attachments/1/e/25c9980469584ce7ae4ab2ccb4ce80f3e5dfee.png[/img] [/center]

In how many ways can $6$ juniors and $6$ seniors form $3$ disjoint teams of $4$ people so that each team has $2$ juniors and $2$ seniors? $ \textbf{(A) }720 \qquad \textbf{(B) }1350 \qquad \textbf{(C) }2700 \qquad \textbf{(D) }3280 \qquad \textbf{(E) }8100 \qquad $

Suppose we have two identical cardboard polygons. We placed one polygon upon the other one and aligned. Then we pierced polygons with a pin at a point. Then we turned one of the polygons around this pin by $25^o 30'$. It turned out that the polygons coincided (aligned again). What is the minimal possible number of sides of the polygons?

$30$ people sit around a table, some of which are Yale students. Each person is asked if the person to their right is a Yale student. Yale students will always answer correctly, but non-Yale students will answer randomly. Find the smallest possible number of Yale students such that, after hearing everyone’s answers and knowing the number of Yale students, it is possible to identify for certain at least one Yale student.

Evaluate $\int_{\frac 12}^1 \sqrt{1-x^2}\ dx.$

Which of these five numbers is the largest? $ \text{(A)}\ 13579+\frac{1}{2468}\qquad\text{(B)}\ 13579-\frac{1}{2468}\qquad\text{(C)}\ 13579\times\frac{1}{2468} $ $ \text{(D)}\ 13579\div\frac{1}{2468}\qquad\text{(E)}\ 13579.2468 $

Let $ABCD$ be a parallelogram with $\angle DAB < 90$ Let $E$ be the point on the line $BC$ such that $AE = AB$ and let $F$ be the point on the line $CD$ such that $AF = AD$. The circumcircle of the triangle $CEF$ intersects the line $AE$ again in $P$ and the line $AF$ again in $Q$. Let $X$ be the reflection of $P$ over the line $DE$ and $Y$ the reflection of $Q$ over the line $BF$. Prove that $A, X, Y$ lie on the same line.

Find all functions $f:\mathbb{Z} \to \mathbb{Z}$ such that the numbers \[n, f(n),f(f(n)),\dots,f^{m-1}(n)\] are distinct modulo $m$ for all integers $n,m$ with $m>1$. (Here $f^k$ is defined by $f^0(n)=n$ and $f^{k+1}(n)=f(f^{k}(n))$ for $k \ge 0$.)

[b]7.1 / 6.1[/b] There are $8$ rooks on the chessboard such that no two of them they don't hit each other. Prove that the black squares contain an even number of rooks. [b]7.2[/b] The sides of triangle $ABC$ are extended as shown in the figure. At this $AA' = 3 AB$,, $BB' = 5BC$ , $CC'= 8 CA$. How many times is the area of the triangle $ABC$ less than the area of the triangle $A'B'C' $? [img]https://cdn.artofproblemsolving.com/attachments/9/f/06795292291cd234bf2469e8311f55897552f6.png[/img] [url=https://artofproblemsolving.com/community/c893771h1860178p12579333]7.3[/url] Prove the equality $$\frac{2}{x^2-1}+\frac{4}{x^2-4} +\frac{6}{x^2-9}+...+\frac{20}{x^2-100} =\frac{11}{(x-1)(x+10)}+\frac{11}{(x-2)(x+9)}+...+\frac{11}{(x-10)(x+1)}$$ [url=https://artofproblemsolving.com/community/c893771h1861966p12597273]7.4* / 8.4 *[/url] (asterisk problems in separate posts) [b]7.5 [/b]. The collective farm consists of $4$ villages located in the peaks of square with side $10$ km. It has the means to conctruct 28 kilometers of roads . Can a collective farm build such a road system so that was it possible to get from any village to any other? [b]7.6 / 6.6[/b] Two brilliant mathematicians were told in natural terms number and were told that these numbers differ by one. After that they take turns asking each other the same question: “Do you know my number?" Prove that sooner or later one of them will answer positively. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988085_1969_leningrad_math_olympiad]here[/url].

Let $p$ be a positive integer, $p>1.$ Find the number of $m\times n$ matrices with entries in the set $\left\{ 1,2,\dots,p\right\} $ and such that the sum of elements on each row and each column is not divisible by $p.$

Given an integer $n>1$, let $S_n$ be the group of permutations of the numbers $1,\;2,\;3,\;\ldots,\;n$. Two players, A and B, play the following game. Taking turns, they select elements (one element at a time) from the group $S_n$. It is forbidden to select an element that has already been selected. The game ends when the selected elements generate the whole group $S_n$. The player who made the last move loses the game. The first move is made by A. Which player has a winning strategy? [i]Proposed by Fedor Petrov, St. Petersburg State University.[/i]

Find the greatest possible sum of integers $a$ and $b$ such that $\frac{2021!}{20^a\cdot 21^b}$ is a positive integer. [i]Proposed by Aidan Duncan[/i]

A uniform disk, a thin hoop, and a uniform sphere, all with the same mass and same outer radius, are each free to rotate about a fixed axis through its center. Assume the hoop is connected to the rotation axis by light spokes. With the objects starting from rest, identical forces are simultaneously applied to the rims, as shown. Rank the objects according to their kinetic energies after a given time $t$, from least to greatest. [asy] size(225); pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); filldraw(circle((0,0),1),gray(.7)); draw((0,-1)--(2,-1),EndArrow); label("$\vec{F}$",(1, -1),S); label("Disk",(-1,0),W); filldraw(circle((5,0),1),gray(.7)); filldraw(circle((5,0),0.75),white); draw((5,-1)--(7,-1),EndArrow); label("$\vec{F}$",(6, -1),S); label("Hoop",(6,0),E); filldraw(circle((10,0),1),gray(.5)); draw((10,-1)--(12,-1),EndArrow); label("$\vec{F}$",(11, -1),S); label("Sphere",(11,0),E); [/asy] $ \textbf{(A)} \ \text{disk, hoop, sphere}$ $\textbf{(B)}\ \text{sphere, disk, hoop}$ $\textbf{(C)}\ \text{hoop, sphere, disk}$ $\textbf{(D)}\ \text{disk, sphere, hoop}$ $\textbf{(E)}\ \text{hoop, disk, sphere} $

Six points are chosen on the sides of an equilateral triangle $ABC$: $A_1$, $A_2$ on $BC$, $B_1$, $B_2$ on $CA$ and $C_1$, $C_2$ on $AB$, such that they are the vertices of a convex hexagon $A_1A_2B_1B_2C_1C_2$ with equal side lengths. Prove that the lines $A_1B_2$, $B_1C_2$ and $C_1A_2$ are concurrent. [i]Bogdan Enescu, Romania[/i]

The student drew a triangle $ABC$ on the board, in which $AB>BC$. On the side $AB$ is taken point $D$ such that $BD = AC$. Let points $E$ and $F$ be the midpoints of the segments $AD$ and $BC$ respectively. Then the whole picture was erased, leaving only dots $E$ and $F$. Restore triangle $ABC$.

Find the coefficient of $x^{7}y^{6}$ in $(xy+x+3y+3)^{8}$.

Suppose that $4^{n}+2^{n}+1$ is prime for some positive integer $n$. Show that $n$ must be a power of $3$.

Find all natural numbers $a$ and $b$ such that \[a|b^2, \quad b|a^2 \mbox{ and } a+1|b^2+1.\]

The diagram shows a parabola, a line perpendicular to the parabola's axis of symmetry, and three similar isosceles triangles each with a base on the line and vertex on the parabola. The two smaller triangles are congruent and each have one base vertex on the parabola and one base vertex shared with the larger triangle. The ratio of the height of the larger triangle to the height of the smaller triangles is $\tfrac{a+\sqrt{b}}{c}$ where $a$, $b$, and $c$ are positive integers, and $a$ and $c$ are relatively prime. Find $a + b + c$. [asy] size(200); real f(real x) {return 1.2*exp(2/3*log(16-x^2));} path Q=graph(f,-3.99999,3.99999); path [] P={(-4,0)--(-2,0)--(-3,f(-3))--cycle,(-2,0)--(2,0)--(0,f(0))--cycle,(4,0)--(2,0)--(3,f(3))--cycle}; for(int k=0;k<3;++k) { fill(P[k],grey); draw(P[k]); } draw((-6,0)--(6,0),linewidth(1)); draw(Q,linewidth(1));[/asy]