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: 698

A solitaire game is played as follows. Six distinct pairs of matched tiles are placed in a bag. The player randomly draws tiles one at a time from the bag and retains them, except that matching tiles are put aside as soon as they appear in the player's hand. The game ends if the player ever holds three tiles, no two of which match; otherwise the drawing continues until the bag is empty. The probability that the bag will be emptied is $p/q,$ where $p$ and $q$ are relatively prime positive integers. Find $p+q.$
Given an integer $k>1$, show that there exist an integer an $n>1$ and distinct positive integers $a_1,a_2,\cdots a_n$, all greater than $1$, such that the sums $\sum_{j=1}^n a_j$ and $\sum_{j=1}^n \phi (a_j)$ are both $k$-th powers of some integers. (Here $\phi (m)$ denotes the number of positive integers less than $m$ and relatively prime to $m$.)
As shown in the figure, line segment $\overline{AD}$ is trisected by points $B$ and $C$ so that $AB=BC=CD=2.$ Three semicircles of radius $1,$ $\overarc{AEB},\overarc{BFC},$ and $\overarc{CGD},$ have their diameters on $\overline{AD},$ and are tangent to line $EG$ at $E,F,$ and $G,$ respectively. A circle of radius $2$ has its center on $F. $ The area of the region inside the circle but outside the three semicircles, shaded in the figure, can be expressed in the form \[\frac{a}{b}\cdot\pi-\sqrt{c}+d,\] where $a,b,c,$ and $d$ are positive integers and $a$ and $b$ are relatively prime. What is $a+b+c+d$? [asy] size(6cm); filldraw(circle((0,0),2), gray(0.7)); filldraw(arc((0,-1),1,0,180) -- cycle, gray(1.0)); filldraw(arc((-2,-1),1,0,180) -- cycle, gray(1.0)); filldraw(arc((2,-1),1,0,180) -- cycle, gray(1.0)); dot((-3,-1)); label("$A$",(-3,-1),S); dot((-2,0)); label("$E$",(-2,0),NW); dot((-1,-1)); label("$B$",(-1,-1),S); dot((0,0)); label("$F$",(0,0),N); dot((1,-1)); label("$C$",(1,-1), S); dot((2,0)); label("$G$", (2,0),NE); dot((3,-1)); label("$D$", (3,-1), S); [/asy] $\textbf{(A) } 13 \qquad\textbf{(B) } 14 \qquad\textbf{(C) } 15 \qquad\textbf{(D) } 16\qquad\textbf{(E) } 17$
A disk with radius $1$ is externally tangent to a disk with radius $5$. Let $A$ be the point where the disks are tangent, $C$ be the center of the smaller disk, and $E$ be the center of the larger disk. While the larger disk remains fixed, the smaller disk is allowed to roll along the outside of the larger disk until the smaller disk has turned through an angle of $360^\circ$. That is, if the center of the smaller disk has moved to the point $D$, and the point on the smaller disk that began at $A$ has now moved to point $B$, then $\overline{AC}$ is parallel to $\overline{BD}$. Then $\sin^2(\angle BEA)=\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Suppose Alan, Michael, Kevin, Igor, and Big Rahul are in a running race. It is given that exactly one pair of people tie (for example, two people both get second place), so that no other pair of people end in the same position. Each competitor has equal skill; this means that each outcome of the race, given that exactly two people tie, is equally likely. The probability that Big Rahul gets first place (either by himself or he ties for first) can be expressed in the form $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $m+n$.
Let $a, b, c$ be positive integers such that $a$ and $b$ are relatively prime and $c$ is relatively prime either to $a$ or $b$. Prove that there exist infinitely many triples $(x, y, z)$ of distinct positive integers such that \[x^{a}+y^{b}= z^{c}.\]
To each positive integer $ n$ it is assigned a non-negative integer $f(n)$ such that the following conditions are satisfied: (1) $ f(rs) \equal{} f(r)\plus{}f(s)$ (2) $ f(n) \equal{} 0$, if the first digit (from right to left) of $ n$ is 3. (3) $ f(10) \equal{} 0$. Find $f(1985)$. Justify your answer.
Dave arrives at an airport which has twelve gates arranged in a straight line with exactly $ 100$ feet between adjacent gates. His departure gate is assigned at random. After waiting at that gate, Dave is told the departure gate has been changed to a different gate, again at random. Let the probability that Dave walks $ 400$ feet or less to the new gate be a fraction $ \frac{m}{n}$, where $ m$ and $ n$ are relatively prime positive integers. Find $ m\plus{}n$.
$(FRA 6)$ Consider the integer $d = \frac{a^b-1}{c}$, where $a, b$, and $c$ are positive integers and $c \le a.$ Prove that the set $G$ of integers that are between $1$ and $d$ and relatively prime to $d$ (the number of such integers is denoted by $\phi(d)$) can be partitioned into $n$ subsets, each of which consists of $b$ elements. What can be said about the rational number $\frac{\phi(d)}{b}?$
Let $\vartriangle ABC$ be a triangle. Let $Q$ be a point in the interior of $\vartriangle ABC$, and let $X, Y,Z$ denote the feet of the altitudes from $Q$ to sides $BC$, $CA$, $AB$, respectively. Suppose that $BC = 15$, $\angle ABC = 60^o$, $BZ = 8$, $ZQ = 6$, and $\angle QCA = 30^o$. Let line $QX$ intersect the circumcircle of $\vartriangle XY Z$ at the point $W\ne X$. If the ratio $\frac{ WY}{WZ}$ can be expressed as $\frac{p}{q}$ for relatively prime positive integers $p, q$, find $p + q$.
Let $ c$ be a positive integer. The sequence $ a_1,a_2,\ldots$ is defined as follows $ a_1\equal{}c$, $ a_{n\plus{}1}\equal{}a_n^2\plus{}a_n\plus{}c^3$ for all positive integers $ n$. Find all $ c$ so that there are integers $ k\ge1$ and $ m\ge2$ so that $ a_k^2\plus{}c^3$ is the $ m$th power of some integer.
Prove that for every given positive integer $n$, there exists a prime $p$ and an integer $m$ such that $(a)$ $p \equiv 5 \pmod 6$ $(b)$ $p \nmid n$ $(c)$ $n \equiv m^3 \pmod p$
Suppose that necklace $\, A \,$ has 14 beads and necklace $\, B \,$ has 19. Prove that for any odd integer $n \geq 1$, there is a way to number each of the 33 beads with an integer from the sequence \[ \{ n, n+1, n+2, \dots, n+32 \} \] so that each integer is used once, and adjacent beads correspond to relatively prime integers. (Here a ``necklace'' is viewed as a circle in which each bead is adjacent to two other beads.)
Look at these fractions. At firs step we have $ \frac{0}{1}$ and $ \frac{1}{0}$, and at each step we write $ \frac{a\plus{}b}{c\plus{}d}$ between $ \frac{a}{b}$ and $ \frac{c}{d}$, and we do this forever \[ \begin{array}{ccccccccccccccccccccccccc}\frac{0}{1}&&&&&&&&\frac{1}{0}\\ \frac{0}{1}&&&&\frac{1}{1}&&&&\frac{1}{0}\\ \frac{0}{1}&&\frac{1}{2}&&\frac{1}{1}&&\frac{2}{1}&&\frac{1}{0}\\ \frac{0}{1}&\frac{1}{3}&\frac{1}{2}&\frac{2}{3}&\frac{1}{1}&\frac{3}{2}&\frac{2}{1}&\frac{3}{1}&\frac{1}{0}\\ &&&&\dots\end{array}\] a) Prove that each of these fractions is irreducible. b) In the plane we have put infinitely many circles of diameter 1, over each integer on the real line, one circle. The inductively we put circles that each circle is tangent to two adjacent circles and real line, and we do this forever. Prove that points of tangency of these circles are exactly all the numbers in part a(except $ \frac{1}{0}$). [img]http://i2.tinypic.com/4m8tmbq.png[/img] c) Prove that in these two parts all of positive rational numbers appear. If you don't understand the numbers, look at [url=http://upload.wikimedia.org/wikipedia/commons/2/21/Arabic_numerals-en.svg]here[/url].
In a regular tetrahedron the centers of the four faces are the vertices of a smaller tetrahedron. The ratio of the volume of the smaller tetrahedron to that of the larger is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n.$
Let $\triangle ABC$ be a right triangle with right angle at $C$. Let $D$ and $E$ be points on $\overline{AB}$ with $D$ between $A$ and $E$ such that $\overline{CD}$ and $\overline{CE}$ trisect $\angle C$. If $\frac{DE}{BE} = \frac{8}{15}$, then $\tan B$ can be written as $\frac{m\sqrt{p}}{n}$, where $m$ and $n$ are relatively prime positive integers, and $p$ is a positive integer not divisible by the square of any prime. Find $m+n+p$.
There are relatively prime positive integers $p$ and $q$ such that $\dfrac{p}{q}=\displaystyle\sum_{n=3}^{\infty} \dfrac{1}{n^5-5n^3+4n}$. Find $p+q$.
A wishing well is located at the point $(11,11)$ in the $xy$-plane. Rachelle randomly selects an integer $y$ from the set $\left\{ 0, 1, \dots, 10 \right\}$. Then she randomly selects, with replacement, two integers $a,b$ from the set $\left\{ 1,2,\dots,10 \right\}$. The probability the line through $(0,y)$ and $(a,b)$ passes through the well can be expressed as $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Compute $m+n$. [i]Proposed by Evan Chen[/i]
Let $n$ be an integer of the form $a^2 + b^2$, where $a$ and $b$ are relatively prime integers and such that if $p$ is a prime, $p \leq \sqrt{n}$, then $p$ divides $ab$. Determine all such $n$.
Prove that there exist infinitely many pairs $(a, b)$ of relatively prime positive integers such that \[\frac{a^{2}-5}{b}\;\; \text{and}\;\; \frac{b^{2}-5}{a}\] are both positive integers.
Let $a$ and $b$ be relatively prime positive integers such that \[\dfrac ab=\dfrac1{2^1}+\dfrac2{3^2}+\dfrac3{2^3}+\dfrac4{3^4}+\dfrac5{2^5}+\dfrac6{3^6}+\cdots,\] where the numerators always increase by $1$, and the denominators alternate between powers of $2$ and $3$, with exponents also increasing by $1$ for each subsequent term. Compute $a+b$.
Let rational numbers $a, b, c$ satisfy the conditions $a + b + c = a^2 + b^2 + c^2 \in Z$. Prove that there exist two relative prime numbers $m, n$ such that $abc =\frac{m^2}{n^3}$ .
A black bishop and a white king are placed randomly on a $2000 \times 2000$ chessboard (in distinct squares). Let $p$ be the probability that the bishop attacks the king (that is, the bishop and king lie on some common diagonal of the board). Then $p$ can be expressed in the form $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $m$. [i]Proposed by Ahaan Rungta[/i]
Let $n = 2188 = 3^7+1$ and let $A_0^{(0)}, A_1^{(0)}, ..., A_{n-1}^{(0)}$ be the vertices of a regular $n$-gon (in that order) with center $O$ . For $i = 1, 2, \dots, 7$ and $j=0,1,\dots,n-1$, let $A_j^{(i)}$ denote the centroid of the triangle \[ \triangle A_j^{(i-1)} A_{j+3^{7-i}}^{(i-1)} A_{j+2 \cdot 3^{7-i}}^{(i-1)}. \] Here the subscripts are taken modulo $n$. If \[ \frac{|OA_{2014}^{(7)}|}{|OA_{2014}^{(0)}|} = \frac{p}{q} \] for relatively prime positive integers $p$ and $q$, find $p+q$. [i]Proposed by Yang Liu[/i]