Angle $A$ in triangle $ABC$ is equal to $120^o$. Prove that the distance from the center of the circumscribed circle to the orthocenter is equal to $AB + AC$. (V. Protasov)

An infinite sequence $(x_{n})$ is defined by its first term $x_{1}>1$, which is a rational number, and the relation $x_{n+1}=x_{n}+\frac{1}{\lfloor x_{n}\rfloor}$ for all positive integers $n$. Prove that this sequence contains an integer. [i]A. Golovanov[/i]

Let $n$ be an odd positive integer. Prove that $\sigma(n)^3 <n^4$.

Find all positive integers $n$ such that $n$ is equal to $100$ times the number of positive divisors of $n$.

When Pablo turns $15$, he throws a party inviting $43$ friends. He presents them with a cake n the form of a regular $15$-sided polygon and on it $15$ candles. The candles are arranged so that between candles and vertices there are never three aligned (any three candles are not aligned, nor are any two candles with a vertex of the polygon, nor are any two vertices of the polygon with a candle). Then Pablo divides the cake into triangular pieces, by means of cuts that join candles to each other or candles and vertices, but also do not intersect with others already made. Why, by doing this, Paul was able to distribute a piece to each of his guests but he was left without eating?

Find all integers $x,y$ that satisfy the equation $x+y=x^2-xy+y^2$

Let $ X $ be the power set of set of $ \{ 0\}\cup\mathbb{N} , $ and let be a function $ d:X^2\longrightarrow\mathbb{R} $ defined as $$ d(U,V)=\sum_{n\in\mathbb{N}}\frac{\chi_U (n) +\chi_V (n) -2\chi_{U\cap V} (n)}{2} , $$ where $ \chi_W (n)=\left\{ \begin{matrix} 1,& n\in W\\ 0,& n\not\in W \end{matrix} \right. ,\quad\forall W\in X,\forall n\in\mathbb{N} . $ [b]a)[/b] Prove that there exists an unique $ V' $ such that $ \lim_{k\to\infty} d\left( \{ k+i|i\in\mathbb{N}\} , V'\right) =0. $ [b]b)[/b] Demonstrate that for all $ V\in X $ there exists a $ v\in\mathbb{N} $ with $ d\left( \left\{ \frac{3}{2} -\frac{1}{2}(-1)^{v} \right\} , V \right) >\frac{1}{k} . $ [b]c)[/b] Let $ f: X\longrightarrow X,\quad f(X)=\left\{ 1+x|x\in X\right\} . $ Calculate $ d\left( f(A),f(B) \right) $ in terms of $ d(A,B) $ and prove that $ f $ admits an unique fixed point.

To a sheet of paper, we glue $2011$ “handles” that do not intersect, that is, strips of paper glued to the sheet in your ends. No handle can be twisted. Prove that the surface boundary thus formed has at least two cycles (closed curves). That is, an ant that only walks along the edge of the paper never runs through the entire surface boundary. For example, the configuration represented in the figure has three cycles: one in dashed lines, one in lines dotted lines and another in a continuous line (this cycle passes under a tab twice). [img]https://cdn.artofproblemsolving.com/attachments/f/e/121146a240215f241278b3aabde13a67544e7a.png[/img]

Let $ABC$ be a triangle such that \[ \left( \cot \dfrac{A}{2} \right)^2 + \left( 2\cot \dfrac{B}{2} \right)^2 + \left( 3\cot \dfrac{C}{2} \right)^2 = \left( \dfrac{6s}{7r} \right)^2, \] where $s$ and $r$ denote its semiperimeter and its inradius, respectively. Prove that triangle $ABC$ is similar to a triangle $T$ whose side lengths are all positive integers with no common divisors and determine these integers.

A spider is walking on the boundary of equilateral triangle $\triangle{ABC}$ (vertices labelled in counterclockwise order), starting at vertex $A$. Each second, she moves to one of her two adjacent vertices with equal probability. The windiness of a path that starts and ends at $A$ is the net number of counterclockwise revolutions made. For example, the windiness of the path $ABCA$ is $1,$ and the windiness of the path $ABCACBACBA$ is $-1$. What is the remainder modulo $1000$ of the sum of the squares of the windiness values taken over all possible paths that end back at vertex $A$ after $2025$ seconds?

