Found problems: 85335
In a race among 5 snails, there is at most one tie, but that tie can involve any number of snails. For example, the result of the race might be that Dazzler is first; Abby, Cyrus, and Elroy are tied for second, and Bruna is fifth. How many different results of the race are possible?
$
\textbf{(A) }180 \qquad
\textbf{(B) }361 \qquad
\textbf{(C) }420 \qquad
\textbf{(D) }431 \qquad
\textbf{(E) }720 \qquad
$
Find all cubic polynomials $x^3 +ax^2 +bx+c$ admitting the rational numbers $a$, $b$ and $c$ as roots.
Prove that no Fibonacci number can be factored into a product of two smaller Fibonacci numbers, each greater than 1.
When 7 fair standard 6-sided dice are thrown, the probability that the sum of the numbers on the top faces is 10 can be written as $$\frac{n}{6^7},$$where $n$ is a positive integer. What is $n$?
$\textbf{(A) } 42 \qquad \textbf{(B) } 49 \qquad \textbf{(C) } 56 \qquad \textbf{(D) } 63 \qquad \textbf{(E) } 84 $
Given that $4^{x_1} = 5, 5^{x_2} = 6, \dots , 2047^{x_{2044}} = 2048$, compute the product $x_1 \dots x_{2044}$.
You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leq r \leq 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r + 2$.
Let $ABCD$ be an inscribed quadrilateral, in which $\angle BAD<90$. On the rays $AB$ and $AD$ are selected points $K$ and $L$, respectively, such that$ KA = KD, LA = LB$. Let $N$ - the midpoint of $AC$.Prove that if $\angle BNC=\angle DNC $,so $\angle KNL=\angle BCD $
Let $\triangle ABC$ be an acute triangle with incenter $I$ and circumcenter $O$. The incircle touches sides $BC,CA,$ and $AB$ at $D,E,$ and $F$ respectively, and $A'$ is the reflection of $A$ over $O$. The circumcircles of $ABC$ and $A'EF$ meet at $G$, and the circumcircles of $AMG$ and $A'EF$ meet at a point $H\neq G$, where $M$ is the midpoint of $EF$. Prove that if $GH$ and $EF$ meet at $T$, then $DT\perp EF$.
[i]Proposed by Ankit Bisain[/i]
You have an $n \times n$ grid of empty squares. You place a cross in all the squares, one at a time. When you place a cross in an empty square, you receive $i+j$ points if there were $i$ crosses in the same row and $j$ crosses in the same column before you placed the new cross. Which are the possible total scores you can get?
There are $ n \geq 5$ pairwise different points in the plane. For every point, there are just four points whose distance from which is $ 1$. Find the maximum value of $ n$.
Numbers $a, b, c$ are the length of the medians of some triangle. If $ab + bc + ac = 1$ prove that
a) $a^2b + b^2c + c^2a > \frac13$ b) $a^2b + b^2c + c^2a > \frac12$
(I. Bliznets)
Integers a, b, c, d, and e satisfy the following three properties:
(i) $2 \le a < b <c <d <e <100$
(ii)$ \gcd (a,e) = 1 $
(iii) a, b, c, d, e form a geometric sequence.
What is the value of c?
Suppose that there is a point $P$ inside a convex quadrilateral $ABCD$ such that the triangles $PAB$, $PBC$, $PCD$, $PDA$ have equal areas. Prove that one of the diagonals bisects the area of $ABCD$.
Let $S$ be a subset with $673$ elements of the set $\{1,2,\ldots ,2010\}$. Prove that one can find two distinct elements of $S$, say $a$ and $b$, such that $6$ divides $a+b$.
Let $a$, $b$ be two distinct real numbers and let $c$ be a positive real numbers such that
$a^4 - 2019a = b^4 - 2019b = c$.
Prove that $- \sqrt{c} < ab < 0$.
Let $k$ be a positive integer, and let $s(n)$ denote the sum of the digits of $n$.
Show that among the positive integers with $k$ digits, there are as many numbers $n$ satisfying $s(n) < s(2n)$ as there are numbers $n$ satisfying $s(n) > s(2n)$.
Prove that it is possible to choose different real numbers $a_1, a_2, . . . , a_{10}$ that the equation $$(x - a_1)(x -a_2).... (x -a_{10}) = (x + a_1)(x + a_2) ...(x + a_{10})$$ will have exactly $5$ different real roots.
For each integer $n\geqslant2$, determine the largest real constant $C_n$ such that for all positive real numbers $a_1, \ldots, a_n$ we have
\[\frac{a_1^2+\ldots+a_n^2}{n}\geqslant\left(\frac{a_1+\ldots+a_n}{n}\right)^2+C_n\cdot(a_1-a_n)^2\mbox{.}\]
[i](4th Middle European Mathematical Olympiad, Team Competition, Problem 2)[/i]
Suppose $a, b, c$ are complex numbers with $a + b + c = 0$, $a^2 + b^2 + c^2 = 0$, and $|a|,|b|,|c| \le 5$. Suppose further at least one of $a, b, c$ have real and imaginary parts that are both integers. Find the number of possibilities for such ordered triples $(a, b, c)$.
Given $3n$ points in the plane, no three collinear, is it always possible to form $n$ triangles (with vertices at the points), so that no point in the plane lies in more than one triangle?
Let $k$ be a positive integer and $a_1, a_2,... , a_k$ be nonnegative real numbers. Initially, there is a sequence of $n \geq k$ zeros written on a blackboard. At each step, Nicole chooses $k$ consecutive numbers written on the blackboard and increases the first number by $a_1$, the second one by $a_2$, and so on, until she increases the $k$-th one by $a_k$. After a positive number of steps, Nicole managed to make all the numbers on the blackboard equal. Prove that all the nonzero numbers among $a_1, a_2, . . . , a_k$ are equal.
What is the least positive integer by which $2^5 \cdot 3^6 \cdot 4^3 \cdot 5^3 \cdot 6^7$ should be multiplied so that, the product is a perfect square?
Given the equation \[ y^4 \plus{} 4y^2x \minus{} 11y^2 \plus{} 4xy \minus{} 8y \plus{} 8x^2 \minus{} 40x \plus{} 52 \equal{} 0,\] find all real solutions.
Given a triangle $ABC$ with the circumcircle $\omega$ and incenter $I$. Let the line pass through the point $I$ and the intersection of exterior angle bisector of $A$ and $\omega$ meets the circumcircle of $IBC$ at $T_A$ for the second time. Define $T_B$ and $T_C$ similarly. Prove that the radius of the circumcircle of the triangle $T_AT_BT_C$ is twice the radius of $\omega$.
Solve the equation: $\sqrt[3]{a+\sqrt{x}}+\sqrt[3]{a-\sqrt{x}}=\sqrt[3]{b}$