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 cent, a stuiver ($5$ cent coin), a dubbeltje ($10$ cent coin), a kwartje ($25$ cent coin), a gulden ($100$ cent coin) and a rijksdaalder ($250$ cent coin) are divided among four children in such a way that each of them receives at least one of the six coins. How many such distributions are there?
Solve equation $x^4 = 2x^2 + \lfloor x \rfloor$, where $ \lfloor x \rfloor$ is an integral part of $x$.
Let $a,b,c$ be the sides of a triangle, with $a+b+c=1$, and let $n\ge 2$ be an integer. Show that \[ \sqrt[n]{a^n+b^n}+\sqrt[n]{b^n+c^n}+\sqrt[n]{c^n+a^n}<1+\frac{\sqrt[n]{2}}{2}. \]
The sequence $(Q_{n}(x))$ of polynomials is defined by $$Q_{1}(x)=1+x ,\; Q_{2}(x)=1+2x,$$ and for $m \geq 1 $ by $$Q_{2m+1}(x)= Q_{2m}(x) +(m+1)x Q_{2m-1}(x),$$ $$Q_{2m+2}(x)= Q_{2m+1}(x) +(m+1)x Q_{2m}(x).$$ Let $x_n$ be the largest real root of $Q_{n}(x).$ Prove that $(x_n )$ is an increasing sequence and that $\lim_{n\to \infty} x_n =0.$
Let $f$ be the unique polynomial of degree at most $2026$ such that for all $n \in \{1,2, 3, \ldots, 2027\},$ $$f(n)=\begin{cases} 1 & \text{if } $n$ \text{ is a perfect square}, \\ 0 & \text{otherwise.} \end{cases}$$ Suppose that $\tfrac{a}{b}$ is the coefficient of $x^{2025}$ in $f,$ where $a$ and $b$ are integers such that $\gcd(a,b)=1.$ Compute the unique integer $r$ between $0$ and $2026$ (inclusive) such that $a-rb$ is divisible by $2027.$ (Note that $2027$ is prime.)
Let be a natural number $ n\ge 2, $ and a matrix $ A\in\mathcal{M}_n\left( \mathbb{C} \right) $ whose determinant vanishes. Show that $$ \left( A^* \right)^2 =A^*\cdot\text{tr} A^*, $$ where $ A^* $ is the adjugate of $ A. $
Let $n$ be a natural number. Find all real numbers $x$ satisfying the equation $$\sum^n_{k=1}\frac{kx^k}{1+x^{2k}}=\frac{n(n+1)}4.$$
Let there be a convex quadrilateral $ABCD$. The angle bisector of $\angle A$ meets the angle bisector of $\angle B$, the angle bisector of $\angle D$ at $P, Q$ respectively. The angle bisector of $\angle C$ meets the angle bisector of $\angle D$, the angle bisector of $\angle B$ at $R, S$ respectively. $P, Q, R, S$ are all distinct points. $PR$ and $QS$ meets perpendicularly at point $Z$. Denote $l_A, l_B, l_C, l_D$ as the exterior angle bisectors of $\angle A, \angle B, \angle C, \angle D$. Denote $E = l_A \cap l_B$, $F= l_B \cap l_C$, $G = l_C \cap l_D$, and $H= l_D \cap l_A$. Let $K, L, M, N$ be the midpoints of $FG, GH, HE, EF$ respectively. Prove that the area of quadrilateral $KLMN$ is equal to $ZM \cdot ZK + ZL \cdot ZN$.
$n$ red and $n$ blue points on a plane are given so that no three of the $2n$ points are collinear. Prove that it is always possible to split up the points into $n$ pairs, with one red and one blue point in each pair, so that no two of the $n$ line segments which connect the two members of a pair intersect.
Given are natural numbers $n>m>1$. We draw $m$ numbers from the set $\{1,2,...,n\}$ one by one without putting the drawn numbers back. Find the expected value of the difference between the largest and the smallest of the drawn numbers.
Prove that if $7$ divides $a^2 + b^2 + 1$, then $7$ does not divide $a + b$.
Let $ABCD$ be a square with side $20$ and $T_1, T_2, ..., T_{2000}$ are points in $ABCD$ such that no $3$ points in the set $S = \{A, B, C, D, T_1, T_2, ..., T_{2000}\}$ are collinear. Prove that there exists a triangle with vertices in $S$, such that the area is less than $1/10$.
The sequence $\{a_n\}$ is defined by $a_0 = 1, a_1 = 2,$ and for $n \geq 2,$ $$a_n = a_{n-1}^2 + (a_0a_1 \dots a_{n-2})^2.$$ Let $k$ be a positive integer, and let $p$ be a prime factor of $a_k.$ Show that $p > 4(k-1).$
Let $P_1$ be a convex polyhedron with vertices $A_1,A_2,\ldots,A_9$. Let $P_i$ be the polyhedron obtained from $P_1$ by a translation that moves $A_1$ to $A_i$. Prove that at least two of the polyhedra $P_1,P_2,\ldots,P_9$ have an interior point in common.
$K$ is an arbitrary point inside the acute-angled triangle $ABC$, in which $\angle A = 30^o$. $F$ and $N$ are the points of intersection of the medians in the triangles $AKC$ and $AKB$, respectively . It is known that $FN = q$. Find the radius of the circle circumscribed around the triangle $ABC$. (Grigory Filippovsky)
The degree measure of angle $A$ is [asy] unitsize(12); draw((0,0)--(20,0)--(1,-10)--(9,5)--(18,-8)--cycle); draw(arc((1,-10),(1+19/sqrt(461),-10+10/sqrt(461)),(25/17,-155/17),CCW)); draw(arc((19/3,0),(19/3-8/17,-15/17),(22/3,0),CCW)); draw(arc((900/83,-400/83),(900/83+19/sqrt(461),-400/83+10/sqrt(461)),(900/83 - 9/sqrt(97),-400/83 + 4/sqrt(97)),CCW)); label(rotate(30)*"$40^\circ$",(2,-8.9),ENE); label("$100^\circ$",(21/3,-2/3),SE); label("$110^\circ$",(900/83,-317/83),NNW); label("$A$",(0,0),NW);[/asy] $ \text{(A)}\ 20\qquad\text{(B)}\ 30\qquad\text{(C)}\ 35\qquad\text{(D)}\ 40\qquad\text{(E)}\ 45 $
The areas of the faces $ABD,ACD,BCD,BCA$ of a tetrahedron $ABCD$ are $S_1,S_2,Q_1,Q_2$, respectively. The angle between the faces $ABD$ and $ACD$ equals $\alpha$, and the angle between $BCD$ and $BCA$ is $\beta$. Prove that $$S_1^2+S_2^2-2S_1S_2\cos\alpha=Q_1^2+Q_2^2-2Q_1Q_2\cos\beta.$$
The population of Nosuch Junction at one time was a perfect square. Later, with an increase of 100, the population was one more than a perfect square. Now, with an additional increase of 100, the population is again a perfect square. The original population is a multiple of: $ \textbf{(A)}\ 3 \qquad \textbf{(B)}\ 7 \qquad \textbf{(C)}\ 9 \qquad \textbf{(D)}\ 11 \qquad \textbf{(E)}\ 17$
Let $\vartriangle ABC$ be an equilateral triangle and let $P$ be a point in its interior. Let the lines $AP,BP,CP$ meet the sides $BC,CA,AB$ in the points $X,Y,Z$ respectively. Prove that $XY \cdot YZ\cdot ZX \ge XB\cdot YC\cdot ZA$.
Projector emits rays in space. Consider all acute angles between the rays. It is known that no matter what ray we remove, the number of acute angles decreases by exactly $2$ What is the maximal number of rays the projector can emit? [i]M. Karpuk, E. Barabanov[/i]
Show that for every natural number $ a\ge 3, $ there are infinitely many natural numbers $ n $ such that $ a^n\equiv 1\pmod n . $ Does this hold for $ n=2? $
Consider a half-plane with the boundary line $p$ and two points $M,N$ in it such that the distances $Mp$ and $Np$ are different. Construct a trapezoid $MNPQ$ with area $MN^2$ such that $P,Q\in p.$ Discuss conditions of solvability.
If $ {|x|}<{1}$ and ${|y|}<1$ then prove that $|\frac{x-y}{1-xy}|<1$
Let $p$ be a prime number greater than $5$. Prove that there exists a positive integer $n$ such that $p$ divides $20^n+ 15^n-12^n$.
Let $I_B, I_C$ be the $B, C$-excenters of triangle $ABC$, respectively. Let $O$ be the circumcenter of $ABC$. If $BI_B$ is perpendicular to $AO$, $AI_C = 3$ and $AC = 4\sqrt2$, then $AB^2$ can be expressed as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. Note: In triangle $\vartriangle ABC$, the $A$-excenter is the intersection of the exterior angle bisectors of $\angle ABC$ and $\angle ACB$. The $B$-excenter and $C$-excenter are defined similarly.