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

In a tetrahedron $ABCD$, the four altitudes are concurrent at $H$. The line $DH$ intersects the plane $ABC$ at $P$ and the circumsphere of $ABCD$ at $Q\neq D$. Prove that $PQ=2HP$.
Let $B$ be a set of $k$ sequences each having $n$ terms equal to $1$ or $-1$. The product of two such sequences $(a_1, a_2, \ldots , a_n)$ and $(b_1, b_2, \ldots , b_n)$ is defined as $(a_1b_1, a_2b_2, \ldots , a_nb_n)$. Prove that there exists a sequence $(c_1, c_2, \ldots , c_n)$ such that the intersection of $B$ and the set containing all sequences from $B$ multiplied by $(c_1, c_2, \ldots , c_n)$ contains at most $\frac{k^2}{2^n}$ sequences.
Quadrilateral $ABCD$ is inscribed on circle $O$. $AC\cap BD=P$. Circumcenters of $\triangle ABP,\triangle BCP,\triangle CDP,\triangle DAP$ are $O_1,O_2,O_3,O_4$. Prove that $OP,O_1O_3,O_2O_4$ share one point.
Prove that if the sum of $x^5,y^5$ and $z^5$, where $x,y$ and $z$ are integer numbers, is divisible by $25$ then the sum of some two of them is divisible by $25$.
Let $G$ be a group and $H$ a proper subgroup. If there exist three group homomorphisms $f,g,h:G\rightarrow G$ such that $f(xy)=g(x)h(y)$ for all $x,y\in G\setminus H$, prove that: [list=a] [*] $g=h$. [*] If $G$ is noncommutative and $H=Z(G)$, then $f=g=h$.
Find an ordered pair $(a,b)$ of real numbers for which $x^2+ax+b$ has a non-real root whose cube is $343$.
Two quadrangles have equal areas, perimeters and corresponding angles. Are such quadrilaterals necessarily congurent ?
Define a family of functions $S_k(n)$ for positive integers $n$ and $k$ by the following two rules: $$S_0(n) = 1,$$ $$S_k(n) = \sum_{d | n} dS_{k-1}(d).$$ Compute the remainder when $S_{30}(30)$ is divided by $1001$.
One day, before his work time at Jane Street, Sunny decided to have some fun. He saw that there are some real numbers $a_{-1},\ldots,a_{-k}$ on a blackboard, so he decided to do the following process just for fun: if there are real numbers $a_{-k},\ldots,a_{n-1}$ on the blackboard, then he computes the polynomial $$P_n(t)=(1-a_{-k}t)\cdots(1-a_{n-1}t).$$ He then writes a real number $a_n$, where $$a_n=\frac{iP_n(i)-iP_n(-i)}{P_n(i)+P_n(-i)}.$$ If $a_n$ is undefined (that is, $P_n(i)+P_n(-i)=0$), then he would stop and go to work. Show that if Sunny writes some real number on the blackboard twice (or equivalently, there exists $m>n\ge0$ such that $am=an$), then the process never stops. Moreover, show that in this case, all the numbers Sunny writes afterwards will already be written before. (usjl)
$n$ is a fixed natural number. Find the least $k$ such that for every set $A$ of $k$ natural numbers, there exists a subset of $A$ with an even number of elements which the sum of it's members is divisible by $n$.
Let $a, b, c > 0$ be real numbers with $abc = 1$. Show $$1 + ab + bc + ca \ge \min \left\{ \frac{(a + b)^2}{ab} , \frac{(b+c)^2}{bc} , \frac{(c + a)^2}{ca}\right\}.$$ When does equality holds?
Let $n$ be an integer larger than $1$ and let $S$ be the set of $n$-element subsets of the set $\{1,2,\ldots,2n\}$. Determine \[\max_{A\in S}\left (\min_{x,y\in A, x \neq y} [x,y]\right )\] where $[x,y]$ is the least common multiple of the integers $x$, $y$.
$ N $ grasshoppers are lined up in a row. At any time, one grasshopper is allowed to jump over exactly two grasshoppers standing to the right or left of him. At what $ n $ can grasshoppers rearrange themselves in reverse order?
In the coordinate plane, consider points $A = (0, 0)$, $B = (11, 0)$, and $C = (18, 0)$. Line $\ell_A$ has slope 1 and passes through $A$. Line $\ell_B$ is vertical and passes through $B$. Line $\ell_C$ has slope $-1$ and passes through $C$. The three lines $\ell_A$, $\ell_B$, and $\ell_C$ begin rotating clockwise about points $A$, $B$, and $C$, respectively. They rotate at the same angular rate. At any given time, the three lines form a triangle. Determine the largest possible area of such a triangle.
$a,b$ and $c$ are positive real numbers so that $\sum_{\text{cyc}} (a+b)^2=2\sum_{\text{cyc}} a +6abc$. Prove that $$\sum_{\text{cyc}} (a-b)^2\leq\left|2\sum_{\text{cyc}} a -6abc\right|.$$
$a,b,c $ are positive real numbers . Prove that $\sqrt[7]{\frac{a}{b+c}+\frac{b}{c+a}} +\sqrt[7]{\frac{b}{c+a}+\frac{c}{b+a}}+\sqrt[7]{\frac{c}{a+b}+\frac{a}{b+c}}\geq 3$
Find the smallest positive number from the numbers below $\text{(A)} \ 10-3\sqrt{11} \qquad \text{(B)} \ 3\sqrt{11}-10 \qquad \text{(C)} \ 18-5\sqrt{13} \qquad \text{(D)} \ 51-10\sqrt{26} \qquad \text{(E)} \ 10\sqrt{26}-51$
Let $ b, m, n$ be positive integers such that $ b > 1$ and $ m \neq n.$ Prove that if $ b^m \minus{} 1$ and $ b^n \minus{} 1$ have the same prime divisors, then $ b \plus{} 1$ is a power of 2.
For natural number $n$, define the function $f(n)$ to be the number you get by $f(n)$ adding the digits of the number $n$. For example, $f(16)=7$, $f(f(78))=6$, and $f(f(f(5978)))=2$. Find the least natural number $n$ such that $f(f(f(n)))$ is not a one-digit number.
Solve for real $x$ : \[ (x^2 + x -2 )^3 + (2x^2 - x -1)^3 = 27(x^2 -1 )^3. \]
In chess, a knight placed on a chess board can move by jumping to an adjacent square in one direction (up, down, left, or right) then jumping to the next two squares in a perpendicular direction. We then say that a square in a chess board can be attacked by a knight if the knight can end up on that square after a move. Thus, depending on where a knight is placed, it can attack as many as eight squares, or maybe even less. In a $10 \times 10$ chess board, what is the maximum number of knights that can be placed such that each square on the board can be attacked by at most one knight?
A certain calculator has only two keys [+1] and [x2]. When you press one of the keys, the calculator automatically displays the result. For instance, if the calculator originally displayed "9" and you pressed [+1], it would display "10." If you then pressed [x2], it would display "20." Starting with the display "1," what is the fewest number of keystrokes you would need to reach "200"? $ \textbf{(A)}\ 8\qquad\textbf{(B)}\ 9\qquad\textbf{(C)}\ 10\qquad\textbf{(D)}\ 11\qquad\textbf{(E)}\ 12$
In triangle $ABC$, let $\omega$ be the excircle opposite to $A$. Let $D, E$ and $F$ be the points where $\omega$ is tangent to $BC, CA$, and $AB$, respectively. The circle $AEF$ intersects line $BC$ at $P$ and $Q$. Let $M$ be the midpoint of $AD$. Prove that the circle $MPQ$ is tangent to $\omega$.
Prove that $n^3-n-3$ is not a perfect square for any integer $n$. [i]Calvin Deng.[/i]
$ABCD$ is convex and $AB\not \parallel CD,BC \not \parallel DA$. $P$ is variable point on $AD$. Circumcircles of $\triangle ABP$ and $\triangle CDP$ intersects at $Q$. Prove, that all lines $PQ$ goes through fixed point.