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

Let $a$, $b$, and $c$ be non-zero real number such that $\tfrac{ab}{a+b}=3$, $\tfrac{bc}{b+c}=4$, and $\tfrac{ca}{c+a}=5$. There are relatively prime positive integers $m$ and $n$ so that $\tfrac{abc}{ab+bc+ca}=\tfrac{m}{n}$. Find $m+n$.
For integers $n \ge k \ge 0$ we define the [i]bibinomial coefficient[/i] $\left( \binom{n}{k} \right)$ by \[ \left( \binom{n}{k} \right) = \frac{n!!}{k!!(n-k)!!} .\] Determine all pairs $(n,k)$ of integers with $n \ge k \ge 0$ such that the corresponding bibinomial coefficient is an integer. [i]Remark: The double factorial $n!!$ is defined to be the product of all even positive integers up to $n$ if $n$ is even and the product of all odd positive integers up to $n$ if $n$ is odd. So e.g. $0!! = 1$, $4!! = 2 \cdot 4 = 8$, and $7!! = 1 \cdot 3 \cdot 5 \cdot 7 = 105$.[/i]
A deck of forty cards consists of four 1's, four 2's,..., and four 10's. A matching pair (two cards with the same number) is removed from the deck. Given that these cards are not returned to the deck, let $m/n$ be the probability that two randomly selected cards also form a pair, where $m$ and $n$ are relatively prime positive integers. Find $m+n.$
If $n$ is a positive integer, let $\phi(n)$ be the number of positive integers less than or equal to $n$ that are relatively prime to $n$. Compute the value of the infinite sum \[ \sum_{n=1}^\infty \frac{\phi(n) 2^n}{9^n - 2^n} \, . \]
Two distinct points $A$ and $B$ are chosen at random from 15 points equally spaced around a circle centered at $O$ such that each pair of points $A$ and $B$ has the same probability of being chosen. The probability that the perpendicular bisectors of $OA$ and $OB$ intersect strictly inside the circle can be expressed in the form $\frac{m}{n}$, where $m,n$ are relatively prime positive integers. Find $m+n$. [i]Ray Li.[/i]
Find all polynomials $P$ with integer coefficients which satisfy the property that, for any relatively prime integers $a$ and $b$, the sequence $\{P (an + b) \}_{n \ge 1}$ contains an infinite number of terms, any two of which are relatively prime.
A triangle has sides of length $48$, $55$, and $73$. Let $a$ and $b$ be relatively prime positive integers such that $a/b$ is the length of the shortest altitude of the triangle. Find the value of $a+b$.
Maya lists all the positive divisors of $ 2010^2$. She then randomly selects two distinct divisors from this list. Let $ p$ be the probability that exactly one of the selected divisors is a perfect square. The probability $ p$ can be expressed in the form $ \frac{m}{n}$, where $ m$ and $ n$ are relatively prime positive integers. Find $ m \plus{} n$.
The function $ f : \mathbb{N} \to \mathbb{Z}$ is defined by $ f(0) \equal{} 2$, $ f(1) \equal{} 503$ and $ f(n \plus{} 2) \equal{} 503f(n \plus{} 1) \minus{} 1996f(n)$ for all $ n \in\mathbb{N}$. Let $ s_1$, $ s_2$, $ \ldots$, $ s_k$ be arbitrary integers not smaller than $ k$, and let $ p(s_i)$ be an arbitrary prime divisor of $ f\left(2^{s_i}\right)$, ($ i \equal{} 1, 2, \ldots, k$). Prove that, for any positive integer $ t$ ($ t\le k$), we have $ 2^t \Big | \sum_{i \equal{} 1}^kp(s_i)$ if and only if $ 2^t | k$.
Let $a,b$ be coprime integers. Show that the equation $ax^2 + by^2 =z^3$ has an infinite set of solutions $(x,y,z)$ with $\{x,y,z\}\in\mathbb{Z}$ and each pair of $x,y$ mutually coprime.
In triangle $ABC,$ point $D$ is on $\overline{BC}$ with $CD=2$ and $DB=5,$ point $E$ is on $\overline{AC}$ with $CE=1$ and $EA=3,$ $AB=8,$ and $\overline{AD}$ and $\overline{BE}$ intersect at $P.$ Points $Q$ and $R$ lie on $\overline{AB}$ so that $\overline{PQ}$ is parallel to $\overline{CA}$ and $\overline{PR}$ is parallel to $\overline{CB}.$ It is given that the ratio of the area of triangle $PQR$ to the area of triangle $ABC$ is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$
Bob has invented the Very Normal Coin (VNC). When the VNC is flipped, it shows heads $\textstyle\frac{1}{2}$ of the time and tails $\textstyle\frac{1}{2}$ of the time - unless it has yielded the same result five times in a row, in which case it is guaranteed to yield the opposite result. For example, if Bob flips five heads in a row, then the next flip is guaranteed to be tails. Bob flips the VNC an infinite number of times. On the $n$th flip, Bob bets $2^{-n}$ dollars that the VNC will show heads (so if the second flip shows heads, Bob wins $\$0.25$, and if the third flip shows tails, Bob loses $\$0.125$). Assume that dollars are infinitely divisible. Given that the first flip is heads, the expected number of dollars Bob is expected to win can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a, b$. Compute $100a + b$. [i]Proposed by Lewis Chen[/i]
Let $S$ denote the set of words $W = w_1w_2\ldots w_n$ of any length $n\ge0$ (including the empty string $\lambda$), with each letter $w_i$ from the set $\{x,y,z\}$. Call two words $U,V$ [i]similar[/i] if we can insert a string $s\in\{xyz,yzx,zxy\}$ of three consecutive letters somewhere in $U$ (possibly at one of the ends) to obtain $V$ or somewhere in $V$ (again, possibly at one of the ends) to obtain $U$, and say a word $W$ is [i]trivial[/i] if for some nonnegative integer $m$, there exists a sequence $W_0,W_1,\ldots,W_m$ such that $W_0=\lambda$ is the empty string, $W_m=W$, and $W_i,W_{i+1}$ are similar for $i=0,1,\ldots,m-1$. Given that for two relatively prime positive integers $p,q$ we have \[\frac{p}{q} = \sum_{n\ge0} f(n)\left(\frac{225}{8192}\right)^n,\]where $f(n)$ denotes the number of trivial words in $S$ of length $3n$ (in particular, $f(0)=1$), find $p+q$. [i]Victor Wang[/i]
A rectangle has side lengths $6$ and $8$. There are relatively prime positive integers $m$ and $n$ so that $\tfrac{m}{n}$ is the probability that a point randomly selected from the inside of the rectangle is closer to a side of the rectangle than to either diagonal of the rectangle. Find $m + n$.
There are $n$ mathematicians seated around a circular table with $n$ seats numbered $1,2,3,\cdots,n$ in clockwise order. After a break they again sit around the table. The mathematicians note that there is a positive integer $a$ such that (1) for each $k$, the mathematician who was seated in seat $k$ before the break is seated in seat $ka$ after the break (where seat $i+n$ is seat $i$); (2) for every pair of mathematicians, the number of mathematicians sitting between them after the break, counting in both the clockwise and the counterclockwise directions, is different from either of the number of mathematicians sitting between them before the break. Find the number of possible values of $n$ with $1<n<1000$.
Are there infinite increasing sequence of natural numbers, such that sum of every 2 different numbers are relatively prime with sum of every 3 different numbers?
A solid in the shape of a right circular cone is 4 inches tall and its base has a 3-inch radius. The entire surface of the cone, including its base, is painted. A plane parallel to the base of the cone divides the cone into two solids, a smaller cone-shaped solid $C$ and a frustum-shaped solid $F$, in such a way that the ratio between the areas of the painted surfaces of $C$ and $F$ and the ratio between the volumes of $C$ and $F$ are both equal to $k$. Given that $k=m/n$, where $m$ and $n$ are relatively prime positive integers, find $m+n$.
An eccentric mathematician has a ladder with $ n$ rungs that he always ascends and descends in the following way: When he ascends, each step he takes covers $ a$ rungs of the ladder, and when he descends, each step he takes covers $ b$ rungs of the ladder, where $ a$ and $ b$ are fixed positive integers. By a sequence of ascending and descending steps he can climb from ground level to the top rung of the ladder and come back down to ground level again. Find, with proof, the minimum value of $ n,$ expressed in terms of $ a$ and $ b.$
Let $a$ and $b$ be relatively prime positive integers such that $a/b$ is the sum of the real solutions to the equation \[\sqrt[3]{3x-4}+\sqrt[3]{5x-6}=\sqrt[3]{x-2}+\sqrt[3]{7x-8}.\] Find $a+b$.
Let $\phi(n,m), m \neq 1$, be the number of positive integers less than or equal to $n$ that are coprime with $m.$ Clearly, $\phi(m,m) = \phi(m)$, where $\phi(m)$ is Euler’s phi function. Find all integers $m$ that satisfy the following inequality: \[\frac{\phi(n,m)}{n} \geq \frac{\phi(m)}{m}\] for every positive integer $n.$
Find all positive integer $ m$ if there exists prime number $ p$ such that $ n^m\minus{}m$ can not be divided by $ p$ for any integer $ n$.
Let $ABCD$ be a convex quadrilateral with $\angle ABC = 120^{\circ}$ and $\angle BCD = 90^{\circ}$, and let $M$ and $N$ denote the midpoints of $\overline{BC}$ and $\overline{CD}$. Suppose there exists a point $P$ on the circumcircle of $\triangle CMN$ such that ray $MP$ bisects $\overline{AD}$ and ray $NP$ bisects $\overline{AB}$. If $AB + BC = 444$, $CD = 256$ and $BC = \frac mn$ for some relatively prime positive integers $m$ and $n$, compute $100m+n$. [i]Proposed by Michael Ren[/i]
Let $F(x,y)$ and $G(x,y)$ be relatively prime homogeneous polynomials of degree at least one having integer coefficients. Prove that there exists a number $c$ depending only on the degrees and the maximum of the absolute values of the coefficients of $F$ and $G$ such that $F(x,y)\neq G(x,y)$ for any integers $x$ and $y$ that are relatively prime and satisfy $\max \{ |x|,|y|\} > c$. [K. Gyory]
Circles of radii 5, 5, 8, and $m/n$ are mutually externally tangent, where $m$ and $n$ are relatively prime positive integers. Find $m+n.$