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

Let $BC=6$, $BX=3$, $CX=5$, and let $F$ be the midpoint of $\overline{BC}$. Let $\overline{AX}\perp\overline{BC}$ and $AF=\sqrt{247}$. If $AC$ is of the form $\sqrt{b}$ and $AB$ is of the form $\sqrt{c}$ where $b$ and $c$ are nonnegative integers, find $2c+3b$.
Determine all integers $k$ such that the equation: $$\frac{1}{x}+\frac{1}{y}+\frac{1}{z}=\frac{k}{xyz}$$ has an infinite number of integer solutions $(x,y,z)$ with gcd$(k,xyz)=1$.
Let $\omega$ be a circle. Let $E$ be on $\omega$ and $S$ outside $\omega$ such that line segment $SE$ is tangent to $\omega$. Let $R$ be on $\omega$. Let line $SR$ intersect $\omega$ at $B$ other than $R$, such that $R$ is between $S$ and $B$. Let $I$ be the intersection of the bisector of $\angle ESR$ with the line tangent to $\omega$ at $R$; let $A$ be the intersection of the bisector of $\angle ESR$ with $ER$. If the radius of the circumcircle of $\triangle EIA$ is $10$, the radius of the circumcircle of $\triangle SAB$ is $14$, and $SA = 18$, then $IA$ can be expressed in simplest form as $\frac{m}{n}$. Find $m + n$.
We have a stick of length $2n{}$ and a machine which cuts sticks of length $k\in\mathbb{N}$ with $k>1$ into two sticks with arbitrary positive integer lengths. What is the smallest number of cuts after which we can always find some sticks whose lengths sum up to $n{}$?
$(GDR 2)^{IMO1}$ Prove that there exist infinitely many natural numbers $a$ with the following property: The number $z = n^4 + a$ is not prime for any natural number $n.$
Thirteen black and six white hexagonal tiles were used to create the figure below. If a new figure is created by attaching a border of white tiles with the same size and shape as the others, what will be the difference between the total number of white tiles and the total number of black tiles in the new figure? [asy] defaultpen(linewidth(1)); real x=sqrt(3)/2; path p=rotate(30)*polygon(6); filldraw(p^^shift(0,3)*p^^shift(4x,0)*p^^shift(3x,1.5)*p^^shift(2x,3)*p^^shift(-4x,0)*p^^shift(-3x,1.5)*p^^shift(-2x,3)*p^^shift(3x,-1.5)*p^^shift(-3x,-1.5)*p^^shift(2x,-3)*p^^shift(-2x,-3)*p^^shift(0,-3)*p, black, black); draw(shift(2x,0)*p^^shift(-2x,0)*p^^shift(x,1.5)*p^^shift(-x,1.5)*p^^shift(x,-1.5)*p^^shift(-x,-1.5)*p); [/asy] $ \textbf{(A)}\ 5\qquad\textbf{(B)}\ 7\qquad\textbf{(C)}\ 11\qquad\textbf{(D)}\ 12\qquad\textbf{(E)}\ 18 $
In rectangle $ABCD$, $AB=6$ and $BC=3$. Point $E$ between $B$ and $C$, and point $F$ between $E$ and $C$ are such that $BE=EF=FC$. Segments $\overline{AE}$ and $\overline{AF}$ intersect $\overline{BD}$ at $P$ and $Q$, respectively. The ratio $BP:PQ:QD$ can be written as $r:s:t$, where the greatest common factor of $r,s$ and $t$ is $1$. What is $r+s+t$? $\textbf{(A) } 7 \qquad \textbf{(B) } 9 \qquad \textbf{(C) } 12 \qquad \textbf{(D) } 15 \qquad \textbf{(E) } 20$
Let $ABC$ be a triangle such that $AB = 3$, $BC = 4$, and $AC = 5$. Let $X$ be a point in the triangle. Compute the minimal possible value of $AX^2 + BX^2 + CX^2$
For which positive integer $n$ is the quantity $\frac{n}{3} + \frac{40}{n}$ minimized? [i]Proposed by Eugene Chen[/i]
A regular $n$-gon $P_1P_2...P_n$ satisfies $\angle P_1P_7P_8 = 178^o$. Compute $n$.
Let $ABC$ be a triangle in which $BC<AC$. Let $M$ be the mid-point of $AB$, $AP$ be the altitude from $A$ on $BC$, and $BQ$ be the altitude from $B$ on to $AC$. Suppose that $QP$ produced meets $AB$ (extended) at $T$. If $H$ is the orthocenter of $ABC$, prove that $TH$ is perpendicular to $CM$.
Let $*$ be a commutative and associative binary operation on a set $S.$ Assume that for every $x$ and $y$ in $S,$ there exists $z$ in $S$ such that $x*z=y.$ (This $z$ may depend on $x$ and $y.$) Show that if $a,b,c$ are in $S$ and $a*c=b*c,$ then $a=b.$
Let $(b_{n})_{n\in \mathbb{N}}$ be a sequence of positive real numbers such that $b_{0}=1$, $b_{n}=2+\sqrt{b_{n-1}}-2\sqrt{1+\sqrt{b_{n-1}}}$. Calculate $$\sum_{n=1}^{\infty}b_{n}2^{n}.$$
Let $ABC$ be an acute triangle and let $M$ be the midpoint of $AC$. A circle $\omega$ passing through $B$ and $M$ meets the sides $AB$ and $BC$ at points $P$ and $Q$ respectively. Let $T$ be the point such that $BPTQ$ is a parallelogram. Suppose that $T$ lies on the circumcircle of $ABC$. Determine all possible values of $\frac{BT}{BM}$.
In the triangle$ABC$ ($AC > AB$), point $N$ is the midpoint of $BC$, and $I$ is the intersection point of the angle bisectors. Ray $AI$ intersects the circumscribed circle of triangle $ABC$ at point $W$, a perpendicular $WF$ is drawn from it on side $AC$. Find the length of the segment $CF$ , if the radius of the circle inscribed in the triangle $ABC$ is equal to $r$ and $\angle INB = 45^o$. (Gryhoriy Filippovskyi)
Let $n$ and $k$ be positive integers such that $k\leq 2^n$. Banana and Corona are playing the following variant of the guessing game. First, Banana secretly picks an integer $x$ such that $1\leq x\leq n$. Corona will attempt to determine $x$ by asking some questions, which are described as follows. In each turn, Corona chooses $k$ distinct subsets of $\{1, 2, \ldots, n\}$ and, for each chosen set $S$, asks the question "Is $x$ in the set $S$?''. Banana picks one of these $k$ questions and tells both the question and its answer to Corona, who can then start another turn. Find all pairs $(n,k)$ such that, regardless of Banana's actions, Corona could determine $x$ in finitely many turns with absolute certainty. [i]Pitchayut Saengrungkongka, Thailand[/i]
In a small pond there are eleven lily pads in a row labeled $0$ through $10$. A frog is sitting on pad $1$. When the frog is on pad $N$, $0<N<10$, it will jump to pad $N-1$ with probability $\frac{N}{10}$ and to pad $N+1$ with probability $1-\frac{N}{10}$. Each jump is independent of the previous jumps. If the frog reaches pad $0$ it will be eaten by a patiently waiting snake. If the frog reaches pad $10$ it will exit the pond, never to return. What is the probability that the frog will escape being eaten by the snake? $ \textbf {(A) } \frac{32}{79} \qquad \textbf {(B) } \frac{161}{384} \qquad \textbf {(C) } \frac{63}{146} \qquad \textbf {(D) } \frac{7}{16} \qquad \textbf {(E) } \frac{1}{2} $
[b]p1.[/b] A teenager coining home after midnight heard the hall clock striking the hour. At some moment between $15$ and $20$ minutes later, the minute hand hid the hour hand. To the nearest second, what time was it then? [b]p2.[/b] The ratio of two positive integers $a$ and $b$ is $2/7$, and their sum is a four digit number which is a perfect cube. Find all such integer pairs. [b]p3.[/b] Given the integers $1, 2 , ..., n$ , how many distinct numbers are of the form $\sum_{k=1}^n( \pm k) $ , where the sign ($\pm$) may be chosen as desired? Express answer as a function of $n$. For example, if $n = 5$ , then we may form numbers: $ 1 + 2 + 3- 4 + 5 = 7$ $-1 + 2 - 3- 4 + 5 = -1$ $1 + 2 + 3 + 4 + 5 = 15$ , etc. [b]p4.[/b] $\overline{DE}$ is a common external tangent to two intersecting circles with centers at $O$ and $O'$. Prove that the lines $AD$ and $BE$ are perpendicular. [img]https://cdn.artofproblemsolving.com/attachments/1/f/40ffc1bdf63638cd9947319734b9600ebad961.png[/img] [b]p5.[/b] Find all polynomials $f(x)$ such that $(x-2) f(x+1) - (x+1) f(x) = 0$ for all $x$ . PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
How many zeros are there in the last digits of the following number $P = 11\times12\times ...\times 88\times 89$ ? (A): $16$, (B): $17$, (C): $18$, (D): $19$, (E) None of the above.
If $(3x-1)^7 = a_7x^7 + a_6x^6 + \cdots + a_0$, then $a_7 + a_6 + \cdots + a_0$ equals \[ \text{(A)}\ 0 \qquad \text{(B)}\ 1 \qquad \text{(C)}\ 64 \qquad \text{(D)}\ -64 \qquad \text{(E)}\ 128 \]
Consider 6 points on a plane such that 8 of the distances between them are equal to 1. Prove that there are at least 3 points that form an equilateral triangle.
Suppose $f(x)$ is a polynomial with integer coefficients such that $f(0) = 11$ and $f(x_1) = f(x_2) = ... = f(x_n) = 2002$ for some distinct integers $x_1, x_2, . . . , x_n$. Find the largest possible value of $n$.
Alice and Bob play a game where they start from a complete graph with $n$ vertices and take turns removing a single edge from the graph, with Alice taking the fi rst turn. The first player to disconnect the graph loses. Compute the sum of all $n$ between $2$ and $100$ inclusive such that Alice has a winning strategy. (A complete graph is one where there is an edge between every pair of vertices.)
Call a $4$-digit number $\overline{a b c d}$ [i]unnoticeable [/i] if $a +c = b +d$ and $\overline{a b c d} +\overline{c d a b}$ is a multiple of $7$. Find the number of unnoticeable numbers. Note: $a$, $b$, $c$, and $d$ are nonzero distinct digits. [i]Proposed by Aditya Rao[/i]
Find the sum of all positive integers $n$ such that $$\frac{n^3+8n^2+8n+80}{n+7}$$ is an integer. $\text{(A) }31\qquad\text{(B) }57\qquad\text{(C) }66\qquad\text{(D) }87\qquad\text{(E) }112$