Denote by $S(a,b,c)$ the area of a triangle whose lengthes of three sides are $a,b,c$ Prove that for any positive real numbers $a_{1},b_{1},c_{1}$ and $a_{2},b_{2},c_{2}$ which can serve as the lengthes of three sides of two triangles respectively ,we have $ \sqrt{S(a_{1},b_{1},c_{1})}+\sqrt{S(a_{2},b_{2},c_{2})}\le\sqrt{S(a_{1}+a_{2},b_{1}+b_{2},c_{1}+c_{2})}$

Let $k, m, n$ be integers such that $1<n\le m-1 \le k$. Determine the maximum size of a subset $S$ of the set $\{ 1,2, \cdots, k \}$ such that no $n$ distinct elements of $S$ add up to $m$.

A quadrilateral $ABCD$ is circumscribed about a circle $\omega$. The lines $AB$ and $CD$ meet at $O$. A circle $\omega_1$ is tangent to side $BC$ at $K$ and to the extensions of sides $AB$ and $CD$, and a circle $\omega_2$ is tangent to side $AD$ at $L$ and to the extensions of sides $AB$ and $CD$. Suppose that points $O$, $K$, $L$ lie on a line. Prove that the midpoints of $BC$ and $AD$ and the center of $\omega$ also lie on a line.

Let $n \geq 3$ be an integer, and consider a set of $n$ points in three-dimensional space such that: [list=i] [*] every two distinct points are connected by a string which is either red, green, blue, or yellow; [*] for every three distinct points, if the three strings between them are not all of the same colour, then they are of three different colours; [*] not all the strings have the same colour. [/list] Find the maximum possible value of $n$.

Let $ABC$ be a triangle with $AB<AC$ and with its incircle touching the sides $AB$ and $BC$ at $M$ and $J$ respectively. A point $D$ lies on the extension of $AB$ beyond $B$ such that $AD=AC$. Let $O$ be the midpoint of $CD$. Prove that the points $J$, $O$, $M$ are collinear. [i](Proposed by Tan Rui Xuen)[/i]

Circles ${{w} _ {1}}$ and ${{w} _ {2}}$ with centers ${{O} _ {1}}$ and ${{O} _ {2}}$ intersect at points $A$ and $B$, respectively. The line ${{O} _ {1}} {{O} _ {2}}$ intersects ${{w} _ {1}}$ at the point $Q$, which does not lie inside the circle ${{w} _ {2}}$, and ${{w} _ {2}}$ at the point $X$ lying inside the circle ${{w} _ {1} }$. Around the triangle ${{O} _ {1}} AX$ circumscribe a circle ${{w} _ {3}}$ intersecting the circle ${{w} _ {1}}$ for the second time in point $T$. The line $QT$ intersects the circle ${{w} _ {3}}$ at the point $K$, and the line $QB$ intersects ${{w} _ {2}}$ the second time at the point $H$. Prove that a) points $T, \, \, X, \, \, B$ lie on one line; b) points $K, \, \, X, \, \, H$ lie on one line. (Vadym Mitrofanov)

Let $P$ be a set of people. For two people $A$ and $B$, if $A$ knows $B$, $B$ also knows $A$. Each person in $P$ knows $2$ or less people in the set. $S$, a subset of $P$ with $k$ people, is called [i][b]k-independent set[/b][/i] of $P$ if any two people in $S$ don’t know each other. $X_1, X_2, …, X_{4041}$ are [i][b]2021-independent set[/b][/i]s of $P$ (not necessarily distinct). Show that there exists a [i][b]2021-independent set[/b][/i] of $P$, $\{v_1, v_2, …, v_{2021}\}$, which satisfies the following condition: [center] For some integer $1 \le i_1 < i_2 < \cdots < i_{2021} \leq 4041$, $v_1 \in X_{i_1}, v_2 \in X_{i_2}, \ldots, v_{2021} \in X_{i_{2021}}$ [/center] [hide=Graph Wording] Thanks to Evan Chen, here's a graph wording of the problem :) Let $G$ be a finite simple graph with maximum degree at most $2$. Let $X_1, X_2, \ldots, X_{4041}$ be independent sets of size $2021$ [i](not necessarily distinct)[/i]. Prove that there exists another independent set $\{v_1, v_2, \ldots, v_{2021}\}$ of size $2021$ and indices $1 \le t_1 < t_2 < \cdots < t_{2021} \le 4041$ such that $v_i \in X_{t_i}$ for all $i$. [/hide]

