Bahman wants to build an area next to his garden's wall for keeping his poultry. He has three fences each of length $10$ meters. Using the garden's wall, which is straight and long, as well as the three pieces of fence, what is the largest area Bahman can enclose in meters squared? $\textbf{(A)}\ 100 \qquad\textbf{(B)}\ 50+25 \sqrt 3\qquad\textbf{(C)}\ 50 + 50\sqrt 2\qquad\textbf{(D)}\ 75 \sqrt 3 \qquad\textbf{(E)}\ 300$

Prove that there exist infinitely many positive integers $n$, for which at least one of the numbers $2^{2^n}+1$ and $2018^{2^n}+1$ is composite.

The following diagram shows four adjacent $2\times 2$ squares labeled $1, 2, 3$, and $4$. A line passing through the lower left vertex of square $1$ divides the combined areas of squares $1, 3$, and $4$ in half so that the shaded region has area $6$. The difference between the areas of the shaded region within square $4$ and the shaded region within square $1$ is $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p + q$. [img]https://cdn.artofproblemsolving.com/attachments/7/4/b9554ccd782af15c680824a1fbef278a4f736b.png[/img]

Find the number of ways a series of $+$ and $-$ signs can be inserted between the numbers $0,1,2,\cdots, 12$ such that the value of the resulting expression is divisible by 5. [i]Proposed by Matthew Lerner-Brecher[/i]

Let $a_0, b_0, c_0$ be complex numbers, and define \begin{align*}a_{n+1} &= a_n^2 + 2b_nc_n \\ b_{n+1} &= b_n^2 + 2c_na_n \\ c_{n+1} &= c_n^2 + 2a_nb_n\end{align*}for all nonnegative integers $n.$ Suppose that $\max{\{|a_n|, |b_n|, |c_n|\}} \leq 2022$ for all $n.$ Prove that $$|a_0|^2 + |b_0|^2 + |c_0|^2 \leq 1.$$

Given the trapezoid $ABCD$ with the $BC\parallel AD$, let $C_1$ and $C_2$ be circles with diameters $AB$ and $CD$ respectively. Let $M$ and $N$ be the intersection points of $C_1$ with $AC$ and $BD$ respectively. Let $K$ and $L$ be the intersection points of $C_2$ with $AC$ and $BD$ respectively. Given $M\ne A$, $N\ne B$, $K\ne C$, $L\ne D$. Prove that $NK \parallel ML$.

Consider two quadrilaterals $ABCD$ and $A'B'C'D'$ in an affine Euclidian plane such that $AB = A'B', BC = B'C', CD = C'D'$, and $DA = D'A'$. Prove that the following two statements are true: [b](a)[/b] If the diagonals $BD$ and $AC$ are mutually perpendicular, then the diagonals $B'D'$ and $A'C'$ are also mutually perpendicular. [b](b)[/b] If the perpendicular bisector of $BD$ intersects $AC$ at $M$, and that of $B'D'$ intersects $A'C'$ at $M'$, then $\frac{\overline{MA}}{\overline{MC}}=\frac{\overline{M'A'}}{\overline{M'C'}}$ (if $MC = 0$ then $M'C' = 0$).

A sequence $\{z_n\}$ satisfies that for any positive integer $i,$ $z_i\in\{0,1,\cdots,9\}$ and $z_i\equiv i-1 \pmod {10}.$ Suppose there is $2021$ non-negative reals $x_1,x_2,\cdots,x_{2021}$ such that for $k=1,2,\cdots,2021,$ $$\sum_{i=1}^kx_i\geq\sum_{i=1}^kz_i,\sum_{i=1}^kx_i\leq\sum_{i=1}^kz_i+\sum_{j=1}^{10}\dfrac{10-j}{50}z_{k+j}.$$ Determine the least possible value of $\sum_{i=1}^{2021}x_i^2.$

Let $a$ be a given positive integer. We consider the sequence $(x_n)_{n \ge 1}$ defined by $x_n=\frac{1}{1+na},$ for every positive integer $n.$ Prove that for any integer $k \ge 3,$ there exist positive integers $n_1<n_2<\ldots<n_k$ such that the numbers $x_{n_1},x_{n_2},\ldots,x_{n_k}$ are consecutive terms in an arithmetic progression.

Let $a,b,c$ be distinct nonzero real numbers. If the equations $ax^3+bx+c=0$, $bx^3+cx+a=0,$ and $cx^3+ax+b=0$ have a common root, prove that at least one of these equations has three real roots(not necessarily distinct).

A cylinder radius $12$ and a cylinder radius $36$ are held tangent to each other with a tight band. The length of the band is $m\sqrt{k}+n\pi$ where $m$, $k$, and $n$ are positive integers, and $k$ is not divisible by the square of any prime. Find $m + k + n$. [asy] size(150); real t=0.3; void cyl(pair x, real r, real h) { pair xx=(x.x,t*x.y); path B=ellipse(xx,r,t*r), T=ellipse((x.x,t*x.y+h),r,t*r), S=xx+(r,0)--xx+(r,h)--(xx+(-r,h))--xx-(r,0); unfill(S--cycle); draw(S); unfill(B); draw(B); unfill(T); draw(T); } real h=8, R=3,r=1.2; pair X=(0,0), Y=(R+r)*dir(-50); cyl(X,R,h); draw(shift((0,5))*yscale(t)*arc(X,R,180,360)); cyl(Y,r,h); void str (pair x, pair y, real R, real r, real h, real w) { real u=(angle(y-x)+asin((R-r)/(R+r)))*180/pi+270; path P=yscale(t)*(arc(x,R,180,u)--arc(y,r,u,360)); path Q=shift((0,h))*P--shift((0,h+w))*reverse(P)--cycle; fill(Q,grey);draw(Q); } str(X,Y,R,r,3.5,1.5);[/asy]

