If $3^{2x}+9=10(3^{x})$, then the value of $(x^2+1)$ is $\textbf{(A) }1\text{ only}\qquad\textbf{(B) }5\text{ only}\qquad\textbf{(C) }1\text{ or }5\qquad\textbf{(D) }2\qquad \textbf{(E) }10$

Prove that if the numbers $ a_1, a_2,\ldots, a_n $ ($ n $ - natural number $ \geq 2 $) form an arithmetic progression, and none of them is zero, then $$\frac{1}{a_1a_2} + \frac{1}{a_2a_3} + \ldots + \frac{1}{a_{n-1}a_n} = \frac{n-1}{a_1a_n}.$$

Two players play the following game. The first player starts by writing either $0$ or $1$ and then, on his every move, chooses either $0$ or $1$ and writes it to the right of the existing digits until there are $1999$ digits. Each time the first player puts down a digit (except the first one) , the second player chooses two digits among those already written and swaps them. Can the second player guarantee that after his last move the line of digits will be symmetrical about the middle digit? (I Izmestiev)

Point $D$ on the side $BC$ of the acute triangle $ABC$ is chosen so that $AD = AC$. Let $P$ and $Q$ be the feet of the perpendiculars from $C$ and $D$ on the side $AB$, respectively. Suppose that $AP^2 + 3BP^2 = AQ^2 + 3BQ^2$. Determine the measure of angle $\angle ABC$.

The positive numbers $a, b, c$ and $d$ satisfy $a\le b\le c\le d$ and $a + b + c + d \le 1$ . Prove that $a^2 + 3b^2 + 5c^2 + 7 d^2 \ge 1$ .

Let $a_0$ be a positive integer and $a_n=5a_{n-1}+4$ for all $n\ge 1$. Can $a_0$ be chosen so that $a_{54}$ is a multiple of $2013$?

