A square paper of side $n$ is divided into $n^2$ unit square cells. A maze is drawn on the paper with unit walls between some cells in such a way that one can reach every cell from every other cell not crossing any wall. Find, in terms of $n$, the largest possible total length of the walls.

Adam has a single stack of $3 \cdot 2^n$ rocks, where $n$ is a nonnegative integer. Each move, Adam can either split an existing stack into two new stacks whose sizes differ by $0$ or $1$, or he can combine two existing stacks into one new stack. Adam keeps performing such moves until he eventually gets at least one stack with $2^n$ rocks. Find, with proof, the minimum possible number of times Adam could have combined two stacks. [i]Proposed by Anthony Wang[/i]

The real numbers $a_1,a_2,a_3$ and $b{}$ are given. The equation \[(x-a_1)(x-a_2)(x-a_3)=b\]has three distinct real roots, $c_1,c_2,c_3.$ Determine the roots of the equation \[(x+c_1)(x+c_2)(x+c_3)=b.\][i]Proposed by A. Antropov and K. Sukhov[/i]

Let $\triangle ABC$ be a triangle with side‐lengths $a,b,c$, incenter $I$, and circumradius $R$. Denote by $P$ the area of $\triangle ABC$, and let $P_1,\;P_2,\;P_3$ be the areas of triangles $\triangle ABI$, $\triangle BCI$, and $\triangle CAI$, respectively. Prove that \[ \frac{abc}{12R} \;\le\; \frac{P_1^2 + P_2^2 + P_3^2}{P} \;\le\; \frac{3R^3}{4\sqrt[3]{abc}}. \]

Fourteen friends met at a party. One of them, Fredek, wanted to go to bed early. He said goodbye to 10 of his friends, forgot about the remaining 3, and went to bed. After a while he returned to the party, said goodbye to 10 of his friends (not necessarily the same as before), and went to bed. Later Fredek came back a number of times, each time saying goodbye to exactly 10 of his friends, and then went back to bed. As soon as he had said goodbye to each of his friends at least once, he did not come back again. In the morning Fredek realized that he had said goodbye a different number of times to each of his thirteen friends! What is the smallest possible number of times that Fredek returned to the party?

The polynomial $ P(x)\equal{}x^3\plus{}ax^2\plus{}bx\plus{}d$ has three distinct real roots. The polynomial $ P(Q(x))$, where $ Q(x)\equal{}x^2\plus{}x\plus{}2001$, has no real roots. Prove that $ P(2001)>\frac{1}{64}$.

Prove that if $ M $, $ N $, $ P $ are the feet of the altitudes of acute-angled triangle $ ABC $, then the ratio of the perimeter of triangle $ MNP $ to the perimeter of triangle $ ABC $ is equal to the ratio of the radius of the circle inscribed in triangle $ ABC $ to the radius of the circle circumscribed about triangle $ ABC $.

Initially, a pair of numbers $(1,1)$ is written on the board. If for some $x$ and $y$ one of the pairs $(x, y-1)$ and $(x+y, y+1)$ is written on the board, then you can add the other one. Similarly for $(x, xy)$ and $(\frac {1} {x}, y)$. Prove that for each pair that appears on the board, its first number will be positive.

A solid box is $ 15$ cm by $ 10$ cm by $ 8$ cm. A new solid is formed by removing a cube $ 3$ cm on a side from each corner of this box. What percent of the original volume is removed? $ \textbf{(A)}\ 4.5 \qquad \textbf{(B)}\ 9 \qquad \textbf{(C)}\ 12 \qquad \textbf{(D)}\ 18 \qquad \textbf{(E)}\ 24$

Let $\Gamma$ be the excircle of triangle $ABC$ opposite to the vertex $A$ (namely, the circle tangent to $BC$ and to the prolongations of the sides $AB$ and $AC$ from the part $B$ and $C$). Let $D$ be the center of $\Gamma$ and $E$, $F$, respectively, the points in which $\Gamma$ touches the prolongations of $AB$ and $AC$. Let $J$ be the intersection between the segments $BD$ and $EF$. Prove that $\angle CJB$ is a right angle.

Consider the function $ f: \mathbb{N}_0\to\mathbb{N}_0$, where $ \mathbb{N}_0$ is the set of all non-negative integers, defined by the following conditions : $ (i)$ $ f(0) \equal{} 0$; $ (ii)$ $ f(2n) \equal{} 2f(n)$ and $ (iii)$ $ f(2n \plus{} 1) \equal{} n \plus{} 2f(n)$ for all $ n\geq 0$. $ (a)$ Determine the three sets $ L \equal{} \{ n | f(n) < f(n \plus{} 1) \}$, $ E \equal{} \{n | f(n) \equal{} f(n \plus{} 1) \}$, and $ G \equal{} \{n | f(n) > f(n \plus{} 1) \}$. $ (b)$ For each $ k \geq 0$, find a formula for $ a_k \equal{} \max\{f(n) : 0 \leq n \leq 2^k\}$ in terms of $ k$.

