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

In the obtuse triangle $ABC$, $AM = MB, MD \perp BC, EC \perp BC$. If the area of $\triangle ABC$ is 24, then the area of $\triangle BED$ is [asy] size(200); defaultpen(linewidth(0.8)+fontsize(11pt)); pair A = (6.5,3.2), B = origin, C = (5.0), D = (3.3,0); pair Xc = (C.x,4), Xd = (D.x,4), E = intersectionpoint(A--B,C--Xc), M = intersectionpoint(D--Xd, A--B); draw(C--A--B--C--E--D--M); label("$A$",A,NE); label("$B$",B,W); label("$C$",C,SE); label("$D$",D,S); label("$E$",E,N); label("$M$",M,N); draw(rightanglemark(D,C,E,7)^^rightanglemark(B,D,M,7)); [/asy] $\textbf{(A) }9\qquad \textbf{(B) }12\qquad \textbf{(C) }15\qquad \textbf{(D) }18\qquad \textbf{(E) }\text{not uniquely determined}$
Assume that for pairwise distinct real numbers $a,b,c,d$ holds: $$ (a^2+b^2-1)(a+b)=(b^2+c^2-1)(b+c)=(c^2+d^2-1)(c+d).$$ Prove that $ a+b+c+d=0.$
The table of dimensions $n\times n$, $n\in\mathbb{N}$, is filled with numbers from $1$ to $n^2$, but the difference any two numbers on adjacent fields is at most $n$, and that for every $k = 1, 2,\dots , n^2$ set of fields whose numbers are $1, 2,\dots , k$ is connected, as well as the set of fields whose numbers are $k, k + 1,\dots , n^2$. Neighboring fields are fields with a common side, while a set of fields is considered connected if from each field to every other field of that set can be reached going only to the neighboring fields within that set. We call a pair of adjacent numbers, ie. numbers on adjacent fields, good, if their absolute difference is exactly $n$ (one number can be found in several good pairs). Prove that the table has at least $2 (n - 1)$ good pairs.
Pegs are put in a board $ 1$ unit apart both horizontally and vertically. A reubber band is stretched over $ 4$ pegs as shown in the figure, forming a quadrilateral. Its area in square units is [asy] int i,j; for(i=0; i<5; i=i+1) { for(j=0; j<4; j=j+1) { dot((i,j)); }} draw((0,1)--(1,3)--(4,1)--(3,0)--cycle, linewidth(0.7)); [/asy] $ \textbf{(A)}\ 4 \qquad \textbf{(B)}\ 4.5 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 5.5 \qquad \textbf{(E)}\ 6$
If the side of one square is the diagonal of a second square, what is the ratio of the area of the first square to the area of the second? $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ \sqrt2 \qquad \textbf{(C)}\ 1/2 \qquad \textbf{(D)}\ 2\sqrt2 \qquad \textbf{(E)}\ 4$
$\definecolor{A}{RGB}{255,0,0}\color{A}\fbox{A6.}$ Let $ P (x)$ be a polynomial with real coefficients such that $\deg P \ge 3$ is an odd integer. Let $f : \mathbb{R}\rightarrow\mathbb{Z}$ be a function such that $$\definecolor{A}{RGB}{0,0,200}\color{A}\forall_{x\in\mathbb{R}}\ f(P(x)) = P(f(x)).$$ $\definecolor{A}{RGB}{255,150,0}\color{A}\fbox{(a)}$ Prove that the range of $f$ is finite. $\definecolor{A}{RGB}{255,150,0}\color{A}\fbox{(b)}$ Show that for any positive integer $n$, there exist $P$, $f$ that satisfies the above condition and also that the range of $f$ has cardinality $n$. [i]Proposed by [/i][b][color=#419DAB]ltf0501[/color][/b]. [color=#3D9186]#1735[/color]
Let $f_n = 2^{2^n}+ 1$, $n = 1,2,3,...$, be the Fermat’s numbers. Find the least real number $C$ such that $$\frac{1}{f_1}+\frac{2}{f_2}+\frac{2^2}{f_3}+...+\frac{2^{n-1}}{f_n} <C$$ for all positive integers $n$
Using only the digits $2,3$ and $9$, how many six-digit numbers can be formed which are divisible by $6$?
Are there integers $a$ and $b$ such that $a^5b+3$ and $ab^5+3$ are both perfect cubes of integers?
John is flipping his favorite bottle, which currently contains $10$ ounces of water. However, his bottle is broken from excessive flipping, so after he performs a flip, one ounce of water leaks out of his bottle. When his bottle contains k ounces of water, he has a $\frac{1}{k+1}$ probability of landing it on its bottom. What is the expected number of number of flips it takes for John’s bottle to land on its bottom ?
Given $n$ chairs around a circle which are marked with numbers from 1 to $n$ .There are $k$, $k \leq 4 \cdot n$ students sitting on those chairs .Two students are called neighbours if there is no student sitting between them. Between two neighbours students ,there are at less 3 chairs. Find the number of choices of $k$ chairs so that $k$ students can sit on those and the condition is satisfied.
Let $\Omega_1(O_1, r_1)$ and $\Omega_2(O_2, r_2)$ be two circles that intersect in two points $X, Y$ . Let $A, C$ be the points in which the line $O_1O_2$ cuts the circle $\Omega_1$, and let $B$ be the point in which the circle $\Omega_2$ itnersect the interior of the segment $AC$, and let $M$ be the intersection of the lines $AX$ and $BY$ . Prove that $M$ is the midpoint of the segment $AX$ if and only if $O_1O_2 =\frac12 (r_1 + r_2)$.
For any nonegative real $ a $ and natural $ n, $ prove that $$ \sqrt{a+1+\sqrt{a+2+\cdots +\sqrt{a+n}}} <a+3. $$
Prove that for each natural number $d$, There is a monic and unique polynomial of degree $d$ like $P$ such that $P(1)$≠$0$ and for each sequence like $a_{1}$,$a_{2}$, $...$ of real numbers that the recurrence relation below is true for them, there is a natural number $k$ such that $0=a_{k}=a_{k+1}= ...$ : $P(n)a_{1} + P(n-1)a_{2} + ... + P(1)a_{n}=0$ $n>1$
Let $ ABCD$ be a quadrilateral in which $ AB$ is parallel to $ CD$ and perpendicular to $ AD; AB \equal{} 3CD;$ and the area of the quadrilateral is $ 4$. if a circle can be drawn touching all the four sides of the quadrilateral, find its radius.
Let $e_1, e_2, . . . e_{2019}$ be independently chosen from the set $\{0, 1, . . . , 20\}$ uniformly at random. Let $\omega = e^{\frac{2\pi}{i} 2019}$. Determine the expected value of $$|e_1\omega + e_2\omega^2 + ... + e_{2019}\omega^{2019}|.$$
Find all natural numbers $n>3$, such that $2^{2000}$ is divisible by $1+C^1_n+C^2_n+C^3_n$.
Suppose that $P(x)$ is a polynomial with degree $10$ and integer coefficients. Prove that, there is an infinite arithmetic progression (open to bothside) not contain value of $P(k)$ with $k\in\mathbb{Z}$
Let $ H $ be the orthocenter of $ ABC $ and $ A',B',C', $ the symmetric points of $ A,B,C $ with respect to $ H. $ The intersection of the segments $ BC,CA, AB $ with the circles of diameter $ A'H,B'H, $ respectively, $ C'H, $ consists of $ 6 $ points. Prove that these are concyclic.
In the figure, $[ABCD]$ is a square of side $1$. The points $E, F, G$ and $H$ are such that $[AFB], [BGC], [CHD]$ and $[DEA]$ are right-angled triangles. Knowing that the circles inscribed in each of these triangles and the circle inscribed in the square $[EFGH]$ has all the same radius, what is the measure of the radius of the circles? [img]https://1.bp.blogspot.com/-l37AEXa7_-c/X4KaJwe6HQI/AAAAAAAAMk4/14wvIipf26cRge_GqKSRwH32bp291vX4QCLcBGAsYHQ/s0/2018%2Bportugal%2Bp2.png[/img]
In the beginning, number $1$ has been written to point $(0,0)$ and $0$ has been written to any other point of integral coordinates. After every second, all numbers are replaced with the sum of the numbers in four neighbouring points at the previous second. Find the sum of numbers in all points of integral coordinates after $n$ seconds.
$1000$ children, no two of the same height, lined up. Let us call a pair of different children $(a,b)$ good if between them there is no child whose height is greater than the height of one of $a$ and $b$, but less than the height of the other. What is the greatest number of good pairs that could be formed? (Here, $(a,b)$ and $(b,a)$ are considered the same pair.) [i]Proposed by I. Bogdanov[/i]
Let $ x$, $ y$ and $ z$ be non negative numbers. Prove that \[ \frac{x^2\plus{}y^2\plus{}z^2\plus{}xy\plus{}yz\plus{}zx}{6}\le \frac{x\plus{}y\plus{}z}{3}\cdot\sqrt{\frac{x^2\plus{}y^2\plus{}z^2}{3}}\]
Find all functions $f:\mathbb{Z}\to \mathbb{Q}$ with the following properties: if $f(x)<c<f(y)$ for some rational $c$, then $f$ takes on the value of $c$, and \[f(x)+f(y)+f(z)=f(x)f(y)f(z)\] whenever $x+y+z=0$.
[u]Set 3[/u] [b]3.1[/b] Annie has $24$ letter tiles in a bag; $8$ C’s, $8$ M’s, and $8$ W’s. She blindly draws tiles from the bag until she has enough to spell “CMWMC.” What is the maximum number of tiles she may have to draw? [b]3.2[/b] Let $T$ be the answer from the previous problem. Charlotte is initially standing at $(0, 0)$ in the coordinate plane. She takes $T$ steps, each of which moves her by $1$ unit in either the $+x$, $-x$, $+y$, or $-y$ direction (e.g. her first step takes her to $(1, 0)$, $(1, 0)$, $(0, 1)$ or $(0, -1)$). After the T steps, how many possibilities are there for Charlotte’s location? [b]3.3[/b] Let $T$ be the answer from the previous problem, and let $S$ be the sum of the digits of $T$. Francesca has an unfair coin with an unknown probability $p$ of landing heads on a given flip. If she flips the coin $S$ times, the probability she gets exactly one head is equal to the probability she gets exactly two heads. Compute the probability $p$. PS. You should use hide for answers.