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

Given a triangle $ABC$ with obtuse $\angle A$ and attitude $AH$ with $H \in BC$. Let $E,F$ on $CA$, $AB$ satisfying $\angle BEH = \angle C$ and $\angle CFH = \angle B$. Let $BE$ cut $CF$ at $D$. Prove that $DE = DF$.
In an acute-angled triangle $ ABC$, $ D$ is the foot of the altitude from $ A$, and $ P$ a point on segment $ AD$. The lines $ BP$ and $ CP$ meet $ AC$ and $ AB$ at $ E$ and $ F$ respectively. Prove that $ AD$ bisects the angle $ EDF$.
Let $a,b,c$ be positive real numbers such that $a+b+c=1$. Prove that \[\frac {a}{b} + \frac {a}{c} + \frac {c}{b} + \frac {c}{a} + \frac {b}{c} + \frac {b}{a} + 6 \geq 2\sqrt{2}\left (\sqrt{\frac{1-a}{a}} + \sqrt{\frac{1-b}{b}} + \sqrt{\frac{1-c}{c}}\right ).\] When does equality hold?
Triangles $ ABC$ and $ A_1B_1C_1$ have the same area. Using compass and ruler, can we always construct triangle $ A_2B_2C_2$ equal to triangle $ A_1B_1C_1$ so that the lines $ AA_2$, $ BB_2$, and $ CC_2$ are parallel?
There are $2^n$ words of length $n$ over the alphabet $\{0, 1\}$. Prove that the following algorithm generates the sequence $w_0, w_1, \ldots, w_{2^n-1}$ of all these words such that any two consecutive words differ in exactly one digit. (1) $w_0 = 00 \ldots 0$ ($n$ zeros). (2) Suppose $w_{m-1} = a_1a_2 \ldots a_n,\quad a_i \in \{0, 1\}$. Let $e(m)$ be the exponent of $2$ in the representation of $n$ as a product of primes, and let $j = 1 + e(m)$. Replace the digit $a_j$ in the word $w_{m-1}$ by $1 - a_j$. The obtained word is $w_m$.
Determine all pairs $(f,g)$ of functions from the set of real numbers to itself that satisfy \[g(f(x+y)) = f(x) + (2x + y)g(y)\] for all real numbers $x$ and $y$. [i]Proposed by Japan[/i]
For $x\geq 0$, Prove that $\int_0^x (t-t^2)\sin ^{2002} t \,dt<\frac{1}{2004\cdot 2005}$
Let $ABC$ be a triangle and $P$ a point on the side $BC$. Let $S_1$ be the circumference with center $B$ and radius $BP$ that cuts the side $AB$ at $D$ such that $D$ lies between $A$ and $B$. Let $S_2$ be the circumference with center $C$ and radius $CP$ that cuts the side $AC$ at $E$ such that $E$ lies between $A$ and $C$. Line $AP$ cuts $S_1$ and $S_2$ at $X$ and $Y$ different from $P$, respectively. We call $T$ the point of intersection of $DX$ and $EY$. Prove that $\angle BAC+ 2 \angle DTE=180$
Let $\{a_{n}\}$ be a strictly increasing positive integers sequence such that $\gcd(a_{i}, a_{j})=1$ and $a_{i+2}-a_{i+1}>a_{i+1}-a_{i}$. Show that the infinite series \[\sum^{\infty}_{i=1}\frac{1}{a_{i}}\] converges.
Find all positive integers $a,b$ such that $b^{619}$ divides $a^{1000}+1$ and $a^{619}$ divides $b^{1000}+1$.
Sammy and Tammy run laps around a circular track that has a radius of $1$ kilometer. They begin and end at the same point and at the same time. Sammy runs $3$ laps clockwise while Tammy runs $4$ laps counterclockwise. How many times during their run is the straight-line distance between Sammy and Tammy exactly $1$ kilometer? $\text{(A) }7\qquad\text{(B) }8\qquad\text{(C) }13\qquad\text{(D) }14\qquad\text{(E) }21$
The combination to open a safe is a five-digit number. different, randomly selected from $2$ to $9$. To open the box strong, you also need a key that is labeled with the number $410639104$, which is the sum of all combinations that do not open the box. What is the combination that opens the safe?
Given a positive integer $c$, we construct a sequence of fractions $a_1, a_2, a_3,...$ as follows: $\bullet$ $a_1 =\frac{c}{c+1} $ $\bullet$ to get $a_n$, we take $a_{n-1}$ (in its most simplified form, with both the numerator and denominator chosen to be positive) and we add $2$ to the numerator and $3$ to the denominator. Then we simplify the result again as much as possible, with positive numerator and denominator. For example, if we take $c = 20$, then $a_1 =\frac{20}{21}$ and $a_2 =\frac{22}{24} = \frac{11}{12}$ . Then we find that $a_3 =\frac{13}{15}$ (which is already simplified) and $a_4 =\frac{15}{18} =\frac{5}{6}$. (a) Let $c = 10$, hence $a_1 =\frac{10}{11}$ . Determine the largest $n$ for which a simplification is needed in the construction of $a_n$. (b) Let $c = 99$, hence $a_1 =\frac{99}{100}$ . Determine whether a simplification is needed somewhere in the sequence. (c) Find two values of $c$ for which in the first step of the construction of $a_5$ (before simplification) the numerator and denominator are divisible by $5$.
Let $ u$ be an odd number. Prove that $ \frac{3^{3u}\minus{}1}{3^u\minus{}1}$ can be written as sum of two squares.
How many binary strings of length $10$ do not contain the substrings $101$ or $010$?
Given 5 points on a plane. Let $\lambda$ be the ratio of maximum value between the points to minimum value between the points. Prove that $\lambda\geq2\sin\frac{3}{10}\pi$.
Initally a pair $(x, y)$ is written on the board, such that exactly one of it's coordinates is odd. On such a pair we perform an operation to get pair $(\frac x 2, y+\frac x 2)$ if $2|x$ and $(x+\frac y 2, \frac y 2)$ if $2|y$. Prove that for every odd $n>1$ there is a even positive integer $b<n$ such that starting from the pair $(n, b)$ we will get the pair $(b, n)$ after finitely many operations.
Let $a$ and $n$ be positive integers and $s = a + a^2 + \cdots + a^n$. Prove that the last digit of $s$ is $1$ if and only if the last digits of $a$ and $n$ are both equal to $1$.
Let $D$ and $D'$ be two lines with the equations \[\frac{x-1}{2} = \frac{y-1}{3} = \frac{z-1}{4} \quad \text{and} \quad \frac{x+1}{2} = \frac{y+2}{4} = \frac{z-1}{3}.\] Find the length of their common perpendicular.
In the symmetric group \(S_n\ (n \geq 3)\), let \(G_{a,b}\) be the subgroup generated by the 2-cycle \((a\ b)\) and the n-cycle \((1\ 2\ \cdots\ n)\). Find the index \(\left|S_n : G_{a,b}\right|\).
Is it possible to arrange numbers from 1 to 2004 in some order so that the sum of any 10 consecutive numbers is divisble by 10?
Let $n$ and $m$ be integers such that $n\leq 2007 \leq m$ and $n^n \equiv -1 \equiv m^m \pmod 5$. What is the least possible value of $m-n$? $ \textbf{(A)}\ 4 \qquad\textbf{(B)}\ 5 \qquad\textbf{(C)}\ 6 \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 8 $
[b]p1.[/b] Let $p_b(m)$ be the sum of digits of $m$ when $m$ is written in base $b$. (So, for example, $p_2(5) = 2$). Let $f(0) = 2007^{2007}$, and for $n \ge 0$ let $f(n + 1) = p_7(f(n))$. What is $f(10^{10000})$? [b]p2.[/b] Compute: $$\sum^{\infty}_{n=1}\frac{(-1)^{n+1}4n}{n^4 - 8n^2 + 4}.$$ [b]p3.[/b] $ABCDEFGH$ is an octagon whose eight interior angles all have the same measure. The lengths of the eight sides of this octagon are, in some order, $$2, 2\sqrt2, 4, 4\sqrt2, 6, 7, 7, \,\,\, and \,\,\, 8.$$ Find the area of $ABCDEFGH$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Prove that the perpendiculars, drawn from the midpoints of the edges of the base of a given tetrahedron to the opposite lateral edges, have a common point if and only if the circumcenter of the tetrahedron, the centroid of the base, and the top vertex of the tetrahedron are collinear.