Found problems: 698
Alan, Barb, Cory, and Doug are on the golf team, Doug, Emma, Fran, and Greg are on the swim team, and Greg, Hope, Inga, and Alan are on the tennis team. These nine people sit in a circle in random order. The probability that no two people from the same team sit next to each other is $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n.$
A quadratic trinomial $p(x)$ with real coefficients is given. Prove that there is a positive integer $n$ such that the equation $p(x) = \frac{1}{n}$ has no rational roots.
Let $f(x) = x^2 - x + 1$. Prove that for every natural $m>1$ the numbers $$m, f(m), f(f(m)), ...$$ are relatively prime.
Let $G$ be a hyper elementary abelian $p-$group and let $f : G \rightarrow G$ be a homomorphism. Then prove that $\ker f$ is isomorphic to $\mathrm{coker} f$.
A construction rope is tied to two trees. It is straight and taut. It is then vibrated at a constant velocity $v_1$. The tension in the rope is then halved. Again, the rope is vibrated at a constant velocity $v_2$. The tension in the rope is then halved again. And, for the third time, the rope is vibrated at a constant velocity, this time $v_3$. The value of $\frac{v_1}{v_3}+\frac{v_3}{v_1}$ can be expressed as a positive number $\frac{m\sqrt{r}}{n}$, where $m$ and $n$ are relatively prime, and $r$ is not divisible by the square of any prime. Find $m+n+r$. If the number is rational, let $r=1$.
[i](Ahaan Rungta, 2 points)[/i]
A disk with radius $10$ and a disk with radius $8$ are drawn so that the distance between their centers is $3$. Two congruent small circles lie in the intersection of the two disks so that they are tangent to each other and to each of the larger circles as shown. The radii of the smaller circles are both $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
[asy]
size(150);
defaultpen(linewidth(1));
draw(circle(origin,10)^^circle((3,0),8)^^circle((5,15/4),15/4)^^circle((5,-15/4),15/4));
[/asy]
If $p$ and $q$ are natural numbers so that \[ \frac{p}{q}=1-\frac{1}{2}+\frac{1}{3}-\frac{1}{4}+ \ldots -\frac{1}{1318}+\frac{1}{1319}, \] prove that $p$ is divisible with $1979$.
Alpha and Beta both took part in a two-day problem-solving competition. At the end of the second day, each had attempted questions worth a total of 500 points. Alpha scored 160 points out of 300 points attempted on the first day, and scored 140 points out of 200 points attempted on the second day. Beta who did not attempt 300 points on the first day, had a positive integer score on each of the two days, and Beta's daily success rate (points scored divided by points attempted) on each day was less than Alpha's on that day. Alpha's two-day success ratio was 300/500 = 3/5. The largest possible two-day success ratio that Beta could achieve is $m/n$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$?
The equation $2000x^6+100x^5+10x^3+x-2=0$ has exactly two real roots, one of which is $\frac{m+\sqrt{n}}r,$ where $m, n$ and $r$ are integers, $m$ and $r$ are relatively prime, and $r>0.$ Find $m+n+r.$
Let $n$ and $k$ be relatively prime positive integers with $k<n$. Each number in the set $M=\{1,2,3,\ldots,n-1\}$ is colored either blue or white. For each $i$ in $M$, both $i$ and $n-i$ have the same color. For each $i\ne k$ in $M$ both $i$ and $|i-k|$ have the same color. Prove that all numbers in $M$ must have the same color.
Starting from a positive integer $n$, we can replace the current number with a multiple of the current number or by deleting one or more zeroes from the decimal representation of the current number. Prove that for all values of $n$, it is possible to obtain a single-digit number by applying the above algorithm a finite number of times.
There is a nice solution to this...
For positive integers $a$, $b$, and $c$, define \[ f(a,b,c)=\frac{abc}{\text{gcd}(a,b,c)\cdot\text{lcm}(a,b,c)}. \] We say that a positive integer $n$ is $f@$ if there exist pairwise distinct positive integers $x,y,z\leq60$ that satisfy $f(x,y,z)=n$. How many $f@$ integers are there?
[i]Proposed by Michael Ren[/i]
Let $R=(8,6)$. The lines whose equations are $8y=15x$ and $10y=3x$ contain points $P$ and $Q$, respectively, such that $R$ is the midpoint of $\overline{PQ}$. The length of $PQ$ equals $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Alice knows that $3$ red cards and $3$ black cards will be revealed to her one at a time in random order. Before each card is revealed, Alice must guess its color. If Alice plays optimally, the expected number of cards she will guess correctly is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Points $A$ and $B$ are the endpoints of a diameter of a circle with center $C$. Points $D$ and $E$ lie on the same diameter so that $C$ bisects segment $\overline{DE}$. Let $F$ be a randomly chosen point within the circle. The probability that $\triangle DEF$ has a perimeter less than the length of the diameter of the circle is $\tfrac{17}{128}$. There are relatively prime positive integers m and n so that the ratio of $DE$ to $AB$ is $\tfrac{m}{n}.$ Find $m + n$.
A person flips $2010$ coins at a time. He gains one penny every time he flips a prime number of heads, but must stop once he flips a non-prime number. If his expected amount of money gained in dollars is $\frac{a}{b}$, where $a$ and $b$ are relatively prime, compute $\lceil\log_{2}(100a+b)\rceil$.
[i]Proposed by Lewis Chen[/i]
Let $\phi(n)$ denote the number of positive integers less than or equal to $n$ that are relatively prime to $n$, and let $d(n)$ denote the number of positive integer divisors of $n$. For example, $\phi(6) = 2$ and $d(6) = 4$. Find the sum of all odd integers $n \le 5000$ such that $n \mid \phi(n) d(n)$.
[i]Alex Zhu[/i]
A triangle has sides of length $48$, $55$, and $73$. A square is inscribed in the triangle such that one side of the square lies on the longest side of the triangle, and the two vertices not on that side of the square touch the other two sides of the triangle. If $c$ and $d$ are relatively prime positive integers such that $c/d$ is the length of a side of the square, find the value of $c+d$.
Define a finite set $A$ to be 'good' if it satisfies the following conditions:
[list][*][b](a)[/b] For every three disjoint element of $A,$ like $a,b,c$ we have $\gcd(a,b,c)=1;$
[*][b](b)[/b] For every two distinct $b,c\in A,$ there exists an $a\in A,$ distinct from $b,c$ such that $bc$ is divisible by $a.$[/list]
Find all good sets.
Prove that for any positive integer $ m$ there exist an infinite number of pairs of integers $(x,y)$ such that
$(\text{i})$ $x$ and $y$ are relatively prime;
$(\text{ii})$ $x$ divides $y^2+m;$
$(\text{iii})$ $y$ divides $x^2+m.$
Each of the numbers in the set $N = \{1, 2, 3, \cdots, n - 1\}$, where $n \geq 3$, is colored with one of two colors, say red or black, so that:
[i](i)[/i] $i$ and $n - i$ always receive the same color, and
[i](ii)[/i] for some $j \in N$, relatively prime to $n$, $i$ and $|j - i|$ receive the same color for all $i \in N, i \neq j.$
Prove that all numbers in $N$ must receive the same color.
Let $ABCDE$ be a convex pentagon with $AB\parallel CE$, $BC\parallel AD$, $AC\parallel DE$, $\angle ABC=120^\circ$, $AB=3$, $BC=5$, and $DE=15$. Given that the ratio between the area of triangle $ABC$ and the area of triangle $EBD$ is $m/n$, where $m$ and $n$ are relatively prime positive integers, find $m+n$.
Let $P(t) = t^3+27t^2+199t+432$. Suppose $a$, $b$, $c$, and $x$ are distinct positive reals such that $P(-a)=P(-b)=P(-c)=0$, and \[
\sqrt{\frac{a+b+c}{x}} = \sqrt{\frac{b+c+x}{a}} + \sqrt{\frac{c+a+x}{b}} + \sqrt{\frac{a+b+x}{c}}. \] If $x=\frac{m}{n}$ for relatively prime positive integers $m$ and $n$, compute $m+n$.
[i]Proposed by Evan Chen[/i]
There are three bags of marbles. Bag two has twice as many marbles as bag one. Bag three has three times as many marbles as bag one. Half the marbles in bag one, one third the marbles in bag two, and one fourth the marbles in bag three are green. If all three bags of marbles are dumped into a single pile, $\frac{m}{n}$ of the marbles in the pile would be green where $m$ and $n$ are relatively prime positive integers.
Find $m + n.$
10 students are arranged in a row. Every minute, a new student is inserted in the row (which can occur in the front and in the back as well, hence $11$ possible places) with a uniform $\tfrac{1}{11}$ probability of each location. Then, either the frontmost or the backmost student is removed from the row (each with a $\tfrac{1}{2}$ probability).
Suppose you are the eighth in the line from the front. The probability that you exit the row from the front rather than the back is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $100m+n$.
[i]Proposed by Lewis Chen[/i]