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.\]

Let $S$ be the set of all $n$-tuples of real numbers, with the property that among the numbers $x_1,\frac{x_1+x_2}2,\ldots,\frac{x_1+x_2+\ldots+x_n}n$ the least is equal to $0$, and the greatest is equal to $1$. Determine $$\max_{(x_1,x_2,\ldots,x_n)\in S}\max_{1\le i,j\le n}(x_i-x_j)\qquad\text{and}\min_{(x_1,x_2,\ldots,x_n)\in S}\max_{1\le i,j\le n}(x_i-x_j).$$

What is the maximum area of a triangle that can be inscribed in an ellipse with semi-axes $a$ and $b$? $\text{(A) }ab\frac{3\sqrt{3}}{4}\qquad\text{(B) }ab\qquad\text{(C) }ab\sqrt{2}\qquad\text{(D) }\left(a+b\right)\frac{3\sqrt{3}}{4}\qquad\text{(E) }\left(a+b\right)\sqrt{2}$

Let $ ABC$ be a triangle, all of whose angles are greater than $ 45^{\circ}$ and smaller than $ 90^{\circ}$. (a) Prove that one can fit three squares inside $ ABC$ in such a way that: (i) the three squares are equal (ii) the three squares have common vertex $ K$ inside the triangle (iii) any two squares have no common point but $ K$ (iv) each square has two opposite vertices onthe boundary of $ ABC$, while all the other points of the square are inside $ ABC$. (b) Let $ P$ be the center of the square which has $ AB$ as a side and is outside $ ABC$. Let $ r_{C}$ be the line symmetric to $ CK$ with respect to the bisector of $ \angle BCA$. Prove that $ P$ lies on $ r_{C}$.

4 tokens are placed in the plane. If the tokens are now at the vertices of a convex quadrilateral $P$, then the following move could be performed: choose one of the tokens and shift it in the direction perpendicular to the diagonal of $P$ not containing this token; while shifting tokens it is prohibited to get three collinear tokens. Suppose that initially tokens were at the vertices of a rectangle $\Pi$, and after a number of moves tokens were at the vertices of one another rectangle $\Pi'$ such that $\Pi'$ is similar to $\Pi$ but not equal to $\Pi $. Prove that $\Pi$ is a square.

A positive integer $n$ is [i]nice[/i] if there is a positive integer $m$ with exactly four positive divisors (including $1$ and $m$) such that the sum of the four divisors is equal to $n$. How many numers in the set $\{2010, 2011, 2012,\ldots,2019\}$ are nice? ${ \textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D}}\ 4\qquad\textbf{(E)}\ 5 $

Let $ABCD$ be a convex quadrilateral. $AC$ and $BD$ meet at $P$, with $\angle APD=60^{\circ}$. Let $E,F,G$, and $H$ be the midpoints of $AB,BC,CD$ and $DA$ respectively. Find the greatest positive real number $k$ for which \[EG+3HF\ge kd+(1-k)s \] where $s$ is the semi-perimeter of the quadrilateral $ABCD$ and $d$ is the sum of the lengths of its diagonals. When does the equality hold?

Let $m$ be equal to $1$ or $2$ and $n<10799$ be a positive integer. Determine all such $n$ for which $\sum_{k=1}^{n}\frac{1}{\sin{k}\sin{(k+1)}}=m\frac{\sin{n}}{\sin^{2}{1}}$.

Let $a,b \in \mathbb R,f(x)=ax+b+\frac{9}{x}.$ Prove that there exists $x_0 \in \left[1,9 \right],$ such that $|f(x_0)| \ge 2.$

(a) Build a function $f : \mathbb R \to \mathbb R_+$ with the property $\left( \mathcal P \right)$, i.e. all $x \in \mathbb Q$ are local, strict minimum points. (b) Build a function $f : \mathbb Q \to \mathbb R_+$ such that every point is a local, strict minimum point and such that $f$ is unbounded on $I \cap \mathbb Q$, where $I$ is a non-degenerate interval. (c) Let $f: \mathbb R \to \mathbb R_+$ be a function unbounded on every $I \cap \mathbb Q$, where $I$ is a non-degenerate interval. Prove that $f$ doesn't have the property $\left( \mathcal P \right)$.

$M_0 \subset \mathbb{N}$ is a non-empty set with a finite number of elements. Ali produces sets $ M_1,M_2,...,M_n $ in the following order: In step $n$, Ali chooses an element of $M_{n-1} $ like $b_n$ and defines $M_n$ as $$M_n = \left \{ b_nm+1 \vert m\in M_{n-1} \right \}$$ Prove that at some step Ali reaches a set which no element of it divides another element of it.

Given is a parallelogram $XYZT$, and the variable points $A, B, C, D$ lie on the sides $XY, XT, TZ, ZY$ respectively, so that $ABCD$ is cyclic with circumcenter $O$, $AC \parallel XT$, and $BD \parallel XY$. Let $P$ be the intersection point of the lines $AD$ and $BC$, and let $Q$ be the intersection of the lines $AB$ and $CD$. Prove that the circle $(POQ)$ passes through a fixed point.