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

A convex $N\text{-gon}$ is divided by diagonals into triangles so that no two diagonals intersect inside the polygon. The triangles are painted in black and white so that any two triangles are painted in black and white so that any two triangles with a common side are painted in different colors. For each $N$ find the maximal difference between the numbers of black and white triangles.
Let $n > 3$ be a positive integer. Suppose that $n$ children are arranged in a circle, and $n$ coins are distributed between them (some children may have no coins). At every step, a child with at least 2 coins may give 1 coin to each of their immediate neighbors on the right and left. Determine all initial distributions of the coins from which it is possible that, after a finite number of steps, each child has exactly one coin.
Let $P$ be a set of nine points in the Cartesian coordinate plane, no three of which lie on the same line. Call an ordering $\{Q_1, Q_2, \ldots, Q_9\}$ of the points in $P$ [i]special[/i] if there exists a point $C$ in the same plane such that $CQ_1 < CQ_2 < \cdots < CQ_9$. Over all possible sets $P,$ what is the largest possible number of distinct special orderings of $P?$
There are 100 apples on the table with total weight of 10 kg. Each apple weighs no less than 25 grams. The apples need to be cut for 100 children so that each of the children gets 100 grams. Prove that you can do it in such a way that each piece weighs no less than 25 grams.
Carl chooses a [i]functional expression[/i]* $E$ which is a finite nonempty string formed from a set $x_1, x_2, \dots$ of variables and applications of a function $f$, together with addition, subtraction, multiplication (but not division), and fixed real constants. He then considers the equation $E = 0$, and lets $S$ denote the set of functions $f \colon \mathbb R \to \mathbb R$ such that the equation holds for any choices of real numbers $x_1, x_2, \dots$. (For example, if Carl chooses the functional equation $$ f(2f(x_1)+x_2) - 2f(x_1)-x_2 = 0, $$ then $S$ consists of one function, the identity function. (a) Let $X$ denote the set of functions with domain $\mathbb R$ and image exactly $\mathbb Z$. Show that Carl can choose his functional equation such that $S$ is nonempty but $S \subseteq X$. (b) Can Carl choose his functional equation such that $|S|=1$ and $S \subseteq X$? *These can be defined formally in the following way: the set of functional expressions is the minimal one (by inclusion) such that (i) any fixed real constant is a functional expression, (ii) for any positive integer $i$, the variable $x_i$ is a functional expression, and (iii) if $V$ and $W$ are functional expressions, then so are $f(V)$, $V+W$, $V-W$, and $V \cdot W$. [i]Proposed by Carl Schildkraut[/i]
Points $ A$ and $ B$ lie on the circle with center $ O.$ Let point $ C$ lies outside the circle; let $ CS$ and $ CT$ be tangents to the circle. $ M$ be the midpoint of minor arc $ AB$ of $ (O).$ $ MS,\,MT$ intersect $ AB$ at points $ E,\,F$ respectively. The lines passing through $ E,\,F$ perpendicular to $ AB$ cut $ OS,\,OT$ at $ X$ and $ Y$ respectively. A line passed through $ C$ intersect the circle $ (O)$ at $ P,\,Q$ ($ P$ lies on segment $ CQ$). Let $ R$ be the intersection of $ MP$ and $ AB,$ and let $ Z$ be the circumcentre of triangle $ PQR.$ Prove that: $ X,\,Y,\,Z$ are collinear.
Let $k>1$. Fix a circle $\omega$ with center $O$ and radius $r$, and fix a point $A$ with $OA=kr$. Let $AB$, $AC$ be tangents to $\omega$. Choose a variable point $P$ on the minor arc $BC$ in $\omega$. Lines $AB$ and $CP$ intersect at $X$ and lines $AC$ and $BP$ intersect at $Y$. The circles $(BPX)$ and $(CPY)$ meet at another point $Z$. Prove that the line $PZ$ always passes through a fixed point except for one value of $k>1$, and determine this value. [i]Proposed by Ivan Chan Kai Chin[/i]
Given is a square $ABCD$ with $E \in BC$, arbitrarily. On $CD$ lies the point $F$ is such that $\angle EAF = 45^o$. Prove that $EF$ is tangent to the circle with center $A$ and radius $AB$.
Find four distinct positive integers, $a$, $b$, $c$, and $d$, such that each of the four sums $a+b+c$, $a+b+d$,$a+c+d$, and $b+c+d$ is the square of an integer. Show that infinitely many quadruples $(a,b,c,d)$ with this property can be created.
Carlos went to a sports store to buy running shoes. Running shoes were on sale, with prices reduced by 20% on every pair of shoes. Carlos also knew that he had to pay a 7.5% sales tax on the discounted price. He had 43 dollars. What is the original (before discount) price of the most expensive shoes he could afford to buy? A)$46$ B)$50$ C)$48$ D)$47$ E)$49$
If there are several heaps of stones on the table, it is said that there are $\textit{many}$ stones on the table, if we can find $50$ piles and number them with the numbers from $1$ to $50$ so that the first pile contains at least one stone, the second - at least two stones,..., the $50$-th has at least $50$ stones. Let the table be initially contain $100$ piles of $100$ stones each. Find the largest $n \leq 10 000$ such that after removing any $n$ stones, there will still be $\textit{many}$ stones left on the table.
A cube is partitioned into finitely many rectangular parallelepipeds with the edges parallel to the edges of the cube. Prove that if the sum of the volumes of the circumspheres of these parallelepipeds equals the volume of the circumscribed sphere of the cube, then all the parallelepipeds are cubes.
Consider triangle $ABC$ with orthocenter $H$. Let points $M$ and $N$ be the midpoints of segments $BC$ and $AH$. Point $D$ lies on line $MH$ so that $AD\parallel BC$ and point $K$ lies on line $AH$ so that $DNMK$ is cyclic. Points $E$ and $F$ lie on lines $AC$ and $AB$ such that $\angle EHM=\angle C$ and $\angle FHM=\angle B$. Prove that points $D,E,F$ and $K$ lie on a circle. [i]Proposed by Alireza Dadgarnia[/i]
Define $A = (1, 0, 0)$, $B = (0, 1, 0)$, and $P$ as the set of all points $(x, y, z)$ such that $x+y+z = 0$. Let $P$ be the point on $P$ such that $d = AP + P B$ is minimized. Find $d^2$.
Let $d(n)$ be the quantity of positive divisors of $n$, for example $d(1)=1,d(2)=2,d(10)=4$. The [b]size[/b] of $n$ is $k$ if $k$ is the least positive integer, such that $d^k(n)=2$. Note that $d^s(n)=d(d^{s-1}(n))$. a) How many numbers in the interval $[3,1000]$ have size $2$ ? b) Determine the greatest size of a number in the interval $[3,1000]$.
Let $w_{1}$ and $w_{2}$ denote the circles $x^{2}+y^{2}+10x-24y-87=0$ and $x^{2}+y^{2}-10x-24y+153=0$, respectively. Let $m$ be the smallest positive value of $a$ for which the line $y=ax$ contains the center of a circle that is externally tangent to $w_{2}$ and internally tangent to $w_{1}$. Given that $m^{2}=p/q$, where $p$ and $q$ are relatively prime integers, find $p+q$.
The random variables $X, Y$ can each take a finite number of integer values. They are not necessarily independent. Express $P(\min(X,Y)=k)$ in terms of $p_1=P(X=k)$, $p_2=P(Y=k)$ and $p_3=P(\max(X,Y)=k)$.
A convex quadrilateral $ABCD$ has an inscribed circle with center $I$. Let $I_a, I_b, I_c$ and $I_d$ be the incenters of the triangles $DAB, ABC, BCD$ and $CDA$, respectively. Suppose that the common external tangents of the circles $AI_bI_d$ and $CI_bI_d$ meet at $X$, and the common external tangents of the circles $BI_aI_c$ and $DI_aI_c$ meet at $Y$. Prove that $\angle{XIY}=90^{\circ}$.
Tom's Hat Shoppe increased all original prices by $25\%$. Now the shoppe is having a sale where all prices are $20\%$ off these increased prices. Which statement best describes the sale price of an item? $ \text{(A)}\ \text{The sale price is }5\%\text{ higher than the original price.} $ $ \text{(B)}\ \text{The sale price is higher than the original price, but by less than }5\% . $ $ \text{(C)}\ \text{The sale price is higher than the original price, but by more than }5\% . $ $ \text{(D)}\ \text{The sale price is lower than the original price.} $ $ \text{(E)}\ \text{The sale price is the same as the original price.} $
Prove that there are infinitely many different triangles in coordinate plane satisfying: 1) their vertices are lattice points 2) their side lengths are consecutive integers [b]Remark[/b]: Triangles that can be obtained by rotation or translation or shifting the coordinate system are considered as equal triangles
Let $n$ be an even positive integer. We say that two different cells of a $n \times n$ board are [b]neighboring[/b] if they have a common side. Find the minimal number of cells on the $n \times n$ board that must be marked so that any cell (marked or not marked) has a marked neighboring cell.
Let $O$ be the center of the regular triangle $ABC$. Find the set of all points $M$ such that any line containing the point $M$ intersects one of the segments $AB, OC$.
Let $x_1$ and $x_2$ be positive integers. On a straight line, $y_1$ white segments and $y_2$ black segments are given, with $y_1 \ge x_1$ and $y_2 \ge x_2$. Suppose that no two segments of the same colour intersect (and do not have common ends). Moreover, suppose that for any choice of $x_1$ white segments and $x_2$ black segments, some pair of selected segments will intersect. Prove that $(y_1-x_1)(y_2-x_2)<x_1x_2$. [i]Proposed by G. Chelnokov[/i]
A polygon is called concave if it has at least one angle strictly greater than $180^{\circ}$. What is the maximum number of symmetries that an 11-sided concave polygon can have? (A [i]symmetry[/i] of a polygon is a way to rotate or reflect the plane that leaves the polygon unchanged.)
Let $S$ denote the set of words $W = w_1w_2\ldots w_n$ of any length $n\ge0$ (including the empty string $\lambda$), with each letter $w_i$ from the set $\{x,y,z\}$. Call two words $U,V$ [i]similar[/i] if we can insert a string $s\in\{xyz,yzx,zxy\}$ of three consecutive letters somewhere in $U$ (possibly at one of the ends) to obtain $V$ or somewhere in $V$ (again, possibly at one of the ends) to obtain $U$, and say a word $W$ is [i]trivial[/i] if for some nonnegative integer $m$, there exists a sequence $W_0,W_1,\ldots,W_m$ such that $W_0=\lambda$ is the empty string, $W_m=W$, and $W_i,W_{i+1}$ are similar for $i=0,1,\ldots,m-1$. Given that for two relatively prime positive integers $p,q$ we have \[\frac{p}{q} = \sum_{n\ge0} f(n)\left(\frac{225}{8192}\right)^n,\]where $f(n)$ denotes the number of trivial words in $S$ of length $3n$ (in particular, $f(0)=1$), find $p+q$. [i]Victor Wang[/i]