A palindrome between $ 1000$ and $ 10,000$ is chosen at random. What is the probability that it is divisible by $ 7?$ $ \textbf{(A)}\ \dfrac{1}{10} \qquad \textbf{(B)}\ \dfrac{1}{9} \qquad \textbf{(C)}\ \dfrac{1}{7} \qquad \textbf{(D)}\ \dfrac{1}{6}\qquad \textbf{(E)}\ \dfrac{1}{5}$

Ati has $ 7$ pots of flower, ordered in $ P_1,P_2,P_3,P_4,P_5,P_6,P_7$. She wants to rearrange the position of those pots to $ B_1,B_2,B_2,B_3,B_4,B_5,B_6,B_7$ such that for every positive integer $ n<7$, $ B_1,B_2,\dots,B_n$ is not the permutation of $ P_1,P_2,\dots,P_7$. In how many ways can Ati do this?

In triangle $ABC$, $\angle A =60^o$. Let $BB_1$ and $CC_1$ be angle bisectors of this triangle. Prove that the point symmetrical to vertex $A$ with respect to line $B_1C_1$ lies on side $BC$.

A big $ L$ is formed as shown. What is its area? [asy]unitsize(4mm); defaultpen(linewidth(.8pt)+fontsize(12pt)); draw((0,0)--(5,0)--(5,2)--(2,2)--(2,8)--(0,8)--cycle); label("5",(2.5,0),S); label("2",(5,1),E); label("2",(1,8),N); label("8",(0,4),W);[/asy]$ \textbf{(A)}\ 22 \qquad \textbf{(B)}\ 24 \qquad \textbf{(C)}\ 26 \qquad \textbf{(D)}\ 28 \qquad \textbf{(E)}\ 30$

In a school with double schooling, in the morning the language teacher divided the students into $200$ groups for an activity. In the afternoon, the math teacher divided the same students into $300$ groups for another activity. A student is considered [i]special[/i] if the group they belonged to in the afternoon is smaller than the group they belonged to in the morning. Find the minimum number of special students that can exist in the school. [b]Note:[/b] Each group has at least one student.

Let $ABC$ be a triangle. Points $P$ and $Q$ lie on side $BC$ and satisfy $|BP| =|PQ| = |QC| = \frac13 |BC|$. Points $R$ and $S$ lie on side $CA$ and satisfy $|CR| =|RS| = |SA| = 1 3 |CA|$. Finally, points $T$ and $U$ lie on side $AB$ and satisfy $|AT| = |TU| = |UB| =\frac13 |AB|$. Points $P, Q,R, S, T$ and $U$ turn out to lie on a common circle. Prove that $ABC$ is an equilateral triangle.

Hi guys, I was just reading over old posts that I made last year ( :P ) and saw how much the level of Getting Started became harder. To encourage more people from posting, I decided to start a Problem of the Day. This is how I'll conduct this: 1. In each post (not including this one since it has rules, etc) everyday, I'll post the problem. I may post another thread after it to give hints though. 2. Level of problem.. This is VERY important. All problems in this thread will be all AHSME or problems similar to this level. No AIME. Some AHSME problems, however, that involve tough insight or skills will not be posted. The chosen problems will be usually ones that everyone can solve after working. Calculators are allowed when you solve problems but it is NOT necessary. 3. Response.. All you have to do is simply solve the problem and post the solution. There is no credit given or taken away if you get the problem wrong. This isn't like other threads where the number of problems you get right or not matters. As for posting, post your solutions here in this thread. Do NOT PM me. Also, here are some more restrictions when posting solutions: A. No single answer post. It doesn't matter if you put hide and say "Answer is ###..." If you don't put explanation, it simply means you cheated off from some other people. I've seen several posts that went like "I know the answer" and simply post the letter. What is the purpose of even posting then? Huh? B. Do NOT go back to the previous problem(s). This causes too much confusion. C. You're FREE to give hints and post different idea, way or answer in some cases in problems. If you see someone did wrong or you don't understand what they did, post here. That's what this thread is for. 4. Main purpose.. This is for anyone who visits this forum to enjoy math. I rememeber when I first came into this forum, I was poor at math compared to other people. But I kindly got help from many people such as JBL, joml88, tokenadult, and many other people that would take too much time to type. Perhaps without them, I wouldn't be even a moderator in this forum now. This site clearly made me to enjoy math more and more and I'd like to do the same thing. That's about the rule.. Have fun problem solving! Next post will contain the Day 1 Problem. You can post the solutions until I post one. :D

