Found problems: 85335
Consider the parabola consisting of the points $(x, y)$ in the real plane satisfying
$$(y + x) = (y - x)^2 + 3(y - x) + 3.$$
Find the minimum possible value of $y$.
[i]Biribol[/i] is a game played between two teams of 4 people each (teams are not fixed). Find all the possible values of $ n$ for which it is possible to arrange a tournament with $ n$ players in such a way that every couple of people plays a match in opposite teams exactly once.
[u]Round 1[/u]
[b]p1.[/b] What is the smallest number equal to its cube?
[b]p2.[/b] Fhomas has $5$ red spaghetti and $5$ blue spaghetti, where spaghetti are indistinguishable except for color. In how many different ways can Fhomas eat $6$ spaghetti, one after the other? (Two ways are considered the same if the sequence of colors are identical)
[b]p3.[/b] Jocelyn labels the three corners of a triangle with three consecutive natural numbers. She then labels each edge with the sum of the two numbers on the vertices it touches, and labels the center with the sum of all three edges. If the total sum of all labels on her triangle is $120$, what is the value of the smallest label?
[u]Round 2[/u]
[b]p4.[/b] Adam cooks a pie in the shape of a regular hexagon with side length $12$, and wants to cut it into right triangular pieces with angles $30^o$, $60^o$, and $90^o$, each with shortest side $3$. What is the maximum number of such pieces he can make?
[b]p5.[/b] If $f(x) =\frac{1}{2-x}$ and $g(x) = 1-\frac{1}{x}$ , what is the value of $f(g(f(g(... f(g(f(2019))) ...))))$, where there are $2019$ functions total, counting both $f$ and $g$?
[b]p6.[/b] Fhomas is buying spaghetti again, which is only sold in two types of boxes: a $200$ gram box and a $500$ gram box, each with a fixed price. If Fhomas wants to buy exactly $800$ grams, he must spend $\$8:80$, but if he wants to buy exactly 900 grams, he only needs to spend $\$7:90$! In dollars, how much more does the $500$ gram box cost than the $200$ gram box?
[u]Round 3[/u]
[b]p7.[/b] Given that $$\begin{cases} a + 5b + 9c = 1 \\ 4a + 2b + 3c = 2 \\ 7a + 8b + 6c = 9\end{cases}$$ what is $741a + 825b + 639c$?
[b]p8.[/b] Hexagon $JAMESU$ has line of symmetry $MU$ (i.e., quadrilaterals $JAMU$ and $SEMU$ are reflections of each other), and $JA = AM = ME = ES = 1$. If all angles of $JAMESU$ are $135$ degrees except for right angles at $A$ and $E$, find the length of side $US$.
[b]p9.[/b] Max is parked at the $11$ mile mark on a highway, when his pet cheetah, Min, leaps out of the car and starts running up the highway at its maximum speed. At the same time, Max starts his car and starts driving down the highway at $\frac12$ his maximum speed, driving all the way to the $10$ mile mark before realizing that his cheetah is gone! Max then immediately reverses directions and starts driving back up the highway at his maximum speed, nally catching up to Min at the $20$ mile mark. What is the ratio between Max's max speed and Min's max speed?
[u]Round 4[/u]
[b]p10.[/b] Kevin owns three non-adjacent square plots of land, each with side length an integer number of meters, whose total area is $2019$ m$^2$. What is the minimum sum of the perimeters of his three plots, in meters?
[b]p11.[/b] Given a $5\times 5$ array of lattice points, how many squares are there with vertices all lying on these points?
[b]p12.[/b] Let right triangle $ABC$ have $\angle A = 90^o$, $AB = 6$, and $AC = 8$. Let points $D,E$ be on side $AC$ such that $AD = EC = 2$, and let points $F,G$ be on side $BC$ such that $BF = FG = 3$. Find the area of quadrilateral $FGED$.
PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2949413p26408203]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Show that no integer of the form $ xyxy$ in base $ 10$ can be a perfect cube. Find the smallest base $ b>1$ for which there is a perfect cube of the form $ xyxy$ in base $ b$.
Alex, Bob, and Chris are driving cars down a road at distinct constant rates. All people are driving a positive integer number of miles per hour. All of their cars are $15$ feet long. It takes Alex $1$ second longer to completely pass Chris than it takes Bob to completely pass Chris. The passing time is defined as the time where their cars overlap. Find the smallest possible sum of their speeds, in miles per hour.
[i]Proposed by Sammy Charney[/i]
Find all real numbers$p, q$ for which the polynomial equation $P(x) = x^4 - \frac{8p^2}{q}x^3 + 4qx^2 - 3px + p^2 = 0$ has four positive roots.
Each of six fruit baskets contains pears, plums and apples. The number of plums in each basket equals the total number of apples in all other baskets combined while the number of apples in each basket equals the total number of pears in all other baskets combined. Prove that the total number of fruits is a multiple of $31$.
If $z\in\mathbb{C}$ is a solution of the equation $$x^n+a_1x^{n-1}+a_2x^{n-2}+\ldots+a_n=0$$ with real coefficients $0<a_n\leq a_{n-1}\leq\ldots\leq a_1<1$, show that $|z|<1$.
A cube is constructed from $4$ white unit cubes and $4$ black unit cubes. How many different ways are there to construct the $2 \times 2 \times 2$ cube using these smaller cubes? (Two constructions are considered the same if one can be rotated to match the other.)
$\textbf{(A)}\ 7 \qquad\textbf{(B)}\ 8 \qquad\textbf{(C)}\ 9 \qquad\textbf{(D)}\
10 \qquad\textbf{(E)}\ 11$
On a table lie $289$ coins that form a square array $17 \times 17$. All coins are facing with the crown up. In one move, it is possible to reverse any five coins lying in a row: vertical, horizontal or diagonal. Is it possible that after a number of such moves, all the coins to be arranged with tails up?
When a fair six-sided dice is tossed on a table top, the bottom face cannot be seen. What is the probability that the product of the $5$ faces than can be seen is divisible by $6$?
$\textbf{(A)}\ 1/3 \qquad
\textbf{(B)}\ 1/2 \qquad
\textbf{(C)}\ 2/3 \qquad
\textbf{(D)}\ 5/6 \qquad
\textbf{(E)}\ 1$
Let $\{a_0,a_1,\ldots\}$ and $\{b_0,b_1,\ldots\}$ be two infinite sequences of integers such that
\[(a_{n}-a_{n-1})(a_n-a_{n-2}) +(b_n-b_{n-1})(b_n-b_{n-2})=0\]
for all integers $n\geq 2$. Prove that there exists a positive integer $k$ such that
\[a_{k+2011}=a_{k+2011^{2011}}.\]
In the country of Postonia, one wants to have only two values of stamps. These values should be integers greater than $1$ with the difference $2$, and should have the property that one can combine the stamps for any postage which is greater than or equal to the sum of these two values. What values can be chosen?
Let $ABCD$ a cyclique quadrilateral. We consider the Following points: $A'$ the orthogonal projection of $A$ over $(BD)$, $B'$ the orthogonal projection of $B$ over $(AC)$, $C'$ the orthgonal projection of $C$ over $(BD)$ and $D'$ being the orthogonal projection of $D$ over $(AC)$
Prove that $A', B', C'$ and $D'$.
A lightbulb is given that emits red, green or blue light and an infinite set $S$ of switches, each with three positions labeled red, green and blue. We know the following:
[list=1]
[*]For every combination of the switches the lighbulb emits a given color.
[*]If all switches are in a position with a given color, the lightbulb emits the same color.
[*]If there are two combinations of the switches where each switch is in a different position, the lightbulb emits a different color for the two combinations.
[/list]
We create the following set $U$ containing some of the subsets of $S$: for each combination of the switches let us observe the color of the lightbulb, and put the set of those switches in $U$ which are in the same position as the color of the lightbulb.
Prove that $U$ is an ultrafilter on $S$. In other words, prove that $U$ satisfies the following conditions:
[list=1]
[*]The empty set is not in $U.$
[*]If two sets are in $U,$ their intersection is also in $U.$
[*]If a set is in $U,$ every subset of $S$ containing it is also in $U.$
[*]Considering a set and its complement in $S,$ exactly one of these sets is contained in $U.$
[/list]
Find the number of ordered triples of positive integers $\left(a,b,c\right)$ such that $a\times b\times c=2008^2$.
For two base-10 positive integers $a$ and $b$, we say $a \sim b$ if we can rearrange the digits of $a$ in some way to obtain $b$, where the leading digit of both $a$ and $b$ is nonzero. For instance, $463 \sim 463$ and $634 \sim 463$. Find the number of $11$-digit positive integers $K$ such that $K$ is divisible by $2$, $3$, and $5$, and there is some positive integer $K'$ such that $K' \sim K$ and $K'$ is divisible by $7$, $11$, $13$, $17$, $101$, and $9901$.
Let $P, Q,R$ be three polynomials with real coefficients such that \[P(Q(x)) + P(R(x))=\text{constant}\] for all $x$. Prove that $P(x)=\text{constant}$ or $Q(x)+R(x)=\text{constant}$ for all $x$.
Positive reals $a$, $b$, and $c$ obey $\frac{a^2+b^2+c^2}{ab+bc+ca} = \frac{ab+bc+ca+1}{2}$. Prove that \[ \sqrt{a^2+b^2+c^2} \le 1 + \frac{\lvert a-b \rvert + \lvert b-c \rvert + \lvert c-a \rvert}{2}. \][i]Proposed by Evan Chen[/i]
Let $P$ be a point inside triangle $ABC$ such that $\angle CPA = 90^o$ and $\angle CBP = \angle CAP$. Prove that $\angle P XY = 90^o$, where $X$ and $Y$ are the midpoints of $AB$ and $AC$ respectively.
Let $k$ be a positive integer such that $1 +\frac12+\frac13+ ... +\frac{1}{13}=\frac{k}{13!}$. Find the remainder when $k$ is divided by $7$.
Let $ f:\mathbb{R}\longrightarrow\mathbb{R} $ be a function with the property that $ (f\circ f) (x) =[x], $ for any real number $ x. $ Show that there exist two distinct real numbers $ a,b $ so that $ |f(a)-f(b)|\ge |a-b|. $
$ [] $ denotes the integer part.
Find all primes $p$ and $q$ such that $p$ divides $q^2-4$ and $q$ divides $p^2-1$.
Let $A$ be the set of all binary sequences of length $n$ and denote $o =(0, 0, \ldots , 0) \in A$. Define the addition on $A$ as $(a_1, \ldots , a_n)+(b_1, \ldots , b_n) =(c_1, \ldots , c_n)$, where $c_i = 0$ when $a_i = b_i$ and $c_i = 1$ otherwise. Suppose that $f\colon A \to A$ is a function such that $f(0) = 0$, and for each $a, b \in A$, the sequences $f(a)$ and $f(b)$ differ in exactly as many places as $a$ and $b$ do. Prove that if $a$ , $b$, $c \in A$ satisfy $a+ b + c = 0$, then $f(a)+ f(b) + f(c) = 0$.
Two players, $B$ and $R$, play the following game on an infinite grid of unit squares, all initially colored white. The players take turns starting with $B$. On $B$'s turn, $B$ selects one white unit square and colors it blue. On $R$'s turn, $R$ selects two white unit squares and colors them red. The players alternate until $B$ decides to end the game. At this point, $B$ gets a score, given by the number of unit squares in the largest (in terms of area) simple polygon containing only blue unit squares. What is the largest score $B$ can guarantee?
(A [i]simple polygon[/i] is a polygon (not necessarily convex) that does not intersect itself and has no holes.)
[i]Proposed by David Torres[/i]