Let the vertex set \( V \) of a graph be partitioned into \( h \) parts \( (V = V_1 \cup V_2 \cup \cdots \cup V_h) \), with \(|V_1| = n_1, |V_2| = n_2, \ldots, |V_h| = n_h \). If there is an edge between any two vertices only when they belong to different parts, the graph is called a complete \( h \)-partite graph, denoted as \( k(n_1, n_2, \ldots, n_h) \). Let \( n \) and \( r \) be positive integers, \( n \geq 6 \), \( r \leq \frac{2}{3}n \). Consider the complete \( r + 1 \)-partite graph \( k\left(\underbrace{1, 1, \ldots, 1}_{r}, n - r\right) \). Answer the following questions: 1. Find the maximum number of disjoint circles (i.e., circles with no common vertices) in this complete \( r + 1 \)-partite graph. 2. Given \( n \), for all \( r \leq \frac{2}{3}n \), find the maximum number of edges in a complete \( r + 1 \)-partite graph \( k(1, 1, \ldots, 1, n - r) \) where no more than one circle is disjoint.

$ABC$ is acute-angled triangle, $AA_1,CC_1$ are altitudes. $M$ is centroid. $M$ lies on circumcircle of $A_1BC_1$. Find all values of $\angle B$

Let $ P$ be any point in the interior of a $ \triangle ABC$.Prove That $ \frac{PA}{a}\plus{}\frac{PB}{b}\plus{}\frac{PC}{c}\ge \sqrt{3}$.

Find all functions $f:\mathbb{N}\to\mathbb{N}$ such that \[f(f(n))=n+2015\] where $n\in \mathbb{N}.$

Harold, Tanya, and Ulysses paint a very long picket fence. Harold starts with the first picket and paints every $h$th picket; Tanya starts with the second picket and paints everth $t$th picket; and Ulysses starts with the third picket and paints every $u$th picket. Call the positive integer $100h+10t+u$ $\textit{paintable}$ when the triple $(h,t,u)$ of positive integers results in every picket being painted exaclty once. Find the sum of all the paintable integers.

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

Tireless Thomas and Jeremy construct a sequence. At the beginning there is one positive integer in the sequence. Then they successively write new numbers in the sequence in the following way: Thomas obtains the next number by adding to the previous number one of its (decimal) digits, while Jeremy obtains the next number by subtracting from the previous number one of its digits. Prove that there is a number in this sequence which will be repeated at least $100$ times. (A Shapovalov)

The points $A$ and $B$ lie on a horizontal line over a vertical plane. We consider the semicircumference passing through $A$ and $B$ that lies under the horizontal line. A segment of length $a$, with the same diameter that the semicircumference, moves in a way that always contains the point $A$ and one of its extremes lies always on the semicircumference. Determine the value of the cosine of the angle between this segment and the horizontal line that makes the medium point of the segment to be as down as possible.

For positive integers $a, b, c$ (not necessarily distinct), suppose that $a+bc, b+ac, c+ab$ are all perfect squares. Show that $$a^2(b+c)+b^2(a+c)+c^2(a+b)+2abc$$ can be written as sum of two squares.