[b][color=#f00]Same exact problem as 2010 Spring LMT Theme Round Problem 7?[/color][/b] :what?:

Find the largest constant $k$ such that the inequality $$a^2+b^2+c^2-ab-bc-ca \ge k \left|\frac{a^3-b^3}{a+b}+\frac{b^3-c^3}{b+c}+\frac{c^3-a^3}{c+a}\right|$$ holds for any for non negative real numbers $a,b,c$ with $(a+b)(b+c)(c+a)>0$.

At Andover, $35\%$ of students are lowerclassmen and the rest are upperclassmen. Given that $26\%$ of lowerclassmen and $6\%$ of upperclassmen take Latin, what percentage of all students take Latin? [i]Proposed by Anthony Yang[/i]

Find all continuous functions $f(x)$ defined for all $x>0$ such that for every $x$, $y > 0$ \[ f\left(x+{1\over x}\right)+f\left(y+{1\over y}\right)= f\left(x+{1\over y}\right)+f\left(y+{1\over x}\right) . \] [i]Proposed by F. Petrov[/i]

Given two internally tangent circles; in the bigger one we inscribe an equilateral triangle. From each of the vertices of this triangle, we draw a tangent to the smaller circle. Prove that the length of one of these tangents equals the sum of the lengths of the two other tangents.

Let $\bullet$ be the operation such that $a\bullet b=10a-b$. What is the value of $\left(\left(\left(2\bullet0\right)\bullet1\right)\bullet3\right)$? $\text{(A) }1969\qquad\text{(B) }1987\qquad\text{(C) }1993\qquad\text{(D) }2007\qquad\text{(E) }2013$

How many base 10 four-digit numbers, $N = \underline{a} \underline{b} \underline{c} \underline{d}$, satisfy all three of the following conditions? (i) $4,000 \leq N < 6,000;$ (ii) $N$ is a multiple of 5; (iii) $3 \leq b < c \leq 6$. $ \mathbf{(A)}\; 10\qquad \mathbf{(B)}\; 18\qquad \mathbf{(C)}\; 24\qquad \mathbf{(D)}\; 36\qquad \mathbf{(E)}\; 48$

Let $ABC$ be an acute triangle. A line parallel to $BC$ intersects the sides $AB$ and $AC$ at $D$ and $E$, respectively. The circumcircle of the triangle $ADE$ intersects the segment $CD$ at $F \ (F \neq D).$ Prove that the triangles $AFE$ and $CBD$ are similar.

Define the operator " $ * $ " on $ \mathbb{R} $ as $ x*y=x+y+xy. $ [b]a)[/b] Show that $ \mathbb{R}\setminus\{ -1\} , $ along with the operator above, is isomorphic with $ \mathbb{R}\setminus\{ 0\} , $ with the usual multiplication. [b]b)[/b] Determine all finite semigroups of $ \mathbb{R} $ under " $ *. $ " Which of them are groups? [b]c)[/b] Prove that if $ H\subset_{*}\mathbb{R} $ is a bounded semigroup, then $ H\subset [-2, 0]. $

Let $a,b,c$ be the sides of a triangle, $\alpha ,\beta ,\gamma$ the corresponding angles and $r$ the inradius. Prove that $$a\cdot sin\alpha+b\cdot sin\beta+c\cdot sin\gamma\geq 9r$$

Let $ABC$ be a triangle with $AB \neq AC$ and circumcenter $O$. The bisector of $\angle BAC$ intersects $BC$ at $D$. Let $E$ be the reflection of $D$ with respect to the midpoint of $BC$. The lines through $D$ and $E$ perpendicular to $BC$ intersect the lines $AO$ and $AD$ at $X$ and $Y$ respectively. Prove that the quadrilateral $BXCY$ is cyclic.

In a school with some students, for any three student, there exists at least one student who are friends with all these three students.(Friendships are mutual) For any friends $A$ and $B$, any two of their common friends are also friends with each other. It's not possible to partition these students into two groups, such that every student in each group are friends with all the students in the other gruop. Prove that any two people who aren't friends with each other, has the same number of common friends.(Each person is a friend of him/herself.)

In a plane a finite number of equal circles are given. These circles are mutually nonintersecting (they may be externally tangent). Prove that one can use at most four colors for coloring these circles so that two circles tangent to each other are of different colors. What is the smallest number of circles that requires four colors?

A group of the pupils in a class are called [i]dominant[/i] if any other pupil from the class has a friend in the group. If it is known that there exist at least 100 dominant groups, prove that there exists at least one more dominant group. (proposed by B. Batbayasgalan, inspired by Komal problem)