Found problems: 85335
Durer Math Competition CD 1st Round - geometry, 2008.D1
Prove the following inequality if we know that $a$ and $b$ are the legs of a right triangle , and $c$ is the length of the hypotenuse of this triangle: $$3a + 4b \le 5c.$$
When does equality holds?
2012 Tournament of Towns, 2
Chip and Dale play the following game. Chip starts by splitting $222$ nuts between two piles, so Dale can see it. In response, Dale chooses some number $N$ from $1$ to $222$. Then Chip moves nuts from the piles he prepared to a new (third) pile until there will be exactly $N$ nuts in any one or two piles. When Chip accomplishes his task, Dale gets an exact amount of nuts that Chip moved. What is the maximal number of nuts that Dale can get for sure, no matter how Chip acts? (Naturally, Dale wants to get as many nuts as possible, while Chip wants to lose as little as possible).
2021 Purple Comet Problems, 13
Two infinite geometric series have the same sum. The first term of the first series is $1$, and the first term of the second series is $4$. The fifth terms of the two series are equal. The sum of each series can be written as $m + \sqrt{n}$, where $m$ and $n$ are positive integers. Find $m + n$.
2022 Chile Junior Math Olympiad, 1
Find all real numbers $x, y, z$ that satisfy the following system
$$\sqrt{x^3 - y} = z - 1$$
$$\sqrt{y^3 - z} = x - 1$$
$$\sqrt{z^3 - x} = y - 1$$
1985 AMC 8, 22
Assume every $ 7$-digit whole number is a possible telephone number except those which begin with $ 0$ or $ 1$. What fraction of telephone numbers begin with $ 9$ and end with $ 0$?
\[ \textbf{(A)}\ \frac{1}{63} \qquad
\textbf{(B)}\ \frac{1}{80} \qquad
\textbf{(C)}\ \frac{1}{81} \qquad
\textbf{(D)}\ \frac{1}{90} \qquad
\textbf{(E)}\ \frac{1}{100}
\]
2020 Novosibirsk Oral Olympiad in Geometry, 7
The segments connecting the interior point of a convex non-sided $n$-gon with its vertices divide the $n$-gon into $n$ congruent triangles. For what is the smallest $n$ that is possible?
1977 All Soviet Union Mathematical Olympiad, 250
Given scales and a set of $n$ different weights. We take weights in turn and add them on one of the scales sides. Let us denote "$L$" the scales state with the left side down, and "$R$" -- with the right side down.
a) Prove that you can arrange the weights in such an order, that we shall obtain the sequence $LRLRLRLR...$ of the scales states. (That means that the state of the scales will be changed after putting every new weight.)
b) Prove that for every $n$-letter word containing $R$'s and $L$'s only you can arrange the weights in such an order, that the sequence of the scales states will be described by that word.
2009 AMC 10, 17
Five unit squares are arranged in the coordinate plane as shown, with the lower left corner at the origin. The slanted line, extending from $ (a,0)$ to $ (3,3)$, divides the entire region into two regions of equal area. What is $ a$?
[asy]size(200);
defaultpen(linewidth(.8pt)+fontsize(8pt));
fill((2/3,0)--(3,3)--(3,1)--(2,1)--(2,0)--cycle,gray);
xaxis("$x$",-0.5,4,EndArrow(HookHead,4));
yaxis("$y$",-0.5,4,EndArrow(4));
draw((0,1)--(3,1)--(3,3)--(2,3)--(2,0));
draw((1,0)--(1,2)--(3,2));
draw((2/3,0)--(3,3));
label("$(a,0)$",(2/3,0),S);
label("$(3,3)$",(3,3),NE);[/asy]$ \textbf{(A)}\ \frac12\qquad
\textbf{(B)}\ \frac35\qquad
\textbf{(C)}\ \frac23\qquad
\textbf{(D)}\ \frac34\qquad
\textbf{(E)}\ \frac45$
2011 All-Russian Olympiad Regional Round, 11.4
2011 storage buildings are connected by roads so that it is possible to reach any building from any other building, possibly using multiple roads. The buildings contain $x_1,\dots,x_{2011}$ kilogram of cement. In one move, it is possible to relocate any quantity of cement from one building to any other building that is connected to it.
The target is to have $y_1,\dots,y_{2011}$ redistributed across storage buildings and
\[x_1+x_2+\dots+x_{2011}=y_1+y_2+\dots+y_{2011}.\] What is the minimal number of moves that the redistribution can take regardless of values of $x_i$ and $y_i$ and of the road plan?
(Author: P. Karasev)
1995 All-Russian Olympiad, 5
Prove that for every natural number $a_1>1$ there exists an increasing sequence of natural numbers $a_n$ such that $a^2_1+a^2_2+\cdots+a^2_k$ is divisible by $a_1+a_2+\cdots+a_k$ for all $k \geq 1$.
[i]A. Golovanov[/i]
2011 AMC 10, 13
Two real numbers are selected independently at random from the interval [-20, 10]. What is the probability that the product of those numbers is greater than zero?
$ \textbf{(A)}\ \frac{1}{9} \qquad
\textbf{(B)}\ \frac{1}{3} \qquad
\textbf{(C)}\ \frac{4}{9} \qquad
\textbf{(D)}\ \frac{5}{9} \qquad
\textbf{(E)}\ \frac{2}{3} $
2015 AoPS Mathematical Olympiad, 3
A small apartment building has four doors, with door numbers $1, 2, 3, 4.$ John has $2^4-1=15$ keys, label with of possible nonempty subsets of $\{1,2,3,4\}$, but he forgot which key is which. If an element on the key matches the door number, the key can open the door (e.g. key $\{1,2,4\}$ can open Door 4). He picks a key at random and tries to open Door 1, which fails, so he discards it. John then randomly picks one of his remaining 14 keys and tries to open Door 2, but it doesn't open, so he throws away that key as well. He then randomly selects one of the remaining 13 keys, and tests it on Door 3. What is the probability that it will open?
[i]Proposed by dantx5[/i]
2017 IFYM, Sozopol, 5
In a group of $n$ people $A_1,A_2… A_n$ each one has a different height. On each turn we can choose any three of them and figure out which one of them is the highest and which one is the shortest. What’s the least number of turns one has to make in order to arrange these people by height, if:
a) $n=5$; b) $n=6$; c) $n=7$?
2001 Iran MO (2nd round), 2
Let $ABC$ be an acute triangle. We draw $3$ triangles $B'AC,C'AB,A'BC$ on the sides of $\Delta ABC$ at the out sides such that:
\[ \angle{B'AC}=\angle{C'BA}=\angle{A'BC}=30^{\circ} \ \ \ , \ \ \ \angle{B'CA}=\angle{C'AB}=\angle{A'CB}=60^{\circ} \]
If $M$ is the midpoint of side $BC$, prove that $B'M$ is perpendicular to $A'C'$.
2006 AMC 12/AHSME, 14
Two farmers agree that pigs are worth $ \$300$ and that goats are worth $ \$210$. When one farmer owes the other money, he pays the debt in pigs or goats, with ``change'' received in the form of goats or pigs as necessary. (For example, a $ \$390$ debt could be paid with two pigs, with one goat received in change.) What is the amount of the smallest positive debt that can be resolved in this way?
$ \textbf{(A) } \$5\qquad \textbf{(B) } \$10\qquad \textbf{(C) } \$30\qquad \textbf{(D) } \$90\qquad \textbf{(E) } \$210$
2015 China Team Selection Test, 2
Let $a_1,a_2,a_3, \cdots ,a_n$ be positive real numbers. For the integers $n\ge 2$, prove that\[ \left (\frac{\sum_{j=1}^{n} \left (\prod_{k=1}^{j}a_k \right )^{\frac{1}{j}}}{\sum_{j=1}^{n}a_j} \right )^{\frac{1}{n}}+\frac{\left (\prod_{i=1}^{n}a_i \right )^{\frac{1}{n}}}{\sum_{j=1}^{n} \left (\prod_{k=1}^{j}a_k \right )^{\frac{1}{j}}}\le \frac{n+1}{n}\]
1993 Baltic Way, 19
A convex quadrangle $ ABCD$ is inscribed in a circle with center $ O$. The angles $ AOB, BOC, COD$ and $ DOA$, taken in some order, are of the same size as the angles of the quadrangle $ ABCD$.
Prove that $ ABCD$ is a square
2007 AIME Problems, 14
Let a sequence be defined as follows: $a_{1}= 3$, $a_{2}= 3$, and for $n \ge 2$, $a_{n+1}a_{n-1}= a_{n}^{2}+2007$. Find the largest integer less than or equal to $\frac{a_{2007}^{2}+a_{2006}^{2}}{a_{2007}a_{2006}}$.
2021 Romania National Olympiad, 1
Let $f:[a,b] \rightarrow \mathbb{R}$ a function with Intermediate Value property such that $f(a) * f(b) < 0$. Show that there exist $\alpha$, $\beta$ such that $a < \alpha < \beta < b$ and $f(\alpha) + f(\beta) = f(\alpha) * f(\beta)$.
2011 VTRMC, Problem 7
Let $P(x)=x^{100}+20x^{99}+198x^{98}+a_{97}x^{97}+\ldots+a_1x+1$ be a polynomial where the $a_i~(1\le i\le97)$ are real numbers. Prove that the equation $P(x)=0$ has at least one nonreal root.
2024 Sharygin Geometry Olympiad, 9.2
Points $A, B, C, D$ on the plane do not form a rectangle. Let the sidelengths of triangle $T$ equal $AB+CD$, $AC+BD$, $AD+BC$. Prove that the triangle $T$ is acute-angled.
1997 VJIMC, Problem 3
Let $u\in C^2(\overline D)$, $u=0$ on $\partial D$ where $D$ is the open unit ball in $\mathbb R^3$. Prove that the following inequality holds for all $\varepsilon>0$:
$$\int_D|\nabla u|^2dV\le\varepsilon\int_D(\Delta u)^2dV+\frac1{4\varepsilon}\int_Du^2dV.$$(We recall that $\nabla u$ and $\Delta u$ are the gradient and Laplacian, respectively.)
1992 Czech And Slovak Olympiad IIIA, 1
For a permutation $p(a_1,a_2,...,a_{17})$ of $1,2,...,17$, let $k_p$ denote the largest $k$ for which $a_1 +...+a_k < a_{k+1} +...+a_{17}$. Find the maximum and minimum values of $k_p$ and find the sum $\sum_{p} k_p$ over all permutations$ p$.
2023 MOAA, 15
Triangle $ABC$ has $AB = 5$, $BC = 7$, $CA = 8$. Let $M$ be the midpoint of $BC$ and let points $P$ and $Q$ lie on $AB$ and $AC$ respectively such that $MP \perp AB$ and $MQ \perp AC$. If $H$ is the orthocenter of $\triangle{APQ}$ then the area of $\triangle{HPM}$ can be expressed in the form $\frac{a\sqrt{b}}{c}$ where $a$ and $c$ are relatively prime positive integers and $b$ is square-free. Find $a+b+c$.
[i]Proposed by Harry Kim[/i]
2016 Fall CHMMC, 14
For a unit circle $O$, arrange points $A,B,C,D$ and $E$ in that order evenly along $O$'s circumference. For each of those points, draw the arc centered at that point inside O from the point to its left to the point to its right. Denote the outermost intersections of these arcs as $A', B', C', D'$ and $E'$, where the prime of any point is opposite the point. The length of $AC'$ can be written as an expression $f(x)$, where $f$ is a trigonometric function. Find this expression.