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

Alex has $75$ red tokens and $75$ blue tokens. There is a booth where Alex can give two red tokens and receive in return a silver token and a blue token, and another booth where Alex can give three blue tokens and receive in return a silver token and a red token. Alex continues to exchange tokens until no more exchanges are possible. How many silver tokens will Alex have at the end? ${ \textbf{(A)}\ 62 \qquad\textbf{(B)}\ 82 \qquad\textbf{(C)}\ 83\qquad\textbf{(D}}\ 102\qquad\textbf{(E)}\ 103 $
Let $ k \in \mathbb{N}$. A polynomial is called [i]$ k$-valid[/i] if all its coefficients are integers between 0 and $ k$ inclusively. (Here we don't consider 0 to be a natural number.) [b]a.)[/b] For $ n \in \mathbb{N}$ let $ a_n$ be the number of 5-valid polynomials $ p$ which satisfy $ p(3) = n.$ Prove that each natural number occurs in the sequence $ (a_n)_n$ at least once but only finitely often. [b]b.)[/b] For $ n \in \mathbb{N}$ let $ a_n$ be the number of 4-valid polynomials $ p$ which satisfy $ p(3) = n.$ Prove that each natural number occurs infinitely often in the sequence $ (a_n)_n$ .
Find the smallest possible value of the expression $$\frac{(a+b) (b + c)}{a + 2b+c}$$ where $a, b, c$ are arbitrary numbers from the interval $[1,2]$.
Given any triangle $ABC.$ Let $O_1$ be it's circumcircle, $O_2$ be it's nine point circle, $O_3$ is a circle with orthocenter of $ABC$, $H$, and centroid $G$, be it's diameter. Prove that: $O_1,O_2,O_3$ share axis. (i.e. chose any two of them, their axis will be the same one, if $ABC$ is an obtuse triangle, the three circle share two points.)
A polynomial $f(x)$ with integer coefficients is given. We define $d(a,k)=|f^k(a)-a|.$ It is known that for each integer $a$ and natural number $k$, $d(a,k)$ is positive. Prove that for all such $a,k$, $$d(a,k) \geq \frac{k}{3}.$$ ($f^k(x)=f(f^{k-1}(x)), f^0(x)=x.$)
Let $P_1P_2...P_n$ be an oriented closed polygonal line with no three segments passing through a single point. Each point $P_i$ is assinged the angle $180^o - \angle P_{i-1}P_iP_{i+1} \ge 0$ if $P_{i+1}$ lies on the left from the ray $P_{i-1}P_i$, and the angle $-(180^o -\angle P_{i-1}P_iP_{i+1}) < 0$ if $P_{i+1}$ lies on the right. Prove that if the sum of all the assigned angles is a multiple of $720^o$, then the number of self-intersections of the polygonal line is odd
$ ABC$ is an acute-angled triangle. $ M$ is the midpoint of $ BC$ and $ P$ is the point on $ AM$ such that $ MB \equal{} MP$. $ H$ is the foot of the perpendicular from $ P$ to $ BC$. The lines through $ H$ perpendicular to $ PB$, $ PC$ meet $ AB, AC$ respectively at $ Q, R$. Show that $ BC$ is tangent to the circle through $ Q, H, R$ at $ H$. [i]Original Formulation: [/i] For an acute triangle $ ABC, M$ is the midpoint of the segment $ BC, P$ is a point on the segment $ AM$ such that $ PM \equal{} BM, H$ is the foot of the perpendicular line from $ P$ to $ BC, Q$ is the point of intersection of segment $ AB$ and the line passing through $ H$ that is perpendicular to $ PB,$ and finally, $ R$ is the point of intersection of the segment $ AC$ and the line passing through $ H$ that is perpendicular to $ PC.$ Show that the circumcircle of $ QHR$ is tangent to the side $ BC$ at point $ H.$
Find all functions $f: \mathbb{N} \to \mathbb{N}$ such that for any pair of naturals $m,n$, $$\gcd(f(m),n) = \gcd(m,f(n)).$$
Find all the triples $(x,y,z)$ of positive integers such that $xy+yz+zx-xyz=2015$
Suppose that $O$ is a point inside a convex quadrilateral $ABCD$ such that \[ OA^2 + OB^2 + OC^2 + OD^2 = 2\mathcal A[ABCD] , \] where by $\mathcal A[ABCD]$ we have denoted the area of $ABCD$. Prove that $ABCD$ is a square and $O$ is its center. [i]Yugoslavia[/i]
In convex quadrilateral $ABCD$ with $AB = 11$ and $CD = 13,$ there is a point $P$ for which $\triangle{ADP}$ and $\triangle{BCP}$ are congruent equilateral triangles. Compute the side length of these triangles.
Find all functions $f:\mathbb R\to\mathbb R$ such that $$(x-y)f(x+y) - (x+y)f(x-y) = 2y(f(x)-f(y) - 1)$$for all $x, y\in\mathbb R$.
On a straight line $\ell$ there are four points, $A$, $B$, $C$ and $D$ in that order, such that $AB=BC=CD$. A point $E$ is chosen outside the straight line so that when drawing the segments $EB$ and $EC$, an equilateral triangle $EBC$ is formed . Segments $EA$ and $ED$ are drawn, and a point $F$ is chosen so that when drawing the segments $FA$ and $FE$, an equilateral triangle $FAE$ is formed outside the triangle $EAD$. Finally, the lines $EB$ and $FA$ are drawn , which intersect at the point $G$. If the area of triangle $EBD$ is $10$, calculate the area of triangle $EFG$.
Initially, a spinner points west. Chenille moves it clockwise $ 2 \dfrac{1}{4}$ revolutions and then counterclockwise $ 3 \dfrac{3}{4}$ revolutions. In what direction does the spinner point after the two moves? [asy]size(100); draw(circle((0,0),1),linewidth(1)); draw((0,0.75)--(0,1.25),linewidth(1)); draw((0,-0.75)--(0,-1.25),linewidth(1)); draw((0.75,0)--(1.25,0),linewidth(1)); draw((-0.75,0)--(-1.25,0),linewidth(1)); label("$N$",(0,1.25), N); label("$W$",(-1.25,0), W); label("$E$",(1.25,0), E); label("$S$",(0,-1.25), S); draw((0,0)--(-0.5,0),EndArrow);[/asy] $ \textbf{(A)}\ \text{north} \qquad \textbf{(B)}\ \text{east} \qquad \textbf{(C)}\ \text{south} \qquad \textbf{(D)}\ \text{west} \qquad \textbf{(E)}\ \text{northwest}$
Find the sum of the non-repeated roots of the polynomial $P(x) = x^6-5x^5-4x^4-5x^3+8x^2+7x+7$.
From an $n\times n$ square divided into $n^2$ unit squares, one corner unit square is cut off. Find all positive integers $n$ for which it is possible to tile the remaining part of the square with $L$-trominos. [img]https://cdn.artofproblemsolving.com/attachments/0/4/d13e6e7016d943b867f44375a2205b10ccf552.png[/img]
Let $n \ge 2$ be a natural number. For an $n$-element subset $F$ of $\{1, . . . , 2n\}$ we define $m(F)$ as the minimum of all $lcm \,\, (x, y)$ , where $x$ and $y$ are two distinct elements of $F$. Find the maximum value of $m(F)$.
In a mathematical contest, three problems, $A,B,C$ were posed. Among the participants ther were 25 students who solved at least one problem each. Of all the contestants who did not solve problem $A$, the number who solved $B$ was twice the number who solved $C$. The number of students who solved only problem $A$ was one more than the number of students who solved $A$ and at least one other problem. Of all students who solved just one problem, half did not solve problem $A$. How many students solved only problem $B$?
There are $17$ students in Marek's class, and all of them took a test. Marek's score was $17$ points higher than the arithmetic mean of the scores of the other students. By how many points is Marek's score higher than the arithmetic mean of the scores of the entire class? Justify your answer.
Let there's a function $ f: \mathbb{R}\rightarrow\mathbb{R}$ Find all functions $ f$ that satisfies: a) $ f(2u)\equal{}f(u\plus{}v)f(v\minus{}u)\plus{}f(u\minus{}v)f(\minus{}u\minus{}v)$ b) $ f(u)\geq0$
The mean age of Amanda's $4$ cousins is $8$, and their median age is $5$. What is the sum of the ages of Amanda's youngest and oldest cousins? $\textbf{(A)}\ 13\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 19\qquad\textbf{(D)}\ 22\qquad\textbf{(E)}\ 25$
Let $k \in \mathbb{N},$ $S_k = \{(a, b) | a, b = 1, 2, \ldots, k \}.$ Any two elements $(a, b)$, $(c, d)$ $\in S_k$ are called "undistinguishing" in $S_k$ if $a - c \equiv 0$ or $\pm 1 \pmod{k}$ and $b - d \equiv 0$ or $\pm 1 \pmod{k}$; otherwise, we call them "distinguishing". For example, $(1, 1)$ and $(2, 5)$ are undistinguishing in $S_5$. Considering the subset $A$ of $S_k$ such that the elements of $A$ are pairwise distinguishing. Let $r_k$ be the maximum possible number of elements of $A$. (i) Find $r_5$. (ii) Find $r_7$. (iii) Find $r_k$ for $k \in \mathbb{N}$.
If $A$ and $B$ are vertices of a polyhedron, define the [i]distance[/i] $d(A, B)$ to be the minimum number of edges of the polyhedron one must traverse in order to connect $A$ and $B$. For example, if $\overline{AB}$ is an edge of the polyhedron, then $d(A, B) = 1$, but if $\overline{AC}$ and $\overline{CB}$ are edges and $\overline{AB}$ is not an edge, then $d(A, B) = 2$. Let $Q$, $R$, and $S$ be randomly chosen distinct vertices of a regular icosahedron (regular polyhedron made up of 20 equilateral triangles). What is the probability that $d(Q, R) > d(R, S)$? $\textbf{(A)}~\frac{7}{22}\qquad\textbf{(B)}~\frac13\qquad\textbf{(C)}~\frac38\qquad\textbf{(D)}~\frac5{12}\qquad\textbf{(E)}~\frac12$
On the side $BC$ of the equilateral triangle $ABC$, choose any point $D$, and on the line $AD$, take the point $E$ such that $| B A | = | BE |$. Prove that the size of the angle $AEC$ is of does not depend on the choice of point $D$, and find its size.
Construct a regular triangle using a plywood square. ([i]You can draw a line through pairs of points lying on the distance less than the side of the square, construct a perpendicular from a point to the line the distance between them does not exceed the side of the square, and measure segments on the constructed lines equal to the side or to the diagonal of the square[/i])