This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 85335

Let $ a$, $ b$ and $ c$ be the lengths of the sides of a triangle. Prove that \[ a^{2}b(a \minus{} b) \plus{} b^{2}c(b \minus{} c) \plus{} c^{2}a(c \minus{} a)\ge 0. \] Determine when equality occurs.
[b]p1.[/b] Find the unknown angle $a$ of the triangle inscribed in the square. [img]https://cdn.artofproblemsolving.com/attachments/b/1/4aab5079dea41637f2fa22851984f886f034df.png[/img] [b]p2.[/b] Draw a polygon in the plane and a point outside of it with the following property: no edge of the polygon is completely visible from that point (in other words, the view is obstructed by some other edge). [b]p3.[/b] This problem has two parts. In each part, $2022$ real numbers are given, with some additional property. (a) Suppose that the sum of any three of the given numbers is an integer. Show that the total sum of the $2022$ numbers is also an integer. (b) Suppose that the sum of any five of the given numbers is an integer. Show that 5 times the total sum of the $2022$ numbers is also an integer, but the sum itself is not necessarily an integer. [b]p4.[/b] Replace stars with digits so that the long multiplication in the example below is correct. [img]https://cdn.artofproblemsolving.com/attachments/9/7/229315886b5f122dc0675f6d578624e83fc4e0.png[/img] [b]p5.[/b] Five nodes of a square grid paper are marked (called marked points). Show that there are at least two marked points such that the middle point of the interval connecting them is also a node of the square grid paper [b]p6.[/b] Solve the system $$\begin{cases} \dfrac{xy}{x+y}=\dfrac{8}{3} \\ \dfrac{yz}{y+z}=\dfrac{12}{5} \\\dfrac{xz}{x+z}=\dfrac{24}{7} \end{cases}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Consider $A = \{1, 2, ..., 16\}$. A partition of $A$ into nonempty sets $A_1, A_2,..., A_n$ is said to be good if none of the Ai contains elements $a, b, c$ (not necessarily distinct) such that $a = b + c$. (a) Find a good partition $\{A_1, A_2, A_3, A_4\}$ of $A$. (b) Prove that no partition $\{A_1, A_2, A_3\}$ of $A$ is good
Triangle $ABC$ is inscribed in a circle with center $O$. Let $D$ and $E$ be points on the respective sides $AB$ and $AC$ so that $DE$ is perpendicular to $AO$. Show that the four points $B,D,E$ and $C$ lie on a circle.
Ana and Bogdan play the following turn based game: Ana starts with a pile of $n$ ($n \ge 3$) stones. At his turn each player has to split one pile. The winner is the player who can make at his turn all the piles to have at most two stones. Depending on $n$, determine which player has a winning strategy.
The incircle of the triangle $ABC$ is tangent to sides $AC$ and $BC$ at $M$ and $N$, respectively. The bisectors of the angles at $A$ and $B$ intersect $MN$ at points $P$ and $Q$, respectively. Let $O$ be the incentre of $\triangle ABC$. Prove that $MP\cdot OA=BC\cdot OQ$.
If $x=14$ and $y=6$, then compute $\tfrac{x^2-y^2}{x-y}$.
Zang is at the point $(3,3)$ in the coordinate plane. Every second, he can move one unit up or one unit right, but he may never visit points where the $x$ and $y$ coordinates are both composite. In how many ways can he reach the point $(20, 13)$? [i]Based on a proposal by Ahaan Rungta[/i]
Let $ k$ and $ n$ be integers with $ 0\le k\le n \minus{} 2$. Consider a set $ L$ of $ n$ lines in the plane such that no two of them are parallel and no three have a common point. Denote by $ I$ the set of intersections of lines in $ L$. Let $ O$ be a point in the plane not lying on any line of $ L$. A point $ X\in I$ is colored red if the open line segment $ OX$ intersects at most $ k$ lines in $ L$. Prove that $ I$ contains at least $ \dfrac{1}{2}(k \plus{} 1)(k \plus{} 2)$ red points. [i]Proposed by Gerhard Woeginger, Netherlands[/i]
Let $(a_1,a_2,a_3,...,a_{2011})$ be a permutation of the numbers $1,2,3,...,2011$. Show that there exist two numbers $j,k$ such that $1\leq{j}<k\leq2011$ and $|a_j-j|=|a_k-k|$
A triangle $\Delta$ with sidelengths $a\leq b\leq c$ is given. It appears that it is impossible to construct a triangle from three segments whose lengths are equal to the altitudes of $\Delta$. Prove that $b^2>ac$.
Given that $\tbinom{n}{k}=\tfrac{n!}{k!(n-k)!}$, the value of $$\sum_{n=3}^{10}\frac{\binom{n}{2}}{\binom{n}{3}\binom{n+1}{3}}$$ can be written in the form $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $m+n$.
$ABCDEF$ is a hexagon inscribed in a circle such that the measure of $\angle{ACE}$ is $90^{\circ}$. What is the average of the measures, in degrees, of $\angle{ABC}$ and $\angle{CDE}$? [i]2018 CCA Math Bonanza Lightning Round #1.3[/i]
A [i]lattice point[/i] in the plane is a point with integral coordinates. The[i] centroid[/i] of four points $(x_i,y_i )$, $i = 1, 2, 3, 4$, is the point $\left(\frac{x_1 +x_2 +x_3 +x_4}{4},\frac{y_1 +y_2 +y_3 +y_4 }{4}\right)$. Let $n$ be the largest natural number for which there are $n$ distinct lattice points in the plane such that the centroid of any four of them is not a lattice point. Prove that $n = 12$.
Determine all pairs of positive integers $(x, y)$ such that: $$x^4 - 6x^2 + 1 = 7\cdot 2^y$$
Are the following statements true? $x^7 \in Q \land x^{12} \in Q \Rightarrow x \in Q$, and $x^9 \in \land x^{12} \in Q \Rightarrow x \in Q$.
It is known that each of the equations $x^2 + ax + b = 0$ and $x^2 + bx + a = 0$ has two different roots and these four roots form an arithmetic progression in some order. Find $a$ and $b$.
An $n$-sided regular polygon with side length $1$ is rotated by $\frac{180^o}{n}$ about its center. The intersection points of the original polygon and the rotated polygon are the vertices of a $2n$-sided regular polygon with side length $\frac{1-tan^2 10^o}{2}$. What is the value of $n$?
At a certain grocery store, cookies may be bought in boxes of $10$ or $21.$ What is the minimum positive number of cookies that must be bought so that the cookies may be split evenly among $13$ people? [i]Author: Ray Li[/i]
We have $2^m$ sheets of paper, with the number $1$ written on each of them. We perform the following operation. In every step we choose two distinct sheets; if the numbers on the two sheets are $a$ and $b$, then we erase these numbers and write the number $a + b$ on both sheets. Prove that after $m2^{m -1}$ steps, the sum of the numbers on all the sheets is at least $4^m$ . [i]Proposed by Abbas Mehrabian, Iran[/i]
If $a_k>0~(k=1,2,\ldots,n)$ then prove that $$\sum_{\text{cyc}}\left(\frac{(a_1+a_2+\ldots+a_{n-1})^2}{a_n}+\frac{a_n^2}{a_1}\right)\ge\frac{n^2}2\sum_{k=1}^na_k$$ [i]Proposed by Mihály Bencze[/i]
Given a matrix $\{a_{ij}\}_{i,j=0}^{9}$, $a_{ij}=10i+j+1$. Andrei is going to cover its entries by $50$ rectangles $1\times 2$ (each such rectangle contains two adjacent entries) so that the sum of $50$ products in these rectangles is minimal possible. Help him. [i]A. Badzyan[/i]
Let $ABC$ be a triangle and $P$ an exterior point in the plane of the triangle. Suppose the lines $AP$, $BP$, $CP$ meet the sides $BC$, $CA$, $AB$ (or extensions thereof) in $D$, $E$, $F$, respectively. Suppose further that the areas of triangles $PBD$, $PCE$, $PAF$ are all equal. Prove that each of these areas is equal to the area of triangle $ABC$ itself.
Line $\ell$ in the coordinate plane has the equation $3x - 5y + 40 = 0$. This line is rotated $45^{\circ}$ counterclockwise about the point $(20, 20)$ to obtain line $k$. What is the $x$-coordinate of the $x$-intercept of line $k?$ $\textbf{(A) } 10 \qquad \textbf{(B) } 15 \qquad \textbf{(C) } 20 \qquad \textbf{(D) } 25 \qquad \textbf{(E) } 30$
Two players, A and B, play the following game: they retire coins of a pile which contains initially 2006 coins. The players play removing alternatingly, in each move, from 1 to 7 coins, each player keeps the coins that retires. If a player wishes he can pass(he doesn't retire any coin), but to do that he must pay 7 coins from the ones he retired from the pile in past moves. These 7 coins are taken to a separated box and don't interfere in the game any more. The winner is the one who retires the last coin, and A starts the game. Determine which player can win for sure, it doesn't matter how the other one plays. Show the winning strategy and explain why it works.