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

Find the product of the minimum and maximum values of $\frac{3x+1}{9x^2+6x+2}$.
Let $ABCDEFG$ be a regular heptagon. We'll call the sides $AB$, $BC$, $CD$, $DE$, $EF$, $FG$ and $GA$ opposite to the vertices $E$, $F$, $G$, $A$, $B$, $C$ and $D$ respectively. If $M$ is a point inside the heptagon, we'll say that the line through $M$ and a vertex of the heptagon intersects a side of it (without the vertices) at a $\textit{perfect}$ point, if this side is opposite the vertex. Prove that for every choice of $M$, the number of $\textit{perfect}$ points is always odd.
Let $O$ be the intersection point of altitudes $AD$ and $BE$ of equilateral triangle $ABC.$ Points $K$ and $L$ are chosen inside segments $AO$ and $BO$ respectively such that line $KL$ bisects the perimeter of triangle $ABC.$ Let $F$ be the intersection point of lines $EK$ and $DL.$ Prove that $O$ is the circumcenter of triangle $DEF.$
From a given triangle of unit area, we choose two points independetly with uniform distribution. The straight line connecting these points divides the triangle. with probability one, into a triangle and a quadrilateral. Calculate the expected values of the areas of these two regions. [A. Renyi]
Bas has coloured each of the positive integers. He had several colours at his disposal. His colouring satis es the following requirements: • each odd integer is coloured blue, • each integer $n$ has the same colour as $4n$, • each integer $n$ has the same colour as at least one of the integers $n+2$ and $n + 4$. Prove that Bas has coloured all integers blue.
Design a planar finite non-empty set $S$ satisfying the following two conditions: (a) every line meets $S$ in at most four points; and (b) every $2$-colouring of $S$ - that is, each point of $S$ is coloured one of two colours - yields (at least) three monochromatic collinear points.
Natural number $N$ is given. Let $p_N$ - biggest prime, that $ \leq N$. On every move we replace $N$ by $N-p_N$. We repeat this until we get $0$ or $1$. Prove that exists such number $N$, that we need exactly $1000$ turns to make $0$
Given a convex pentagon $ABCDE$ such that $AE$ is parallel to $CD$ and $AB=BC$. Angle bisectors of angles $A$ and $C$ intersect at $K$. Prove that $BK$ and $AE$ are parallel.
Let $x_0 = [a], x_1 = [2a] - [a], x_2 = [3a] - [2a], x_3 = [3a] - [4a],x_4 = [5a] - [4a],x_5 = [6a] - [5a], . . . , $ where $a=\frac{\sqrt{2013}}{\sqrt{2014}}$ .The value of $x_9$ is: (A): $2$ (B): $3$ (C): $4$ (D): $5$ (E): None of the above.
Below is a diagram showing a $6 \times 8$ rectangle divided into four $6 \times 2$ rectangles and one diagonal line. Find the total perimeter of the four shaded trapezoids.
We call a diagonal of a polygon [i]nice[/i], if it is entirely inside the polygon or entirely outside the polygon. Let $P$ be an $n$–gon with no three of its vertices being on the same line. Prove that $P$ has at least $3(n-3)/2$ nice diagonals. [i]Proposed by Bálint Hujter, Budapest and Gábor Szűcs, Szikszó[/i]
Let $A$ be a set of positive integers such that for any $x,y\in A$, $$x>y\implies x-y\ge\frac{xy}{25}.$$Find the maximal possible number of elements of the set $A$.
a) Show that there are no functions $f, g: \mathbb R \to \mathbb R$ such that $g(f(x)) = x^3$ and $f(g(x)) = x^2$ for all $x \in \mathbb R$. b) Let $S$ be the set of all real numbers greater than 1. Show that there are functions $f, g : S \to S$ satsfying the condition above.
Let $n \ge 2$ be an integer. Let $a$ be the greatest positive integer such that $2^a | 5^n - 3^n$. Let $b$ be the greatest positive integer such that $2^b \le n$. Prove that $a \le b + 3$.
A driver travels for $2$ hours at $60$ miles per hour, during which her car gets $30$ miles per gallon of gasoline. She is paid $\$0.50$ per mile, and her only expense is gasoline at $\$2.00$ per gallon. What is her net rate of pay, in dollars per hour, after this expense? $\textbf{(A) }20 \qquad\textbf{(B) }22 \qquad\textbf{(C) }24 \qquad\textbf{(D) } 25\qquad\textbf{(E) } 26$
For any positive integer $n$, let $c(n)$ be the largest divisor of $n$ not greater than $\sqrt{n}$ and let $s(n)$ be the least integer $x$ such that $n < x$ and the product $nx$ is divisible by an integer $y$ where $n < y < x$. Prove that, for every $n$, $s(n) = (c(n) + 1) \cdot \left( \frac{n}{c(n)}+1\right)$
Six different points $A, B, C, D, E, F$ are marked on the plane, no four of them lie on one circle and no two segments with ends at these points lie on parallel lines. Let $P, Q,R$ be the points of intersection of the perpendicular bisectors to pairs of segments $(AD, BE)$, $(BE, CF)$ ,$(CF, DA)$ respectively, and $P', Q' ,R'$ are points the intersection of the perpendicular bisectors to the pairs of segments $(AE, BD)$, $(BF, CE)$ , $(CA, DF)$ respectively. Show that $P \ne P', Q \ne Q', R \ne R'$, and prove that the lines $PP', QQ'$ and $RR'$ intersect at one point or are parallel.
Determine the angular acceleration of the disk when $t=\text{2.0 s}$. (A) $\text{-12 rad/s}^2$. (B) $\text{-8 rad/s}^2$. (C) $\text{-4 rad/s}^2$. (D) $\text{-2 rad/s}^2$. (E) $\text{0 rad/s}^2$.
There are $10^{2015}$ planets in an Intergalactic empire. Every two planets are connected by a two-way space line served by one of $2015$ travel companies. The Emperor would like to close $k$ of these companies such that it is still possible to reach any planet from any other planet. Find the maximum value of $k$ for which this is always possible. (D. Karpov)
Show that the following implication holds for any two complex numbers $x$ and $y$: if $x+y$, $x^2+y^2$, $x^3+y^3$, $x^4+y^4\in\mathbb Z$, then $x^n+y^n\in\mathbb Z$ for all natural n.
Given $m+n$ numbers: $a_i,$ $i = 1,2, \ldots, m,$ $b_j$, $j = 1,2, \ldots, n,$ determine the number of pairs $(a_i,b_j)$ for which $|i-j| \geq k,$ where $k$ is a non-negative integer.
How many $ 7$ digit palindromes (numbers that read the same backward as forward) can be formed using the digits $ 2$, $ 2$, $ 3$, $ 3$, $ 5$, $ 5$, $ 5$? $ \textbf{(A)}\ 6 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 24 \qquad \textbf{(D)}\ 36 \qquad \textbf{(E)}\ 48$
If $ab>0$ and $\displaystyle 0<x<\frac{\pi}{2}$, prove that \[ \left ( 1+\frac{a^2}{\sin x} \right ) \left ( 1+\frac{b^2}{\cos x} \right ) \geq \frac{(1+\sqrt{2}ab)^2 \sin 2x}{2}. \]
Let $f(x)=\sum_{k=2}^{10}(\lfloor kx \rfloor -k \lfloor x \rfloor)$, where $\lfloor r \rfloor$ denotes the greatest integer less than or equal to $r$. How many distinct values does $f(x)$ assume for $x \ge 0$? $\textbf{(A)}\ 32\qquad\textbf{(B)}\ 36\qquad\textbf{(C)}\ 45\qquad\textbf{(D)}\ 46\qquad\textbf{(E)}\ \text{infinitely many}$
Prove that for every square-free integer $n>1$, there exists a prime number $p$ and an integer $m$ satisfying \[ p \mid n \quad \text{and} \quad n \mid p^2+p\cdot m^p. \]