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 circle inscribed within quadrilateral $ABCD$ is tangent to $AB$ at $E$, to $BC$ at $F$, to $CD$ at $G$, and to $DA$ at $H$. Suppose that $AE = 6$, $EB = 30$, $CG = 10$, and $GD = 2$. Compute $EF^2 + F G^2 + GH^2 + HE^2$. .
The vertices of a right triangle $ABC$ inscribed in a circle divide the circumference into three arcs. The right angle is at $A$, so that the opposite arc $BC$ is a semicircle while arc $BC$ and arc $AC$ are supplementary. To each of three arcs, we draw a tangent such that its point of tangency is the mid point of that portion of the tangent intercepted by the extended lines $AB,AC$. More precisely, the point $D$ on arc $BC$ is the midpoint of the segment joining the points $D'$ and $D''$ where tangent at $D$ intersects the extended lines $AB,AC$. Similarly for $E$ on arc $AC$ and $F$ on arc $AB$. Prove that triangle $DEF$ is equilateral.
What is the smallest positive integer that cannot be written as the sum of two nonnegative palindromic integers? (An integer is [i]palindromic[/i] if the sequence of decimal digits are the same when read backwards.)
In a circle with a radius of $1$ is an inscribed hexagon (convex). Prove that if the multiple of all diagonals that connects vertices of neighboring sides is equal to $27$ then all angles of hexagon are equals. [i]V. Petkov, I. Tonov[/i]
Let $m>1$ be an odd integer. Let $n=2m$ and $\theta=e^{2\pi i\slash n}$. Find integers $a_{1},\ldots,a_{k}$ such that $\sum_{i=1}^{k}a_{i}\theta^{i}=\frac{1}{1-\theta}$.
Let $ n$ be a $ 5$-digit number, and let $ q$ and $ r$ be the quotient and remainder, respectively, when $ n$ is divided by $ 100$. For how many values of $ n$ is $ q \plus{} r$ divisible by $ 11$? $ \textbf{(A)}\ 8180 \qquad \textbf{(B)}\ 8181 \qquad \textbf{(C)}\ 8182 \qquad \textbf{(D)}\ 9000 \qquad \textbf{(E)}\ 9090$
Suppose that $n>1$ and $P_n(x)$ is a polynomial of degree $n$. For $k =1,2, . . . ,n$ we have $P_n(k)=k(k+1)$. Also $P_n(0) = 1$. For all $n$ there exists an integer $m > n$ such that $P_n(m) = P_{n+2}(m)$. Find the value of $m$ for $n = 10$.
How many permutations of $123456$ have exactly one number in the correct place?
Rhombus $ ABCD$, with a side length $ 6$, is rolled to form a cylinder of volume $ 6$ by taping $ \overline{AB}$ to $ \overline{DC}.$ What is $ \sin(\angle ABC)$? $ \textbf{(A)}\ \frac {\pi}{9} \qquad \textbf{(B)}\ \frac {1}{2} \qquad \textbf{(C)}\ \frac {\pi}{6} \qquad \textbf{(D)}\ \frac {\pi}{4} \qquad \textbf{(E)}\ \frac {\sqrt3}{2}$
For how many ordered pairs of positive integers $ (m,n)$, $ m \cdot n$ divides $ 2008 \cdot 2009 \cdot 2010$ ? $\textbf{(A)}\ 2\cdot3^7\cdot 5 \qquad\textbf{(B)}\ 2^5\cdot3\cdot 5 \qquad\textbf{(C)}\ 2^5\cdot3^7\cdot 5 \qquad\textbf{(D)}\ 2^3\cdot3^5\cdot 5^2 \qquad\textbf{(E)}\ \text{None}$
For an arbitrary positive integer $m$, not divisible by $3$, consider the permutation $x \mapsto 3x \pmod{m}$ on the set $\{ 1,2,\dotsc ,m-1\}$. This permutation can be decomposed into disjointed cycles; for instance, for $m=10$ the cycles are $(1\mapsto 3\to 9,\mapsto 7,\mapsto 1)$, $(2\mapsto 6\mapsto 8\mapsto 4\mapsto 2)$ and $(5\mapsto 5)$. For which integers $m$ is the number of cycles odd?
A circle with diameter $AB$ is drawn, and the point $ P$ is chosen on segment $AB$ so that $\frac{AP}{AB} =\frac{1}{42}$ . Two new circles $a$ and $b$ are drawn with diameters $AP$ and $PB$ respectively. The perpendicular line to $AB$ passing through $ P$ intersects the circle twice at points $S$ and $T$ . Two more circles $s$ and $t$ are drawn with diameters $SP$ and $ST$ respectively. For any circle $\omega$ let $A(\omega)$ denote the area of the circle. What is $\frac{A(s)+A(t)}{A(a)+A(b)}$?
We know that $k$ is a positive integer and the equation \[ x^3+y^3-2y(x^2-xy+y^2)=k^2(x-y) \quad (1) \] has one solution $(x_0,y_0)$ with $x_0,y_0\in \mathbb{Z}-\{0\}$ and $x_0\neq y_0$. Prove that i) the equation (1) has a finite number of solutions $(x,y)$ with $x,y\in \mathbb{Z}$ and $x\neq y$; ii) it is possible to find $11$ addition different solutions $(X,Y)$ of the equation (1) with $X,Y\in \mathbb{Z}-\{0\}$ and $X\neq Y$ where $X,Y$ are functions of $x_0,y_0$.
Suppose that $\xi \ne 1$ is a root of the polynomial $f(x) = x^{167} -1$. Compute $$\left| \sum_{0<a<b<167} \xi^{a^2+b^2} \right|.$$ In the above summation $a,b$ are integers
Positive real numbers $a,b,c$ satisfy the relation $abc=1$. Prove the inequality: $\frac{a+3}{(a+1)^{2}}+\frac{b+3}{(b+1)^{2}}+\frac{c+3}{(c+1)^{2}}\geq3$.
Prove that every real function, defined on all of $\mathbb R$, can be represented as a sum of two functions whose graphs both have an axis of symmetry. [i]D. Tereshin[/i]
Problem 4. Angel has a warehouse, which initially contains $100$ piles of $100$ pieces of rubbish each. Each morning, Angel performs exactly one of the following moves: (a) He clears every piece of rubbish from a single pile. (b) He clears one piece of rubbish from each pile. However, every evening, a demon sneaks into the warehouse and performs exactly one of the following moves: (a) He adds one piece of rubbish to each non-empty pile. (b) He creates a new pile with one piece of rubbish. What is the first morning when Angel can guarantee to have cleared all the rubbish from the warehouse?
Prove that the number \[ 3 \underbrace{99\ldots9}_{2025} \underbrace{60\ldots01}_{2025} \] is a square of a positive integer.
Let $ABC$ be an acute-angled triangle inscribed in the circle $(O)$. Let $AD$ be the diameter of $(O)$. The points $M,N$ are chosen on $BC$ such that $OM\parallel AB, ON\parallel AC$. The lines $DM,DN$ cut $(O)$ again at $P,Q$. Prove that $BC=DP=DQ$. Tran Quang Hung, Vietnam
Divide the numbers $$1, 2,3, 4,5$$ into two arbitrarily chosen sets. Prove that one of the sets contains two numbers and their difference.
For integers $z$, let $\#(z)$ denote the number of integer ordered pairs $(x, y)$ that satisfy $x^2 - xy + y^2 = z$. How many integers $z$ between $0$ and $150$ inclusive satisfy $\#(z) \equiv 6$ (mod $12$)?
Points $D,E,F$ are on the sides $BC, CA$ and $AB$, respectively which satisfy $EF || BC$, $D_1$ is a point on $BC,$ Make $D_1E_1 || D_E, D_1F_1 || DF$ which intersect $AC$ and $AB$ at $E_1$ and $F_1$, respectively. Make $\bigtriangleup PBC \sim \bigtriangleup DEF$ such that $P$ and $A$ are on the same side of $BC.$ Prove that $E, E_1F_1, PD_1$ are concurrent. [color=red][Edit by Darij: See my post #4 below for a [b]possible correction[/b] of this problem. However, I am not sure that it is in fact the problem given at the TST... Does anyone have a reliable translation?][/color]
In the $xyz$-space take four points $P(0,\ 0,\ 2),\ A(0,\ 2,\ 0),\ B(\sqrt{3},-1,\ 0),\ C(-\sqrt{3},-1,\ 0)$. Find the volume of the part satifying $x^2+y^2\geq 1$ in the tetrahedron $PABC$. 50 points
On sport games there was 1991 participant from which every participant knows at least n other participants(friendship is mutual). Determine the lowest possible n for which we can be sure that there are 6 participants between which any two participants know each other.
For a sequence $a_1,a_2,...,a_m$ of real numbers, define the following sets \[A=\{a_i | 1\leq i\leq m\}\ \text{and} \ B=\{a_i+2a_j | 1\leq i,j\leq m, i\neq j\}\] Let $n$ be a given integer, and $n>2$. For any strictly increasing arithmetic sequence of positive integers, determine, with proof, the minimum number of elements of set $A\triangle B$, where $A\triangle B$ $= \left(A\cup B\right) \setminus \left(A\cap B\right).$