[u]Round 6[/u] 16. If you roll four fair $6$-sided dice, what is the probability that at least three of them will show the same value. 17. In a tetrahedron with volume $1$, four congruent speres are placed each tangent to three walls and three other spheres. What is the radii of each of the spheres. 18. let $f(x)$ be twice the number of letters in $x$. What is the sum of the unique $x,y$ such that $x \ne y$ and $f(x)=y$ and $f(y)=x$. [u]Round 7[/u] [b]p19.[/b] How many $4$ digit numbers with distinct digits $ABCD$ with $A$ not equal to $0$ are divisible by $11$? [b]p20.[/b] How many ($2$-dimensional) faces does a $2014$-dimensional hypercube have? [b]p21.[/b] How many subsets of the numbers $1,2,3,4...2^{2014}$ have a sum of $2014$ mod $2^{2014}$? [u]Round 8[/u] [b]p22.[/b] Two diagonals of a dodecagon measure $1$ unit and $2$ units. What is the area of this dodecagon? [b]p23.[/b] Square $ABCD$ has point $X$ on AB and $Y$ on $BC$ such that angle $ADX = 15$ degrees and angle $CDY = 30$ degrees. what is the degree measure of angle $DXY$? [b]p24.[/b] A $4\times 4$ grid has the numbers $1$ through $16$ placed in it, $1$ per cell, such that no adjacent boxes have cells adding to a number divisible by $3$. In how many ways is this possible? [u]Round 9[/u] [b]p25.[/b] Let $B$ and $C$ be the answers to $26$ and $27$ respectively.If $S(x)$ is the sum of the digits in $x$, what is the unique integer $A$ such that $S(A), S(B), S(C) \subset A,B,C$. [b]p26.[/b] Let $A$ and $C$ be the answers to $25$ and $27$ respectively. What is the third angle of a triangle with two of its angles equal to $A$ and $C$ degrees. [b]p27.[/b] Let $A$ and $B$ be the answers to $25$ and $26$ respectively. How many ways are there to put $A$ people in a line, with exactly $B$ places where a girl and a boy are next to each other. [u]Round 10[/u] [b]p28.[/b] What is the sum of all the squares of the digits to answers to problems on the individual, team, and theme rounds of this years LMT? If the correct answer is $N$ and you submit $M$, you will recieve $\lfloor 15 - 10  \times \log (M - N) \rfloor $. [b]p29.[/b] How many primes have all distinct digits, like $2$ or $109$ for example, but not $101$. If the correct answer is $N$ and you submit $M$, you will recieve $\left\lfloor 15 \min \left( \frac{M}{N} , \frac{N}{M} \right)\right\rfloor $. [b]p30.[/b] For this problem, you can use any $10$ mathematical symbols that you want, to try to achieve the highest possible finite number. (So "Twenty-one", " $\frac{12}{100} +843$" and "$\sum^{10}_{i=0} i^2 +1$" are all valid submissions.) If your team has the $N$th highest number, you will recieve $\max (16 - N, 0)$. PS. You should use hide for answers. Rounds 1-5 have been posted [url=https://artofproblemsolving.com/community/c3h3156859p28695035]here[/url].. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all ordered pairs of integers $\left(m,n\right)$ such that $$\frac{1}{m}+\frac{1}{n}=\frac{1}{7}.$$

Sequence $a_n$ is defined by $a_1=\frac{1}{2}$, $a_m=\frac{a_{m-1}}{2m \cdot a_{m-1} + 1}$ for $m>1$. Determine value of $a_1+a_2+...+a_k$ in terms of $k$, where $k$ is positive integer.

A non-square rectangle is cut into $N$ rectangles of various shapes and sizes. Prove that one can always cut each of these rectangles into two rectangles so that one can construct a square and rectangle, each figure consisting of $N$ pieces. [i](6 points)[/i]

Let $(a_n)$ and $(b_n)$ be the sequences of real numbers such that \[ (2 + i)^n = a_n + b_ni \] for all integers $n\geq 0$, where $i = \sqrt{-1}$. What is \[\sum_{n=0}^\infty\frac{a_nb_n}{7^n}\,?\] $\textbf{(A) }\frac 38\qquad\textbf{(B) }\frac7{16}\qquad\textbf{(C) }\frac12\qquad\textbf{(D) }\frac9{16}\qquad\textbf{(E) }\frac47$

In 3D coordinate space, $O$ is the origin, $A$ lies on the positive $x$-axis, $B$ lies on the positive $y$-axis, and $C$ lies on the positive $z$-axis such that $BO = 2AO$ and $CO = 3AO$. Suppose that a unit cube with sides parallel to the axes can be inscribed within tetrahedron $ABCO$. Compute $AO + BO + CO$.

Let $O$ be the centre of a regular $n$-gon whose vertices are labelled $A_1$,$...$, $A_n$. Let $a_1>a_2>...>a_n>0$. Prove that the vector $$a_1\overrightarrow{OA_1}+a_2\overrightarrow{OA_2}+...+a_n\overrightarrow{OA_n}$$ is not equal to the zero vector. (D. Fomin, Alexey Kirichenko)

There are $50$ exact watches lying on a table. Prove that there exist a certain moment, when the sum of the distances from the centre of the table to the ends of the minute hands is more than the sum of the distances from the centre of the table to the centres of the watches.

A boa of size $k$ is a graph with $k+1$ vertices $\{0,1,\dots,k-1,k\}$ and edges only between the vertices $i$ and $i+1$ for $0\leq i < k.$ The boa is place in a graph $G$ through a injection of graphs. (This is an injective function form the vertices of the boa to the vertices of the graph in such a way that if there is an edge between the vertices $x$ and $y$ in the boa then there must be an edge between $f(x)$ and $f(y)$ in $G$). The Boa can move in the graph $G$ using to type of movement each time. If the boa is initially on the vertices $f(0),f(1),\dots,f(k)$ then it moves in one of the following ways: (i) It choose $v$ a neighbor of $f(k)$ such that $v\not\in\{f(0),f(1),\dots,f(k-1)\}$ and the boa now moves to $f(0),f(1),\dots,f(k)$ with $f'(k)=v$ and $f'(i) = f(i+1)$ for $0 \leq i < k,$ or (ii) It choose $v$ a neighbor of $f(0)$ such that $v\not\in\{f(1),f(2),\dots,f(k)\}$ and the boa now moves to $f(0),f(1),\dots,f(k)$ with $f'(0)=v$ and $f'(i) = f'(i-1)$ for $0 < i \leq k.$ Prove that if $G$ is a connected graph with diameter $d$, then it is possible to put a size $\lceil d/2 \rceil$ boa in $G$ such that the boa can reach any vertex of $G$.

Square $ABCD$ and triangle $ABE$ have equal area. Square $ABCD$ has sidelength $4$, while triangle $ABE$ has height $h$ and base $4$. Find the value of $h$. [center][img]https://cdn.artofproblemsolving.com/attachments/7/c/efe7bed4232f9d2440f5719d6f2ddae0ef7d05.png[/img][/center] $\textbf{(A) }\dfrac43\qquad\textbf{(B) }2\qquad\textbf{(C) }4\qquad\textbf{(D) }6\qquad\textbf{(E) }8$

The figure shows an arc $\ell$ on the unit circle and two regions $A$ and $B$. Prove that the area of $A$ plus the area of $B$ equals the length of $\ell$. [img]https://1.bp.blogspot.com/-SYoSrFowZ30/XzRz0ygiOVI/AAAAAAAAMUs/0FCduUoxKGwq0gSR-b3dtb3SvDjZ89x_ACLcBGAsYHQ/s0/2017%2BMohr%2Bp3.png[/img]

Let $a, b, c$ be non-zero real numbers that satisfy $\frac{1}{abc} + \frac{1}{a} + \frac{1}{c} = \frac{1}{b}$. The expression $\frac{4}{a^2 + 1} + \frac{4}{b^2 + 1} + \frac{7}{c^2 + 1}$ has a maximum value $M$. Find the sum of the numerator and denominator of the reduced form of $M$.

Let $A_1 A_2 A_3 A_4 A_5 A_6 A_7 A_8$ be a regular octagon. Let $M_1$, $M_3$, $M_5$, and $M_7$ be the midpoints of sides $\overline{A_1 A_2}$, $\overline{A_3 A_4}$, $\overline{A_5 A_6}$, and $\overline{A_7 A_8}$, respectively. For $i = 1, 3, 5, 7$, ray $R_i$ is constructed from $M_i$ towards the interior of the octagon such that $R_1 \perp R_3$, $R_3 \perp R_5$, $R_5 \perp R_7$, and $R_7 \perp R_1$. Pairs of rays $R_1$ and $R_3$, $R_3$ and $R_5$, $R_5$ and $R_7$, and $R_7$ and $R_1$ meet at $B_1$, $B_3$, $B_5$, $B_7$ respectively. If $B_1 B_3 = A_1 A_2$, then $\cos 2 \angle A_3 M_3 B_1$ can be written in the form $m - \sqrt{n}$, where $m$ and $n$ are positive integers. Find $m + n$.

Let $p_1,p_2,p_3,p_4$ be four distinct primes, and let $1=d_1<d_2<\ldots<d_{16}=n$ be the divisors of $n=p_1p_2p_3p_4$. Determine all $n<2001$ with the property that $d_9-d_8=22$.

For each positive integer $ n$,define $ f(n)\equal{}lcm(1,2,...,n)$. (a)Prove that for every $ k$ there exist $ k$ consecutive positive integers on which $ f$ is constant. (b)Find the maximum possible cardinality of a set of consecutive positive integers on which $ f$ is strictly increasing and find all sets for which this maximum is attained.

Let $a,b,c,d$ be pairwise distinct positive integers such that $$\frac{a}{a+b}+\frac{b}{b+c}+\frac{c}{c+d}+\frac{d}{d+a}$$ is an integer. Prove that $a+b+c+d$ is [b]not[/b] a prime number.

Consider the numbers from $1$ to $32$. A game is made by placing all the numbers in pairs and replacing each pair with the largest prime divisor of the sum of the numbers of that couple. For example, if we match the $32$ numbers as: $(1, 2), (3,4),(5, 6), (7, 8),..., (27, 28),(29, 30), (31,32)$, we get the following list of $16$ numbers: $3,7,11,5,...,11,59,7$. where there are repetitions. The game continues in a similar way until in the end only one number remains. Determine the highest possible value from the number that remains at the end.

Find the smallest positive constant $c$ satisfying: For any simple graph $G=G(V,E)$, if $|E|\geq c|V|$, then $G$ contains $2$ cycles with no common vertex, and one of them contains a chord. Note: The cycle of graph $G(V,E)$ is a set of distinct vertices ${v_1,v_2...,v_n}\subseteq V$, $v_iv_{i+1}\in E$ for all $1\leq i\leq n$ $(n\geq 3, v_{n+1}=v_1)$; a cycle containing a chord is the cycle ${v_1,v_2...,v_n}$, such that there exist $i,j, 1< i-j< n-1$, satisfying $v_iv_j\in E$.

Given is a triangle $ABC$ with barycenter $G$ and circumcenter $O$.The perpendicular bisectors of $GA,GB,GC$ intersect at $A_1,B_1,C_1$.Show that $O$ is the barycenter of $\triangle{A_1B_1C_1}$.