Evaluate $\int_0^{\infty} \frac{1}{e^{x}(1+e^{4x})}dx.$

Consider a convex polygon in a plane such that the length of all edges and diagonals are rational. After connecting all diagonals, prove that any length of a segment is rational.

In an acute-angled triangle \(ABC\) \((AC > BC)\) with altitude \(AD\), the following points are marked: \(H\) - the orthocenter, \(O\) - the circumcenter, \(K\) - the midpoint of side \(AB\). Inside the triangle \(\triangle ADC\), there is a point \(P\) such that the following equality holds: \[ \angle KPD + \angle ACB = 2 \angle OPH = 180^{\circ} \] Prove that \[ BH = 2PD \] [i]Proposed by Vadym Solomka[/i]

Compute the smallest positive integer $n$ for which $$\sqrt{100+\sqrt{n}}+\sqrt{100-\sqrt{n}}$$ is an integer.

[b]7.1.[/b] Prove that from the sides of an arbitrary quadrilateral you can fold a trapezoid. [b]7.2 / 6.2[/b] The numbers $A$ and $B$ are relatively prime. What common divisors can have the numbers $A+B$ and $A-B$? [b]7.3. / 6.4[/b] $15$ magazines lie on the table, completely covering it. Prove that it is possible to remove eight of them so that the remaining magz cover at least $7/15$ of the table area. [b]7.4[/b] In a six-digit number that is divisible by $7$, the last digit has been moved to the beginning. Prove that the resulting number is also divisible at $7$. [url=https://artofproblemsolving.com/community/c6h3391057p32066818]7.5*[/url] (asterisk problems in separate posts) [b]7.6 [/b] On sides $AB$ and $ BC$ of triangle $ABC$ , are constructed squares $ABDE$ and $BCKL$ with centers $O_1$ and $O_2$. $M_1$ and $M_2$ are midpoints of segments $DL$ and $AC$. Prove that $O_1M_1O_2M_2$ is a square. [img]https://cdn.artofproblemsolving.com/attachments/8/1/8aa816a84c5ac9de78b396096cf718063de390.png[/img] PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983459_1962_leningrad_math_olympiad]here[/url].

How many $3$-inch-by-$5$-inch photos will it take to completely cover the surface of a $3$-foot-by-$5$-foot poster? $\text{(A) }24\qquad\text{(B) }114\qquad\text{(C) }160\qquad\text{(D) }172\qquad\text{(E) }225$

Given real numbers $x,y,z,a$ satisfying: $$ x+y+z = a$$ $$ \frac{1}{x}+\frac{1}{y}+\frac{1}{z} = \frac{1}{a} $$ Prove that at least one of the numbers $x,y,z$ is equal to $a$.

Find the sum of the fiftieth powers of all sides and diagonals of a regular $100$-gon inscribed in a circle of radius $R.$

After viewing the John Harvard statue, a group of tourists decides to estimate the distances of nearby locations on a map by drawing a circle, centered at the statue, of radius $\sqrt{n}$ inches for each integer $2020\leq n \leq 10000$, so that they draw $7981$ circles altogether. Given that, on the map, the Johnston Gate is $10$-inch line segment which is entirely contained between the smallest and the largest circles, what is the minimum number of points on this line segment which lie on one of the drawn circles? (The endpoint of a segment is considered to be on the segment.)

Let $f$ be a polynomial function with integer coefficients and $p$ be a prime number. Suppose there are at least four distinct integers satisfying $f(x) = p$. Show that $f$ does not have integer zeros.

A square with area 4 is inscribed in a square with area 5, with one vertex of the smaller square on each side of the larger square. A vertex of the smaller square divides a side of the larger square into two segments, one of length $a$, and the other of length $b$. What is the value of $ab$ ? [asy] draw((0,2)--(2,2)--(2,0)--(0,0)--cycle); draw((0,0.3)--(0.3,2)--(2,1.7)--(1.7,0)--cycle); label("$a$",(-0.1,0.15)); label("$b$",(-0.1,1.15)); [/asy] $\textbf{(A)}\hspace{.05in}\dfrac15 \qquad \textbf{(B)}\hspace{.05in}\dfrac25 \qquad \textbf{(C)}\hspace{.05in}\dfrac12 \qquad \textbf{(D)}\hspace{.05in}1 \qquad \textbf{(E)}\hspace{.05in}4 $

I’m given a square of side length $7,$ and I want to make a regular tetrahedron from it. Specifically, my strategy is to cut out a net. If I cut out a parallelogram-shaped net that yields the biggest regular tetrahedron, what is the surface area of the resulting tetrahedron?

Point $A$, $B$, $C$, and $D$ form a rectangle in that order. Point $X$ lies on $CD$, and segments $\overline{BX}$ and $\overline{AC}$ intersect at $P$. If the area of triangle $BCP$ is 3 and the area of triangle $PXC$ is 2, what is the area of the entire rectangle?

If $x^2\cos\theta-x(1-x)+(1-x)^2\sin\theta>0$ for all $x\in[0,1]$, find the range value of $\theta$.