Found problems: 698
The sum $\frac{1}{1}+\frac{1}{2}+\frac{1}{3}+\frac{1}{4}+\frac{1}{5}+\frac{1}{6}=\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n.$
Let $ACDB$ be a cyclic quadrilateral with circumcenter $\omega$. Let $AC=5$, $CD=6$, and $DB=7$. Suppose that there exists a unique point $P$ on $\omega$ such that $\overline{PC}$ intersects $\overline{AB}$ at a point $P_1$ and $\overline{PD}$ intersects $\overline{AB}$ at a point $P_2$, such that $AP_1=3$ and $P_2B=4$. Let $Q$ be the unique point on $\omega$ such that $\overline{QC}$ intersects $\overline{AB}$ at a point $Q_1$, $\overline{QD}$ intersects $\overline{AB}$ at a point $Q_2$, $Q_1$ is closer to $B$ than $P_1$ is to $B$, and $P_2Q_2=2$. The length of $P_1Q_1$ can be written as $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.
Let $x$ satisfy $(6x + 7) + (8x + 9) = (10 + 11x) + (12 + 13x).$ There are relatively prime positive integers so that $x = -\tfrac{m}{n}$. Find $m + n.$
Let $k$ be a fixed integer greater than 1, and let ${m=4k^2-5}$. Show that there exist positive integers $a$ and $b$ such that the sequence $(x_n)$ defined by \[x_0=a,\quad x_1=b,\quad x_{n+2}=x_{n+1}+x_n\quad\text{for}\quad n=0,1,2,\dots,\] has all of its terms relatively prime to $m$.
[i]Proposed by Jaroslaw Wroblewski, Poland[/i]
Let $k$ be a nonzero natural number and $m$ an odd natural number . Prove that there exist a natural number $n$ such that the number $m^n+n^m$ has at least $k$ distinct prime factors.
Six children stand in a line outside their classroom. When they enter the classroom, they sit in a circle in random order. There are relatively prime positive integers $m$ and $n$ so that $\tfrac{m}{n}$ is the probability that no two children who stood next to each other in the line end up sitting next to each other in the circle. Find $m + n$.
For a real number $x$, let $\lfloor x\rfloor$ stand for the largest integer that is less than or equal to $x$. Prove that
\[ \left\lfloor{(n-1)!\over n(n+1)}\right\rfloor \]
is even for every positive integer $n$.
A sequence $ a_1, a_2, \ldots$ of non-negative integers is defined by the rule $ a_{n \plus{} 2} \equal{} |a_{n \plus{} 1} \minus{} a_n|$ for $ n\ge 1$. If $ a_1 \equal{} 999, a_2 < 999,$ and $ a_{2006} \equal{} 1$, how many different values of $ a_2$ are possible?
$ \textbf{(A) } 165 \qquad \textbf{(B) } 324 \qquad \textbf{(C) } 495 \qquad \textbf{(D) } 499 \qquad \textbf{(E) } 660$
There are $n$ coins lying in a circle. Each coin has two sides, $+$ and $-$. A $flop$ means to flip every coin that has two different neighbors simultaneously, while leaving the others alone. For instance, $++-+$, after one $flop$, becomes $+---$.
For $n$ coins, let us define $M$ to be a $perfect$ $number$ if for any initial arrangement of the coins, the arrangement of the coins after $m$ $flops$ is exactly the same as the initial one.
(a) When $n=1024$, find a perfect number $M$.
(b) Find all $n$ for which a perfect number $M$ exist.
A frog starts at $0$ on a number line and plays a game. On each turn the frog chooses at random to jump $1$ or $2$ integers to the right or left. It stops moving if it lands on a nonpositive number or a number on which it has already landed. If the expected number of times it will jump is $\tfrac{p}{q}$ for relatively prime positive integers $p$ and $q$, find $p+q$.
[i]Proposed by Michael Kural[/i]
Prove that the set of all the points with both coordinates begin rational numbers can be written as a reunion of two disjoint sets $ A$ and $ B$ such that any line that that is parallel with $ Ox$, and respectively $ Oy$ intersects $ A$, and respectively $ B$ in a finite number of points.
[b]Problem:[/b]For a positive integer $ n$,let $ V(n; b)$ be the number of decompositions of $ n$ into a
product of one or more positive integers greater than $ b$. For example,$ 36 \equal{} 6.6 \equal{}4.9 \equal{} 3.12 \equal{} 3 .3. 4$, so that $ V(36; 2) \equal{} 5$.Prove that for all positive integers $ n$; b it holds that $ V(n;b)<\frac{n}{b}$. :)
Find all pairs of positive integers $(x,y)$ with the following property:
If $a,b$ are relative prime and positive divisors of $ x^3 + y^3$, then $a+b - 1$ is divisor of $x^3+y^3$.
(Cyprus)
Let $f$ be the function of the set of positive integers into itself, defi ned by $f(1) = 1$,
$f(2n) = f(n)$ and $f(2n + 1) = f(n) + f(n + 1)$. Show that, for any positive integer $n$, the
number of positive odd integers m such that $f(m) = n$ is equal to the number of positive
integers[color=#0000FF][b] less or equal to [/b][/color]$n$ and coprime to $n$.
[color=#FF0000][mod: the initial statement said less than $n$, which is wrong.][/color]
Prove that between every $27$ different positive integers , less than $100$, there exist some two which are[color=red] NOT [/color]relative prime.
[u]babis[/u]
Let $ S \equal{} \{1,2,3,\cdots ,280\}$. Find the smallest integer $ n$ such that each $ n$-element subset of $ S$ contains five numbers which are pairwise relatively prime.
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$.)
Let $\triangle PQR$ be a triangle with $\angle P = 75^\circ$ and $\angle Q = 60^\circ$. A regular hexagon $ABCDEF$ with side length 1 is drawn inside $\triangle PQR$ so that side $\overline{AB}$ lies on $\overline{PQ}$, side $\overline{CD}$ lies on $\overline{QR}$, and one of the remaining vertices lies on $\overline{RP}$. There are positive integers $a$, $b$, $c$, and $d$ such that the area of $\triangle PQR$ can be expressed in the form $\tfrac{a+b\sqrt c}d$, where $a$ and $d$ are relatively prime and $c$ is not divisible by the square of any prime. Find $a+b+c+d$.
For each integer $n$ ($n \ge 2$), let $f(n)$ denote the sum of all positive integers that are at most $n$ and not relatively prime to $n$.
Prove that $f(n+p) \neq f(n)$ for each such $n$ and every prime $p$.
Given that $\sum_{k=1}^{35}\sin 5k=\tan \frac mn,$ where angles are measured in degrees, and $m$ and $n$ are relatively prime positive integers that satisfy $\frac mn<90,$ find $m+n.$
In triangle $ ABC$, angle $ C$ is a right angle and $ CB > CA$. Point $ D$ is located on $ \overline{BC}$ so that angle $ CAD$ is twice angle $ DAB$. If $ AC/AD \equal{} 2/3$, then $ CD/BD \equal{} m/n$, where $ m$ and $ n$ are relatively prime positive integers. Find $ m \plus{} n$.
$ \textbf{(A)}\ 10\qquad
\textbf{(B)}\ 14\qquad
\textbf{(C)}\ 18\qquad
\textbf{(D)}\ 22\qquad
\textbf{(E)}\ 26$
A paper equilateral triangle $ABC$ has side length $12$. The paper triangle is folded so that vertex $A$ touches a point on side $\overline{BC}$ a distance $9$ from point $B$. The length of the line segment along which the triangle is folded can be written as $\frac{m\sqrt{p}}{n}$, where $m$, $n$, and $p$ are positive integers, $m$ and $n$ are relatively prime, and $p$ is not divisible by the square of any prime. Find $m+n+p$.
[asy]
import cse5;
size(12cm);
pen tpen = defaultpen + 1.337;
real a = 39/5.0;
real b = 39/7.0;
pair B = MP("B", (0,0), dir(200));
pair A = MP("A", (9,0), dir(-80));
pair C = MP("C", (12,0), dir(-20));
pair K = (6,10.392);
pair M = (a*B+(12-a)*K) / 12;
pair N = (b*C+(12-b)*K) / 12;
draw(B--M--N--C--cycle, tpen);
draw(M--A--N--cycle);
fill(M--A--N--cycle, mediumgrey);
pair shift = (-20.13, 0);
pair B1 = MP("B", B+shift, dir(200));
pair A1 = MP("A", K+shift, dir(90));
pair C1 = MP("C", C+shift, dir(-20));
draw(A1--B1--C1--cycle, tpen);[/asy]
Let $a$ and $b$ be coprime integers, greater than or equal to $1$. Prove that all integers $n$ greater than or equal to $(a - 1)(b - 1)$ can be written in the form:
\[n = ua + vb, \qquad \text{with} (u, v) \in \mathbb N \times \mathbb N.\]