$ \odot O_1$ and $ \odot O_2$ meet at points $ P$ and $ Q$. The circle through $ P$, $ O_1$ and $ O_2$ meets $ \odot O_1$ and $ \odot O_2$ at points $ A$ and $ B$. Prove that the distance from $ Q$ to the lines $ PA$, $ PB$ and $ AB$ are equal. (Prove the following three cases: $ O_1$ and $ O_2$ are in the common space of $ \odot O_1$ and $ \odot O_2$; $ O_1$ and $ O_2$ are out of the common space of $ \odot O_1$ and $ \odot O_2$; $ O_1$ is in the common space of $ \odot O_1$ and $ \odot O_2$, $ O_2$ is out of the common space of $ \odot O_1$ and $ \odot O_2$.

Let $ABCD$ be a trapezoid ($AD//BC$) with $\angle A=\angle B= 90^o$ and $AD<BC$. Let $E$ be the intersection point of the non parallel sides $AB$ and $CD$, $Z$ be the symmetric point of $A$ wrt line $BC$ and $M$ be the midpoint of $EZ$. If it is given than line $CM$ is perpendicular on line $DZ$, then prove that line $ZC$ is perpendicular on line $EC$.

For given positive integers $r, v, n$ let $S(r, v, n)$ denote the number of $n$-tuples of non-negative integers $(x_1, \cdots, x_n)$ satisfying the equation $x_1 +\cdots+ x_n = r$ and such that $x_i \leq v$ for $i = 1, \cdots , n$. Prove that \[S(r, v, n)=\sum_{k=0}^{m} (-1)^k \binom nk \binom{r - (v + 1)k + n - 1}{n-1}\] Where $m=\left\{n,\left[\frac{r}{v+1}\right]\right\}.$

Determine all integers $n\geqslant 2$ with the following property: every $n$ pairwise distinct integers whose sum is not divisible by $n$ can be arranged in some order $a_1,a_2,\ldots, a_n$ so that $n$ divides $1\cdot a_1+2\cdot a_2+\cdots+n\cdot a_n.$ [i]Arsenii Nikolaiev, Anton Trygub, Oleksii Masalitin, and Fedir Yudin[/i]

Let $x_1,x_2,x_3,y_1,y_2,y_3$ be nonzero real numbers satisfying $x_1+x_2+x_3=0, y_1+y_2+y_3=0$. Prove that \[\frac{x_1x_2+y_1y_2}{\sqrt{(x_1^2+y_1^2)(x_2^2+y_2^2)}}+\frac{x_2x_3+y_2y_3}{\sqrt{(x_2^2+y_2^2)(x_3^2+y_3^2)}}+\frac{x_3x_1+y_3y_1}{\sqrt{(x_3^2+y_3^2)(x_1^2+y_1^2)}} \ge -\frac32.\] [i]Ray Li, Max Schindler.[/i]

Let $ m,n$ be two natural nonzero numbers and sets $ A \equal{} \{ 1,2,...,n\}, B \equal{} \{1,2,...,m\}$. We say that subset $ S$ of Cartesian product $ A \times B$ has property $ (j)$ if $ (a \minus{} x)(b \minus{} y)\le 0$ for each pairs $ (a,b),(x,y) \in S$. Prove that every set $ S$ with propery $ (j)$ has at most $ m \plus{} n \minus{} 1$ elements. [color=#FF0000]The statement was edited, in order to reflect the actual problem asked. The sign of the inequality was inadvertently reversed into $ (a \minus{} x)(b \minus{} y)\ge 0$, and that accounts for the following two posts.[/color]

Two circles $\omega_1$ and $\omega_2$ intersect at points $A$ and $B$. A line passing through point $B$ intersects $\omega_1$ for the second time at point $C$ and $\omega_2$ at point $D$. The line $AC$ intersects circle $\omega_2$ for the second time at point $F$, and the line $AD$ intersects the circle $\omega_1$ for the second time at point $E$ . Let point $O$ be the center of the circle circumscribed around $\vartriangle AEF$. Prove that $OB \perp CD$.

Determine all integer solutions of the system \[2uv-xy=16,\] \[xv-yu=12.\]