If the pattern in the diagram continues, what fraction of the interior would be shaded in the eighth triangle? [asy] unitsize(5); draw((0,0)--(12,0)--(6,6sqrt(3))--cycle); draw((15,0)--(27,0)--(21,6sqrt(3))--cycle); fill((21,0)--(18,3sqrt(3))--(24,3sqrt(3))--cycle,black); draw((30,0)--(42,0)--(36,6sqrt(3))--cycle); fill((34,0)--(32,2sqrt(3))--(36,2sqrt(3))--cycle,black); fill((38,0)--(36,2sqrt(3))--(40,2sqrt(3))--cycle,black); fill((36,2sqrt(3))--(34,4sqrt(3))--(38,4sqrt(3))--cycle,black); draw((45,0)--(57,0)--(51,6sqrt(3))--cycle); fill((48,0)--(46.5,1.5sqrt(3))--(49.5,1.5sqrt(3))--cycle,black); fill((51,0)--(49.5,1.5sqrt(3))--(52.5,1.5sqrt(3))--cycle,black); fill((54,0)--(52.5,1.5sqrt(3))--(55.5,1.5sqrt(3))--cycle,black); fill((49.5,1.5sqrt(3))--(48,3sqrt(3))--(51,3sqrt(3))--cycle,black); fill((52.5,1.5sqrt(3))--(51,3sqrt(3))--(54,3sqrt(3))--cycle,black); fill((51,3sqrt(3))--(49.5,4.5sqrt(3))--(52.5,4.5sqrt(3))--cycle,black); [/asy] $\text{(A)}\ \dfrac{3}{8} \qquad \text{(B)}\ \dfrac{5}{27} \qquad \text{(C)}\ \dfrac{7}{16} \qquad \text{(D)}\ \dfrac{9}{16} \qquad \text{(E)}\ \dfrac{11}{45}$

Let $x_1=1/20$, $x_2=1/13$, and \[x_{n+2}=\dfrac{2x_nx_{n+1}(x_n+x_{n+1})}{x_n^2+x_{n+1}^2}\] for all integers $n\geq 1$. Evaluate $\textstyle\sum_{n=1}^\infty(1/(x_n+x_{n+1}))$.

What is the largest positive integer $n < 1000$ for which there is a positive integer $m$ satisfying \[\text{lcm}(m,n) = 3m \times \gcd(m,n)?\]

Let $ ABCDA'B'C'D'$ be a cube. On the sides $ (A'D')$, $ (A'B')$ and $ (A'A)$ we consider the points $ M_1$, $ N_1$ and $ P_1$ respectively. On the sides $ (CB)$, $ (CD)$ and $ (CC')$ we consider the points $ M_2$, $ N_2$ and $ P_2$ respectively. Let $ d_1$ be the distance between the lines $ M_1N_1$ and $ M_2N_2$, $ d_2$ be the distance between the lines $ N_1P_1$ and $ N_2P_2$, and $ d_3$ be the distance between the lines $ P_1M_1$ and $ P_2M_2$. Suppose that the distances $ d_1$, $ d_2$ and $ d_3$ are pairwise distinct. Prove that the lines $ M_1M_2$, $ N_1N_2$ and $ P_1P_2$ are concurrent.

Prove that, if the terms of an infinite arithmetic progression of natural numbers are not all equal, they cannot all be primes.

Prove among any $14$ consecutive positive integers there exist $6$ which are pairwise relatively prime.

[b]p1.[/b] A Slavic dragon has three heads. A knight fights the dragon. If the knight cuts off one dragon’s head three new heads immediately grow. Is it possible that the dragon has $2018$ heads at some moment of the fight? [b]p2.[/b] Peter has two squares $3\times 3$ and $4\times 4$. He must cut one of them or both of them in no more than four parts in total. Is Peter able to assemble a square using all these parts? [b]p3.[/b] Usually, dad picks up Constantine after his music lessons and they drive home. However, today the lessons have ended earlier and Constantine started walking home. He met his dad $14$ minutes later and they drove home together. They arrived home $6$ minutes earlier than usually. Home many minutes earlier than usual have the lessons ended? Please, explain your answer. [b]p4.[/b] All positive integers from $1$ to $2018$ are written on a blackboard. First, Peter erased all numbers divisible by $7$. Then, Natalie erased all remaining numbers divisible by $11$. How many numbers did Natalie remove? Please, explain your answer. [b]p5.[/b] $30$ students took part in a mathematical competition consisting of four problems. $25$ students solved the first problem, $24$ students solved the second problem, $22$ students solved the third, and, finally, $21$ students solved the fourth. Show that there are at least two students who solved all four problems. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In how many ways can $9$ cells of a $\text{6-by-6}$ grid be painted black such that no two black cells share a corner or an edge with each other?

Let $n \ge 50 $ be a natural number. Prove that $n$ is expressible as sum of two natural numbers $n=x+y$, so that for every prime number $p$ such that $ p\mid x$ or $p\mid y $ we have $ \sqrt{n} \ge p $. For example for $n=94$ we have $x=80, y=14$.